English
Related papers

Related papers: Classification of tight regular polyhedra

200 papers

We prove that, given a polyhedron $\mathcal P$ in $\mathbb{R}^3$, every point in $\mathbb R^3$ that does not see any vertex of $\mathcal P$ must see eight or more edges of $\mathcal P$, and this bound is tight. More generally, this remains…

Computational Geometry · Computer Science 2023-08-29 Csaba D. Tóth , Jorge Urrutia , Giovanni Viglietta

It is known that we can always 3-triangulate (i.e. divide into tetrahedra) convex polyhedra but not always non-convex ones. Polyhedra topologically equivalent to sphere with $p$ handles, shortly $p$-toroids, could not be convex. So, it is…

Metric Geometry · Mathematics 2019-02-08 Milica Stojanović

We classify the dihedral edge-to-edge tilings of the sphere by regular polygons and quadrilaterals with equal opposite edges (edge configuration xyxy).

Combinatorics · Mathematics 2024-03-12 Hoi Ping Luk

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Combinatorics · Mathematics 2024-01-09 Martin Winter

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

Metric Geometry · Mathematics 2020-06-08 Victor Alexandrov

A polyhedral map is called $\{p, q\}$-equivelar if each face has $p$ edges and each vertex belongs to $q$ faces. In 1983, it was shown that there exist infinitely many geometrically realizable $\{p, q\}$-equivelar polyhedral maps if $q > p…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

A maniplex of rank n s an n-valent properly edge-coloured graph that generalises, simultaneously, maps on surfaces and abstract polytopes. The problem of stability in maniplexes is a natural variant of the problem of stability in graphs. A…

Combinatorics · Mathematics 2026-02-04 Isabel Hubard , Micael Toledo

The tilings of the 2-dimensional sphere by congruent triangles have been extensively studied, and the edge-to-edge tilings have been completely classified. However, not much is known about the tilings by other congruent polygons. In this…

Combinatorics · Mathematics 2013-01-07 Honghao Gao , Nan Shi , Min Yan

An earlier paper describes a program to prove the Kepler conjecture on sphere packings. This paper carries out the second step of that program. A sphere packing leads to a decomposition of $R^3$ into polyhedra. The polyhedra are divided…

Metric Geometry · Mathematics 2007-05-23 Thomas C. Hales

In this paper we prove criteria for a nonnormal toric variety to be flexible, to be rigid and to be almost rigid. For rigid and almost rigid toric varieties we describe the automorphism group explicitly.

Algebraic Geometry · Mathematics 2020-12-08 Ilya Boldyrev , Sergey Gaifullin

We consider genera of polyhedra (finite cell complexes) in the stable homotopy category. Namely, the genus of a polyhedron X is the class of polyhedra Y such that all localizations of Y are stably isomorphic to the corresponding…

Algebraic Topology · Mathematics 2015-01-27 Yuriy Drozd , Petro Kolesnik

In the projective space $\mathrm{PG}(3,q)$, we consider the orbits of lines under the stabilizer group of the twisted cubic. It is well known that the lines can be partitioned into classes every of which is a union of line orbits. All types…

Combinatorics · Mathematics 2021-03-29 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Consider an orthogonal polyhedron, i.e., a polyhedron where (at least after a suitable rotation) all faces are perpendicular to a coordinate axis, and hence all edges are parallel to a coordinate axis. Clearly, any facial angle and any…

Computational Geometry · Computer Science 2013-12-25 Therese Biedl , Martin Derka , Stephen Kiazyk , Anna Lubiw , Hamide Vosoughpour

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…

Geometric Topology · Mathematics 2023-07-28 Yunhi Cho , Seonhwa Kim

We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.

Algebraic Topology · Mathematics 2024-07-10 Petar Pavešić

In this paper, we give a classification of regular maps with Euler characteristic $-pq$ for distinct primes $q>p\geq 5$. This together with previous classification of regular maps with Euler characteristic $-2p,-3p$ and $-p^2$ completes the…

Group Theory · Mathematics 2026-01-22 Xiaogang Li , Yao Tian

Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the…

Metric Geometry · Mathematics 2012-05-10 Hans-Peter Schröcker

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…

Combinatorics · Mathematics 2013-10-21 Daniel Pellicer , Egon Schulte

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland

We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…

Number Theory · Mathematics 2007-05-23 Enric Nart