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

2457 · Oct 202319922001200920172026
48 results for Coxeter polyhedron

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 ↗

The topic of the paper are developments of nn-dimensional Coxeter polyhedra. We show that the surface of such polyhedron admits a canonical cutting such that each piece can be covered by a Coxeter (n1)(n-1)-dimensional domain.

2009-07-20abs ↗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 ↗

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 ↗

We determine the lowest volume hyperbolic Coxeter polyhedron whose corresponding hyperbolic polyhedral 3-orbifold contains an essential 2-suborbifold, up to a canonical decomposition along essential hyperbolic triangle 2-suborbifolds.

2011-08-23abs ↗pdf ↗

The paper improves Vinberg's algorithm for arithmetic hyperbolic lattices.

problem Finding maximal reflection sublattices in arithmetic hyperbolic lattices.
method Provided an effective termination condition for Vinberg's semi-algorithm.
result The algorithm becomes an effective method for finding maximal reflection sublattices.

We define the injectivity radius of a Coxeter polyhedron in H^3 to be half the shortest translation length among hyperbolic/loxodromic elements in the orientation-preserving reflection group. We show that, for finite-volume polyhedra, this number is always less than 2.6339..., and for compact polyhedra it is always les…

1998-12-11abs ↗pdf ↗

Study on hyperbolic polyhedra and their volume, proving finiteness of arithmetic groups.

problem Finiteness of arithmetic maximal reflection groups in hyperbolic polyhedra.
method Observation of volume distribution and recent work with M. Fraczyk and S. Hurtado.
result Proof of finiteness of arithmetic maximal reflection groups.

A group is properly 3-realizable if it is the fundamental group of a compact polyhedron whose universal covering is proper homotopically equivalent to some 3-manifold. We prove that when such a group is also quasi-simply filtered then it has {\em pro-(finitely generated free) fundamental group at infinity} and {\em sem…

2007-09-11abs ↗pdf ↗

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 ↗

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 ↗

Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erdös-Rényi model). In this paper, we extend this model to study random general Coxeter groups and give some results about random Coxeter groups, including some information about t…

2017-11-13abs ↗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 ↗

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 ↗

Study on connectivity of Morse boundaries of Coxeter groups.

problem Connectivity of Morse boundaries of Coxeter groups.
method Defined conditions on defining graphs (wide-avoidant, wide-spherical-avoidant) and characterized Morse boundaries based on these conditions.
result Characterization of Morse boundary connectivity for different classes of Coxeter groups.

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 ↗

Characterizes Coxeter groups with convex cocompact representations in projective space.

problem Understanding representations of Coxeter groups as convex cocompact reflection groups.
method Investigates representations of Coxeter groups into GL(n,R) as geometric reflection groups in projective space.
result Characterizes Coxeter groups that admit convex cocompact representations and describes the spaces of such representations.

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 ↗

New groups found in hyperbolic 4D and 5D space have minimal growth rate.

problem Finding minimal growth rates in hyperbolic Coxeter groups.
method Combinatorial properties of hyperbolic Coxeter polyhedra, partial classification results, monotonicity properties of growth rates.
result Coxeter groups G4G_4 and G5G_5 in H4\mathbb{H}^4 and H5\mathbb{H}^5 have the smallest growth rate.

We prove that two angle-compatible Coxeter generating sets of a given finitely generated Coxeter group are conjugate provided one of them does not admit any elementary twist. This confirms a basic case of a general conjecture which describes a potential solution to the isomorphism problem for Coxeter groups.

2009-11-02abs ↗pdf ↗

We provide geometric conditions on a pair of hyperplanes of a CAT(0) cube complex that imply divergence bounds for the cube complex. As an application, we classify all right-angled Coxeter groups with quadratic divergence and show right-angled Coxeter groups cannot exhibit a divergence function between quadratic and cu…

2016-11-14abs ↗pdf ↗

Flat coordinates found for algebraic Frobenius manifolds in low dimensions.

problem Understanding algebraic Frobenius manifolds in small dimensions.
method Using reflection representations of finite Coxeter groups, finding flat coordinates of the Frobenius metric.
result Explicit relations between flat coordinates of the Frobenius metric and intersection form for most known examples up to dimension 4.

The main theorem of this paper classifies the quasi-geodesics in a Coxeter group that are tracked by geodesics. As corollaries, we show that if a Coxeter group acts geometrically on a CAT(0) space X then CAT(0) rays (and lines) are tracked by Cayley graph geodesics, all special subgroups of the Coxeter group are quasi-…

2011-12-15abs ↗pdf ↗

We define a generalization of Coxeter graphs and an associated Coxeter system and Coxeter mapping class. These can be used to construct periodic Coxeter mapping classes on surfaces with arbitrarily large genus, preserving lots of symmetries. The periodic mapping classes can in turn be used to construct sequences of pse…

2011-10-05abs ↗pdf ↗

The paper calculates the Saito determinant for Coxeter discriminant strata.

problem Calculating the Saito determinant for specific geometric strata.
method Using the Saito flat metric and Lie derivatives, the paper finds the determinant of the metric restricted to Coxeter discriminant strata.
result The determinant of the Saito metric on Coxeter discriminant strata is proportional to a product of linear factors in flat coordinates.

New noncompact Coxeter polytopes found in various dimensions.

problem Classifying and constructing noncompact hyperbolic Coxeter polytopes.
method Maximal-cusp density and noncompact analog of Bogachev-Douba-Raimbault's argument.
result Infinitely many pairwise incommensurable noncompact Coxeter polytopes in dimensions 4-9.

We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of right-angled Coxeter groups. We use this characterization to describe a process for c…

2014-10-16abs ↗pdf ↗

The paper explores growth rates and Perron numbers in Coxeter systems with low-dimensional Davis complexes.

problem Investigating growth rates and specific types of numbers in Coxeter systems with Davis complexes of low dimension.
method Examining Coxeter systems with Davis complexes of dimension at most 2, focusing on growth rates and specific types of numbers.
result The growth rate of Coxeter systems with Davis complexes of dimension at most 2 are either Salem or Pisot numbers, depending on the Euler characteristic.

Study on divergence and thickness for Coxeter groups, generalizing previous work.

problem Characterizing and bounding divergence and thickness for Coxeter groups.
method Characterization of linear divergence, introduction of hypergraph index, new construction of Coxeter systems.
result Upper bounds on divergence and thickness for Coxeter groups, conjectured to be equalities.

The paper studies deformation spaces of Coxeter truncation polytopes.

problem Understanding the geometric properties and deformations of Coxeter truncation polytopes.
method Analyzing Coxeter truncation polytopes and their deformation spaces.
result Description of deformation spaces for Coxeter truncation polytopes of dimension d4d \geqslant 4.