Nearly Neighbourly Families of Standard Boxes

It is shown that each nearly neighbourly family of standard boxes in $\mathbb{R}^3$ has at most 12 elements. A combinatorial classification of all such families that have exactly 12 elements is given. All the families satisfying an extra property called incompressibility are described. Compressible families are discussed briefly.

Quadratic-monomial generated domains from mixed signed, directed graphs

Determining whether an arbitrary subring [Formula: see text] of [Formula: see text] is a normal or Cohen-Macaulay domain is, in general, a nontrivial problem, even in the special case of a monomial generated domain. We provide a complete characterization of the normality, normalizations, and Serre’s [Formula: see text] condition for quadratic-monomial generated domains. For a quadratic-monomial generated domain [Formula: see text], we develop a combinatorial structure that assigns, to each quadratic monomial of the ring, an edge in a mixed signed, directed graph [Formula: see text], i.e. a graph with signed edges and directed edges. We classify the normality and the normalizations of such rings in terms of a generalization of the combinatorial odd cycle condition on [Formula: see text]. We also generalize and simplify a combinatorial classification of Serre’s [Formula: see text] condition for such rings and construct non-Cohen–Macaulay rings.

A combinatorial classification of postcritically fixed Newton maps

We give a combinatorial classification for the class of postcritically fixed Newton maps of polynomials as dynamical systems. This lays the foundation for classification results of more general classes of Newton maps. A fundamental ingredient is the proof that for every Newton map (postcritically finite or not) every connected component of the basin of an attracting fixed point can be connected to$\infty$through a finite chain of such components.