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.

169,051 papers · 148 categories

Trend · papers per month

1345 · Mar 202319922001200920172026
48 results for hyperideal polyhedra

Study of hyperideal polyhedra in anti-de Sitter space.

problem Characterizing hyperideal polyhedra in anti-de Sitter space.
method Defined hyperideal polyhedra as intersections with convex polyhedra in projective model of anti-de Sitter space.
result Hyperideal polyhedra uniquely determined by combinatorics, dihedral angles, and induced metrics on boundary.

Let $(M, \dr M)$ be a 3-manifold with incompressible boundary that admits a convex co-compact hyperbolic metric. We consider the hyperbolic metrics on MM such that $\dr M$ looks locally like a hyperideal polyhedron, and we characterize the possible dihedral angles. We find as special cases the results of Bao and Bonah…

2002-12-27abs ↗pdf ↗

We consider ``hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyperideal circle patterns are associated to hyperideal hyperbolic polyhedra. We describe the…

2006-01-22abs ↗pdf ↗

A ``hyperideal circle pattern'' in S2S^2 is a finite family of oriented circles, similar to the ``usual'' circle patterns but such that the closed disks bounded by the circles do not cover the whole sphere. Hyperideal circle patterns are directly related to hyperideal hyperbolic polyhedra, and also to circle packings. …

2004-07-03abs ↗pdf ↗

The maximum hyperbolic polyhedron volume is found to be the rectification of its skeleton.

problem Finding the maximum volume of hyperbolic polyhedra with given combinatorics.
method Applying a volume-increasing flow to any hyperbolic polyhedron, handling degeneracies carefully.
result The supremum volume is always the volume of the rectification of the 1-skeleton.

Let PP be a (non necessarily convex) embedded polyhedron in R3\R^3, with its vertices on an ellipsoid. Suppose that the interior of PP can be decomposed into convex polytopes without adding any vertex. Then PP is infinitesimally rigid. More generally, let PP be a polyhedron bounding a domain which is the union of p…

2003-01-28abs ↗pdf ↗

Discrete conformal maps on surfaces with vertex decorations are studied.

problem Discrete conformal equivalence for decorated piecewise Euclidean surfaces.
method Intimate relationship between decorated PE-surfaces, canonical tessellations of hyperbolic surfaces, and convex hyperbolic polyhedra; concave variational principle.
result Proof of discrete uniformization theorem for decorated PE-surfaces.

Hyperideal tetrahedra are the fundamental building blocks of hyperbolic 3-manifolds with geodesic boundary. The study of their geometric properties (in particular, of their volume) has applications also in other areas of low-dimensional topology, like the computation of quantum invariants of 3-manifolds and the use of …

2018-01-16abs ↗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 formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain evaluations of <G,kc> grow exponentially as k goes to infinity and the growth rate…

2014-03-10abs ↗pdf ↗

The paper connects quantum 6j6j-symbols to tetrahedra volumes via discrete Fourier transforms.

problem Understanding the asymptotic behavior of quantum 6j6j-symbols and their relation to 3-manifold invariants.
method Proposing and proving a conjecture linking discrete Fourier transforms of quantum 6j6j-symbols to the volumes of deeply truncated tetrahedra.
result Supporting evidence for the conjecture in specific cases, with numerical calculations for larger dihedral angles.

We explore visual representations of tilings corresponding to Schläfli symbols. In three dimensions, we call these tilings "honeycombs". Schläfli symbols encode, in a very efficient way, regular tilings of spherical, euclidean and hyperbolic spaces in all dimensions. In three dimensions, there are only a finite number …

2015-11-08abs ↗pdf ↗

Löbell polyhedra have small systoles and are quasi-arithmetic.

problem Finding compact hyperbolic polyhedra with small systoles.
method Elementary and conceptual means to observe systole behavior, number theoretic invariants to refine results.
result Löbell polyhedra give examples of closed hyperbolic 3-manifolds with arbitrarily small systole and are quasi-arithmetic.

The study finds upper bounds and computes volumes of ideal right-angled polyhedra in Lobachevsky space.

