Related papers: Combinatorics of embeddings
It is known that the $k$-faces of the permutohedron $\Pi_n$ are labeled by (all possible) linearly ordered partitions of the set $[n]=\{1,...,n\}$ into $(n-k)$ non-empty parts. The incidence relation corresponds to the refinement: a face…
We study the potentially undecidable problem of whether a given 2-dimensional CW complex can be embedded into $\mathbb{R}^4$. We provide operations that preserve embeddability, including joining and cloning of 2-cells, as well as…
We observe that many of the 2-complexes constructed by Freedman-Krushkal-Teichner in their paper on the incompleteness of the van Kampen embedding obstruction can actually be PL immersed in $\mathbb{R}^4$ in such a way that the images of…
For each positive integer $n$, let $G_n$ be the graph whose vertices are the partitions of $n$, with edges corresponding to elementary transfers of one cell between two parts, followed by reordering. Let $K_n := \mathrm{Cl}(G_n)$ be the…
We exhibit several families of planar graphs that are minor-minimal intrinsically spherical $3$-linked. A graph is intrinsically spherical 3-linked if it is planar graph that has, in every spherical embedding, a non-split 3-link consisting…
In this study, we introduce the notion of $PL_\delta$-homeomorphisms of $\mathbb{R}^n$. Furthermore, we provide a combinatorial criterion reliant on the vertices and edges of simplicial structures, to determine whether a piecewise-linear…
We investigate the space $C(X)$ of images of linearly embedded skeleta of simplices $X$ in $\mathbb R^n$, for two families of codimension 2 complexes, each ranging over $n$. In the first family, $X=K$ is the $(n-2)$-skeleton of the…
For $n \geq 1$, the twistor space $\mathfrak{Z}(\mathbb{S}^{2n})$ of the conformal $2n$-sphere is biholomorphic to the Zariski closure, taken in the complex Grassmannian manifold $\mathbf{G}(n+1, 2n+2)$, of the set of graphs of…
(1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a…
This paper considers the planar figure of a combinatorial polytope or tessellation identified by the Coxeter symbol $k_{i,j}$ , inscribed in a conic, satisfying the geometric constraint that each octahedral cell has a centre. This…
A fundamental theorem in the study of Dunwoody manifolds is a classification of finite graphs on $2n$ vertices that satisfy seven conditions (concerning planarity, regularity, and a cyclic automorphism of order $n$). Its significance is…
Every convex body K in R^n has a coordinate projection PK that contains at least vol(0.1 K) cells of the integer lattice PZ^n, provided this volume is at least one. Our proof of this counterpart of Minkowski's theorem is based on an…
Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…
We associate the lepton-quark families with the vertices of the 4D polytopes 5-cell and the rectified 5-cell derived from the SU(5) Coxeter-Dynkin diagram. The off-diagonal gauge bosons are associated with the root poytope (1000)A4 whose…
A polytope is called indecomposable if it cannot be expressed nontrivially as a Minkowski sum of other polytopes. Since Gale introduced the concept in 1954, several increasingly strong criteria have been developed to characterize…
For every simple Hermitian Lie group $G$, we consider a certain maximal parabolic subgroup whose unipotent radical $N$ is either abelian (if $G$ is of tube type) or two-step nilpotent (if $G$ is of non-tube type). By the generalized…
A graph is a ``$k$-Kuratowski graph'' if it has exactly $k$ components, each isomorphic to $K_5$ or to $K_{3,3}$. We prove that if a graph $G$ contains no $k$-Kuratowski graph as a minor,then there is a set $X$ of boundedly many vertices…
Tessellations of $R^3$ that use convex polyhedral cells to fill the space can be extremely complicated, especially if they are not facet-to-facet, that is, if the facets of a cell do not necessarily coincide with the facets of that cell's…
To every realizable oriented matroid there corresponds an arrangement of real hyperplanes. The homeomorphism type of the complexified complement of such an arrangement is completely determined by the oriented matroid. In this paper we study…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…