SearcharxivSearch

arXiv subjects

Nikolay Erokhovets

Publications and source records attributed to Nikolay Erokhovets.

2 recordsLinked to original sources

Cohomological rigidity of manifolds defined by right-angled 3-dimensional polytopes

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 6-dimensional manifolds defined by 3-dimensional polytopes. We consider the class P of 3-dimensional combinatorial simple polytopes, different from a tetrahedron, whose facets do not form 3- and 4-belts. This class includes mathematical fullerenes, i.e. simple 3-polytopes with only 5-gonal and 6-gonal facets. By a theorem of Pogorelov, any polytope from P admits a right-angled realisation in Lobachevsky 3-space, which is unique up to isometry. Our families of smooth manifolds are associated with polytopes from the class P. The first family consists of 3-dimensional small covers of polytopes from P, or hyperbolic 3-manifolds of Loebell type. The second family consists of 6-dimensional quasitoric manifolds over polytopes from P. Our main result is that both families are cohomologically rigid, i.e. two manifolds M and M' from either of the families are diffeomorphic if and only if their cohomology rings are isomorphic. We also prove that if M and M' are diffeomorphic, then their corresponding polytopes are combinatorially equivalent. These results are intertwined with the classical subjects of geometry and topology, such as combinatorics of 3-polytopes, the Four Colour Theorem, aspherical manifolds, diffeomorphism classification of 6-manifolds and invariance of Pontryagin classes. The proofs use techniques of toric topology.

math.AT

Finite sets of operations sufficient to construct any fullerene from $C_{20}$

We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of arbitrary fullerene from the dodecahedron (a fullerene $C_{20}$). A growth operation is a combinatorial operation that substitutes the patch with more facets and the same boundary for the patch on the surface of a simple polytope to produce a new simple polytope. It is known that an infinite set of different growth operations transforming fullerenes into fullerenes is needed to construct any fullerene from the dodecahedron. We prove that if we allow a polytope to contain one exceptional facet, which is a quadrangle or a heptagon, then a finite set of growth operation is sufficient. We analyze pairs of objects: a finite set of operations, and a family of acceptable polytopes containing fullerenes such that any polytope of the family can be obtained from the dodecahedron by a sequence of operations from the corresponding set. We describe explicitly three such pairs. First two pairs contain seven operations, and the last -- eleven operations. Each of these operations corresponds to a finite set of growth operations and is a composition of edge- and two edges-truncations.

math.CO