problem Finding upper bounds and computing volumes of ideal right-angled polyhedra in Lobachevsky space.
method Analyzing a class of right-angled polyhedra with vertices on the absolute, obtaining upper bounds on volumes, computing volumes for polyhedra with up to 23 faces, and introducing the class of polyhedra with isolated triangles.
result Minimum volumes are realized on antiprisms and twisted antiprisms, and the first 248 values of volumes are presented.

We study convex polyhedra in RP3\mathbb{R}\mathbb{P}^3 with all their vertices on a sphere. We do not require, in particular, that the polyhedra lie in the interior of the sphere, hence the term "weakly inscribed". Such polyhedra can be interpreted as ideal polyhedra, if we regard RP3\mathbb{R}\mathbb{P}^3 as a combinati…

2017-09-29abs ↗pdf ↗

We review several results related to the characterization of polyhedra in hyperbolic 3-space. In particular we present Rivin's theorem that gives a characterization of compact convex hyperbolic polyhedra, and Hodgson's proof of the Adreev's theorem. We also review the analogous characterization of ideal polyhedra, and …

2010-06-23abs ↗pdf ↗

This article defines a pair of combinatorial operations on the combinatorial structure of compact right-angled hyperbolic polyhedra in dimension three called decomposition and edge surgery. It is shown that these operations simplify the combinatorics of such a polyhedron, while keeping it within the class of right-angl…

2008-09-11abs ↗pdf ↗

New families of hyperbolic polyhedra yield infinitely many unique reflection groups.

problem Understanding commensurability classes of compact Coxeter polyhedra in hyperbolic spaces.
method Analyzing families of compact Coxeter polyhedra constructed by Makarov.
result Proves infinitely many commensurability classes in 4- and 5-dimensional hyperbolic spaces.

The paper solves three problems related to monostable polyhedra.

problem Three problems related to monostable polyhedra posed by Conway and Goldberg.
method General theorem describing approximations of smooth convex bodies by convex polyhedra in terms of static equilibrium points.
result Existence of a convex polyhedron with only one stable and one unstable point.

In this article we establish the relation between the spines of 3-manifolds and the polyhedra with identified faces. We do this by showing that the spines of the closed, connected, orientable 3-manifolds can be presented through polyhedra with identified faces in a very natural way. We also prove the equivalence betwee…

2012-04-16abs ↗pdf ↗

Paper solves long-standing problem of infinite ideal polyhedra in hyperbolic space.

problem Characterize infinite ideal polyhedra in hyperbolic 3-space.
method Introduced combinatorial Ricci flow for infinite ideal circle patterns.
result Proved characterization of infinite ideal circle patterns under specific conditions.

An algorithm for determining the list of smallest volume right-angled hyperbolic polyhedra in dimension 3 is described. This algorithm has been implemented on computer using the program Orb to compute volumes, and the first 825 polyhedra in the list have been determined.

2015-12-06abs ↗pdf ↗

Software finds ideal polyhedra with rational dihedral angles and volume maxima.

problem Finding ideal convex polyhedra with maximal volume in hyperbolic 3-space.
method Rivin's variational characterization and combinatorial optimization algorithms.
result Maximal volume ideal polyhedra have dihedral angles that are rational multiples of π.

The paper proves rigidity and uniformization theorems for infinite circle patterns and convex polyhedra in hyperbolic 3-space.

problem Characterize infinite circle patterns and convex polyhedra in hyperbolic 3-space.
method Extends techniques from previous work to prove rigidity and uniformization theorems for infinite circle patterns and convex polyhedra.
result Establishes existence and rigidity of infinite regular circle patterns and convex trivalent polyhedra.

In [6], Kellerhals and Perren conjectured that the growth rates of the reflection groups given by hyperbolic Coxeter polyhedra are always Perron numbers. We prove that this conjecture is always true for the case of ideal Coxeter polyhedra in H3\mathbb{H}^3. We also find out the ideal Coxeter polyhedron in $\mathbb{H}^3…

2015-04-25abs ↗pdf ↗

New bounds found for vertices of hyperbolic polyhedra in dimensions 5 to 12.

problem Determining minimum number of ideal and finite vertices in hyperbolic polyhedra.
method Geometric method of orthogonal gluings combined with double counting and recurrence relations.
result Improved lower bounds for vertices in all dimensions up to 12.