Research
On-device research index

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.

168,695 papers · 148 categories

Trend · papers per month

371013 · Nov 202019922001200920172026
48 results for polyhedron triangulation

New examples show flip distance and polyhedron triangulation numbers differ, with ratio close to 3/2.

problem Understanding the relationship between flip distance and polyhedron triangulation numbers.
method Provided examples to demonstrate the difference between flip distance and polyhedron triangulation numbers.
result Ratio of flip distance to polyhedron triangulation numbers can be arbitrarily close to 3/2.

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…

2004-08-09abs ↗pdf ↗

We investigate the classical Alexandroff-Borsuk problem in the category of non-triangulable manifolds: Given an nn-dimensional compact non-triangulable manifold MnM^n and ε>0\varepsilon > 0, does there exist an ε\varepsilon-map of MnM^n onto an nn-dimensional finite polyhedron which induces a homotopy equivalence?

2017-03-03abs ↗pdf ↗

New proof shows efficient ReLU networks for piecewise linear functions.

problem Existence of efficient ReLU neural networks for piecewise linear functions.
method Degree 1 triangulations of the relative homology class bounded by polyhedra.
result Existence of efficient ReLU neural networks for functions with compact support.

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…

1998-01-19abs ↗pdf ↗

Let YRnY\subset{\mathbb R}^n be a triangulable set and let rr be either a positive integer or r=r=\infty. We say that YY is a Cr\mathscr{C}^r-approximation target space, or a Cr-ats\mathscr{C}^r\text{-}\mathtt{ats} for short, if it has the following universal approximation property: For each mNm\in{\mathbb N} and each loc…

2018-05-28abs ↗pdf ↗

Study on polyhedra rigidity, finding non-existence of flexible weakly convex decomposable polyhedra.

problem Proving all decomposable polyhedra with vertices in convex position are infinitesimally rigid.
method Constructing explicit families of polyhedra, using the Hessian of the discrete Hilbert-Einstein functional, and searching for eigenvalues of the Hessian with Mathematica.
result Experimental evidence suggests no flexible, weakly convex and decomposable polyhedra exist.

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…

2010-05-15abs ↗pdf ↗

Let GG be a Lie group and MM a smooth proper GG-manifold. Let pi:MtoM/Gpi:Mto M/G denote the natural map to the orbit space. Then there exist a PL manifold PP, a polyhedron LL and homeomorphisms tau:PtoMtau:Pto M and σ:M/GtoLσ:M/Gto L such that $σ\circpi\circτ$ is PL. If MM and the GG-action are of analytic class, we can choose su…

2010-04-23abs ↗pdf ↗

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…

2010-09-21abs ↗pdf ↗

Study rigidity and volume optimization of hyperbolic polyhedra.

problem Rigidity and volume optimization of hyperbolic polyhedra.
method Analyzing decorated 1-3 type hyperbolic polyhedra and their metrics.
result Decorated 1-3 type hyperbolic polyhedra are rigid up to isometry and change of decorations.

We describe two constructions giving rise to curved AA_{\infty}-algebras. The first consists of deforming AA_{\infty}-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 …

2011-01-11abs ↗pdf ↗

The paper extends Hopf's theorem to convex surfaces and discrete triangulations.

problem Extending Hopf's theorem to convex surfaces and discrete triangulations.
method Investigates continuous maps and simplicial maps on convex polyhedra, proving theorems about neighbors and distances.
result The Hopf theorem and its quantitative generalization hold for convex surfaces, with quasigeodesics replacing geodesics.

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 (0,π2](0,\fracπ{2}], and the union of nn copies of Rd\R^d, when the polyhedron has the combin…

2008-06-22abs ↗pdf ↗

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…

2018-07-04abs ↗pdf ↗

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…

2008-04-16abs ↗pdf ↗

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…

2020-02-01abs ↗pdf ↗

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 …

2013-02-25abs ↗pdf ↗

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…

2006-06-27abs ↗pdf ↗

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…

2008-12-22abs ↗pdf ↗

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…

2017-06-19abs ↗pdf ↗

Upper bounds for volumes of hyperbolic polyhedra and links are derived.

problem Finding upper limits for volumes of generalized hyperbolic polyhedra and links.
method Application of Belletti's theorem and analysis of polyhedra with triangular faces and trivalent vertices.
result Improved 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 KR3K\subset\mathbb{R}^{3} with smooth boundary and a convex polyhedron PP, there exists a polyhedron QRP3Q \subset \mathbb{RP}^3 combinatorially equivalent to PP which midscribes KK. Here the word "midscribe" me…

2014-12-15abs ↗pdf ↗

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 XX and a simple polyhedron X0X_0 that is obtained by collapsing from XX. Then we prove that there exists a canonical way…

2016-05-01abs ↗pdf ↗

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 …

2009-04-01abs ↗pdf ↗

Researchers decompose hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.

problem Decomposing hyperbolic n-manifolds with totally geodesic boundaries into polyhedral cells.
method Two different approaches to demonstrate the existence of polyhedral decompositions.
result The number of polyhedral decompositions of MM is finite.

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…

2019-10-08abs ↗pdf ↗

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 …

2011-12-24abs ↗pdf ↗

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 …

2009-08-28abs ↗pdf ↗

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 tlogtt \log t halfspaces with constant-size margins in time polynomial in tt (where tt is the nu…

2018-05-24abs ↗pdf ↗

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…

2004-09-28abs ↗pdf ↗