Related papers: Combinatorially two-orbit convex polytopes

For $3$-dimensional convex polytopes, inscribability is a classical property that is relatively well-understood due to its relation with Delaunay subdivisions of the plane and hyperbolic geometry. In particular, inscribability can be tested…

The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…

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…

Consider a compact Lie group and a closed subgroup. Generalizing a result of Klyachko, we give a necessary and sufficient criterion for a coadjoint orbit of the subgroup to be contained in the projection of a given coadjoint orbit of the…

Symmetric edge polytopes are a class of lattice polytopes constructed from finite simple graphs. In the present paper we highlight their connections to the Kuramoto synchronization model in physics -- where they are called adjacency…

The symplectomorphism group of a 2-dimensional surface is homotopy equivalent to the orbit of a filling system of curves. We give a generalization of this statement to dimension 4. The filling system of curves is replaced by a decomposition…

Orbits of coadjoint representations of classical compact Lie groups have a lot of applications. They appear in representation theory, geometrical quantization, theory of magnetism, quantum optics etc. As geometric objects the orbits were…

Icosahedron and dodecahedron can be dissected into tetrahedral tiles projected from 3D-facets of the Delone polytopes representing the deep and shallow holes of the root lattice D_6. The six fundamental tiles of tetrahedra of edge lengths 1…

This paper proves the following statement: If a convex body can form a fivefold translative tiling in $\mathbb{E}^3$, it must be a parallelotope, a hexagonal prism, a rhombic dodecahedron, an elongated dodecahedron, a truncated octahedron,…

In the focus of this paper is the operation of edge contraction. One can show that simplicial 3-polytope is flag iff contraction of any its edge gives simplicial 3-polytope. Our main result states that any flag simplicial 3-polytope can be…

This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.

We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic lattice ${\bf Z}_n$. We also consider some relatives of those 28 partitions,…

We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…

In this paper we will consider the 2-fold symmetric complex hyperbolic triangle groups generated by three complex reflections through angle 2pi/p with p no smaller than 2. We will mainly concentrate on the groups where some elements are…

Monotone polytopes, also known as smooth reflexive polytopes, are the polytopes associated to monotone symplectic toric manifolds and Gorenstein Fano toric varieties. We first show that the only monotone polytopes admitting blow-ups at…

An \emph{interval vector} is a $(0,1)$-vector in $\mathbb{R}^n$ for which all the 1's appear consecutively, and an \emph{interval-vector polytope} is the convex hull of a set of interval vectors in $\mathbb{R}^n$. We study three particular…

A combinatorial map is a connected topological graph cellularly embedded in a surface. This monograph concentrates on the automorphism group of a map, which is related to the automorphism group of a Klein surface and a Smarandache manifold,…

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

The paper surveys highlights of the ongoing program to classify discrete polyhedral structures in Euclidean 3-space by distinguished transitivity properties of their symmetry groups, focussing in particular on various aspects of the…