New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
A spherical polyhedron surface is a triangulated surface obtained by isometric gluing of spherical triangles. For instance, the boundary of a generic convex polytope in the 3-sphere is a spherical polyhedron surface. This paper investigates these surfaces from the point of view of inner angles. A rigidity result is obt…
We investigate the classical Alexandroff-Borsuk problem in the category of non-triangulable manifolds: Given an -dimensional compact non-triangulable manifold and , does there exist an -map of onto an -dimensional finite polyhedron which induces a homotopy equivalence?
Let be a polyhedron. It was conjectured that if is weakly convex (i. e. its vertices lie on the boundary of a strictly convex domain) and decomposable (i. e. can be triangulated without adding new vertices), then it is infinitesimally rigid. We prove this conjecture under a weak additional assu…
We construct a new infinite family of ideal triangulations and H-triangulations for the complements of twist knots, using a method originating from Thurston. These triangulations provide a new upper bound for the Matveev complexity of twist knot complements. We then prove that these ideal triangulations are geometric. …
Principal circle bundle over a PL polyhedron can be triangulated and thus obtains combinatorics. The triangulation is assembled from triangulated circle bundles over simplices. To every triangulated circle bundle over a simplex we associate a necklace (in combinatorial sense). We express rational local formulas for all…
Discrete Laplacians defined for spherical and hyperbolic surfaces.
New proof shows efficient ReLU networks for piecewise linear functions.
The space of shapes of a polyhedron with given total angles less than 2πat each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take place a finite distance from a nonsingular point. The metric completion is a comple…
Let be a triangulable set and let be either a positive integer or . We say that is a -approximation target space, or a for short, if it has the following universal approximation property: For each and each loc…
Study on polyhedra rigidity, finding non-existence of flexible weakly convex decomposable polyhedra.
We establish a connection between two previously unrelated topics: a particular discrete version of conformal geometry for triangulated surfaces, and the geometry of ideal polyhedra in hyperbolic three-space. Two triangulated surfaces are considered discretely conformally equivalent if the edge lengths are related by s…
Let be a Lie group and a smooth proper -manifold. Let denote the natural map to the orbit space. Then there exist a PL manifold , a polyhedron and homeomorphisms and such that $σ\circpi\circτ$ is PL. If and the -action are of analytic class, we can choose su…
In this note, we introduce a class of cell decompositions of PL manifolds and polyhedra which are more general than triangulations yet not as general as CW complexes; we propose calling them PLCW complexes. The main result is an analog of Alexander's theorem: any two PLCW decompositions of the same polyhedron can be ob…
Study rigidity and volume optimization of hyperbolic polyhedra.
We present a constructive proof of Alexandrov's theorem regarding the existence of a convex polytope with a given metric on the boundary. The polytope is obtained as a result of a certain deformation in the class of generalized convex polytopes with the given boundary. We study the space of generalized convex polytopes…
We describe two constructions giving rise to curved -algebras. The first consists of deforming -algebras, while the second involves transferring curved dg structures that are deformations of (ordinary) dg structures along chain contractions. As an application of the second construction, given a …
The paper extends Hopf's theorem to convex surfaces and discrete triangulations.
A projective mirror polyhedron is a projective polyhedron endowed with reflections across its faces. We construct an explicit diffeomorphism between the moduli space of a mirror projective polyhedron with fixed dihedral angles in , and the union of copies of , when the polyhedron has the combin…
Study shows rigidity of polyhedrons in hyperbolic spaces.
We give a method for constructing a shadowed polyhedron from a divide. The 4-manifold reconstructed from a shadowed polyhedron admits the structure of a Lefschetz fibration if it satisfies a certain property, which we call the LF-property. We will show that the shadowed polyhedron constructed from a divide satisfies th…
CAD detects anomalies and selects prototypes using polyhedron curvature.
An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to π/n for some fixed integer n at least 2. It is a consequence of Andreev's theorem that either n=3 and the polyhedron has all ideal vertices or that n=2. Volume estimates are given for all equiangular hyperboli…
We study the supremum of the volume of hyperbolic polyhedra with some fixed combinatorics and with vertices of any kind (real, ideal or hyperideal). We find that the supremum is always equal to the volume of the rectification of the 1-skeleton. The theorem is proved by applying a sort of volume-increasing flow to any h…
The signed volume function for polyhedra can be generalized to a mean volume function for volume elements by averaging over the triangulations of the underlying polyhedron. If we consider these up to translation and scaling, the resulting quotient space is diffeomorphic to a sphere. The mean volume function restricted …
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex polyhedron, is infinitesimally rigid. We prove that it is indeed the case for two classes of polyhedra: those obtained from a convex polyhedron b…
Poincaré's Polyhedron Theorem is a widely known valuable tool in constructing manifolds endowed with a prescribed geometric structure. It is one of the few criteria providing discreteness of groups of isometries. This work contains a version of Poincaré's Polyhedron Theorem that is applicable to constructing fibre bund…
It is proven that the volume of an infinitesimally flexible polyhedron in is a multiple root of its volume polynomial.
We explore relationship between the cut locus of an arbitrary simply connected and compact Riemannian symmetric space and the Cartan polyhedron of corresponding restricted root system, and compute injectivity radius and diameter for every type of irreducible ones.
We explore the perspective of a bug living on the two-dimensional surface of a polyhedron. Images of various kinds of effects like lensing and cloaking are shown via color pictures of three viewpoints: the first person perspective of the bug, a map of the bug's viewpoint, and a look at the bug on the embedded polyhedro…
We show that a compact n-polyhedron PL embeds in a product of n trees if and only if it collapses onto an (n-1)-polyhedron. If the n-polyhedron is contractible and n\ne 3 (or n=3 and the Andrews-Curtis Conjecture holds), the product of trees may be assumed to collapse onto the image of the embedding. In contrast, there…
Polyhedra can be Rupert if they can be slightly rotated to fit inside each other.
New homology theories for orbifolds and weighted polyhedra.
A Fuchsian polyhedron in hyperbolic space is a polyhedral surface invariant under the action of a Fuchsian group of isometries (i.e. a group of isometries leaving globally invariant a totally geodesic surface, on which it acts cocompactly). The induced metric on a convex Fuchsian polyhedron is isometric to a hyperbolic…
Upper bounds for volumes of hyperbolic polyhedra and links are derived.
The Midscribability Theorem, which was first proved by O. Schramm, states that: given a strictly convex body with smooth boundary and a convex polyhedron , there exists a polyhedron combinatorially equivalent to which midscribes . Here the word "midscribe" me…
Our purpose is to classify acyclic 4-manifolds having shadow complexity zero. In this paper, we focus on simple polyhedra and discuss this problem combinatorially. We consider a shadowed polyhedron and a simple polyhedron that is obtained by collapsing from . Then we prove that there exists a canonical way…
For a finite volume geodesic polyhedron P in hyperbolic 3-space, with the property that all interior angles between incident faces are integral submultiples of Pi, there is a naturally associated Coxeter group generated by reflections in the faces. Furthermore, this Coxeter group is a lattice inside the isometry group …
Researchers decompose hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.
Our goal is to better understand the relationship between the polyhedron and the group associated with a fundamental domain in H^3. In this paper, we will study torsion-free groups and determine a formula for how many edge classes a given abstract polyhedron must have. We will use that result to classify all fundamenta…
A celebrated theorem of Hadwiger states that the Euler-Poincaré characteristic is the the unique invariant and continuous valuation on the distributive lattice of compact polyhedra in R^n that assigns value one to each convex non-empty such polyhedron. This paper provides an analogue of Hadwiger's result for finitely p…
We state that any constant curvature Riemannian metric with conical singularities of constant sign curvature on a compact (orientable) surface can be realized as a convex polyhedron in a Riemannian or Lorentzian) space-form. Moreover such a polyhedron is unique, up to global isometries, among convex polyhedra invar…
We prove a version of Poincaré's polyhedron theorem whose requirements are as local as possible. New techniques such as the use of discrete groupoids of isometries are introduced. The theorem may have a wide range of applications and can be generalized to the case of higher dimension and other geometric structures. It …
We build polyhedral complexes in Rn that coincide with dyadic grids with different orientations, while keeping uniform lower bounds (depending only on n) on the flatness of the added polyhedrons including their subfaces in all dimensions. After the definitions and first properties of compact Euclidean polyhedrons and c…
We construct geometric barriers for minimal graphs in H^n xR. We prove the existence and uniqueness of a solution of the vertical minimal equation in the interior of a convex polyhedron in H^n extending continuously to the interior of each face, taking infinite boundary data on one face and zero boundary value data on …
We present an improved algorithm for {\em quasi-properly} learning convex polyhedra in the realizable PAC setting from data with a margin. Our learning algorithm constructs a consistent polyhedron as an intersection of about halfspaces with constant-size margins in time polynomial in (where is the nu…
The study of comparison theorems in geometry has a rich history. In this paper, we establish a comparison theorem for polyhedra in 3-manifolds with nonnegative scalar curvature, answering affirmatively a dihedral rigidity conjecture by Gromov. For a large collections of polyhedra with interior non-negative scalar curva…
The aim of this paper is to extend the notion of pseudo harmonic morphism (introduced by Loubeau \cite {Lo}) to the case when the source manifold is an admissible Riemannian polyhedron. We define these maps to be harmonic in the sense of Eells-Fuglede \cite {EF} and pseudo-horizontally weakly conformal in our sense (se…