Related papers: Fulton-MacPherson compactification, cyclohedra, an…

By means of constructing a new edge-bending algorithm, we prove that every locally polyhedral tiling of $\mathbb{R}^3$ can be completely softened. A weaker form of this statement, for polyhedral space tilings, was conjectured by Domokos,…

A family of closed manifolds is called cohomologically rigid if a cohomology ring isomorphism implies a diffeomorphism for any two manifolds in the family. We establish cohomological rigidity for large families of 3-dimensional and…

We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…

We study a new class of compact orientable manifolds, called big polygon spaces. They are intersections of real quadrics and related to polygon spaces, which appear as their fixed point set under a canonical torus action. What makes big…

For every smooth Jordan curve $\gamma$ and rectangle $R$ in the Euclidean plane, we show that there exists a rectangle similar to $R$ whose vertices lie on $\gamma$. The proof relies on Shevchishin's theorem that the Klein bottle does not…

The deformation problem for pseudoholomorphic curves and related geometrical properties of the total moduli space of pseudoholomorphic curves are studied. A sufficient condition for the saddle point property of the total moduli space is…

We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…

We consider the subspace of the homology of a covering space spanned by lifts of simple closed curves. Our main result is the existence of unbranched covers of surfaces where this is a proper subspace. More generally, for a fixed finite…

We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…

The (combinatorial) diameter of a polytope $P \subseteq \mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of…

We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…

Floyd showed that if a sequence of compact hyperbolic Coxeter polygons converges, then so does the sequence of the growth rates of the Coxeter groups associated with the polygons. For the case of the hyperbolic 3-space, Kolpakov discovered…

We prove that every Hassett compactification of the moduli space of weighted stable rational curves that admits both a reduction map from the Losev-Manin compactification and a reduction map to projective space is a toric variety, whose…

We investigate nicely embedded H--holomorphic maps into stable Hamiltonian three--manifolds. In particular we prove that such maps locally foliate and satisfy a no--first--intersection property. Using the compactness results of…

For any odd $n$, we describe a smooth minimal (i.e. obtained by adding an irreducible hypersurface) compactification $\tilde S_n$ of the quasi-projective homogeneous variety $S_{n}=PGL(n+1)/SL(2)$ that parameterizes the rational normal…

We consider the configuration space of ordered points on the two-dimensional sphere that satisfy a specific system of quadratic equations. We construct periodic orbits in this configuration space using elliptic theta functions and show that…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…

A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…

We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…