Related papers: Combinatorial constructions of three-dimensional s…
A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…
We prove that a generic complete intersection Calabi-Yau 3-fold defined by sections of ample line bundles on a product of projective spaces admits a conifold transition to a connected sum of S^{3} \times S^{3}. In this manner, we obtain…
A new version of the self-similarity spin transform on three-dimensional cubic lattices is proposed that makes possible calculation of nontrivial spin correlations in a "combinatorial" model, in which all permitted spin configurations have…
In this article we consider a generalization of manifolds and orbifolds which we call quasifolds; quasifolds of dimension k are locally isomorphic to the quotient of R^k by the action of a discrete group - tipically they are not Hausdorff…
We introduce an elementary way of constructing principal (Z_2)^m-bundles over compact smooth manifolds. In addition, we will define a general notion of locally standard (Z_2)^m-actions on closed manifolds for all m>0, and then give a…
We prove the convex combination theorem for hyperbolic n-manifolds. Applications are given both in high dimensions and in 3 dimensions. One consequence is that given two geometrically finite subgroups of a discrete group of isometries of…
In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its…
A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…
A class of examples of Riemannian metrics with holonomy G_2 on compact 7-manifolds was constructed by the author in arXiv:math.DG/0012189 and later in a joint work with N.-H. Lee in arXiv:0810.0957, using a certain `generalized connected…
We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
In 1957, Hadwiger made the famous conjecture that any convex body of $n$-dimensional Euclidean space $\mathbb{E}^n$ can be covered by $2^n$ smaller positive homothetic copies. Up to now, this conjecture is still open for all $n\geq 3$.…
We construct a combinatorial moduli space closely related to the KSV-compactification of the moduli space of bordered marked Riemann surfaces. The open part arises from symmetric metric ribbon graphs. The compactification is obtained by…
A new topological operad is introduced, called the splicing operad. This operad acts on a broad class of spaces of self-embeddings N --> N where N is a manifold. The action of this operad on EC(j,M) (self embeddings R^j x M --> R^j x M with…
We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…
We introduce a simple combinatorial way, which we call a rectangular diagram of a surface, to represent a surface in the three-sphere. It has a particularly nice relation to the standard contact structure on $\mathbb S^3$ and to rectangular…
The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…
A binary three-dimensional (3D) image $I$ is well-composed if the boundary surface of its continuous analog is a 2D manifold. Since 3D images are not often well-composed, there are several voxel-based methods ("repairing" algorithms) for…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
Bisztriczky defines a multiplex as a generalization of a simplex, and an ordinary polytope as a generalization of a cyclic polytope. This paper presents results concerning the combinatorics of multiplexes and ordinary polytopes. The flag…