English
Related papers

Related papers: Essential hyperbolic Coxeter polytopes

200 papers

We exhibit two examples of convex cocompact subgroups of the isometry groups of real hyperbolic spaces with limit set a Pontryagin sphere: one generated by $50$ reflections of $\mathbb{H}^4$, and the other by a rotation of order $21$ and a…

Geometric Topology · Mathematics 2026-04-03 Sami Douba , Gye-Seon Lee , Ludovic Marquis , Lorenzo Ruffoni

It is a famous open question whether every integrally closed reflexive polytope has a unimodal Ehrhart delta-vector. We generalize this question to arbitrary integrally closed lattice polytopes and we prove unimodality for the delta-vector…

Combinatorics · Mathematics 2011-10-18 Jan Schepers , Leen Van Langenhoven

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…

Geometric Topology · Mathematics 2020-02-10 Giulio Belletti

Hierarchically hyperbolic spaces (HHSs) are a large class of spaces that provide a unified framework for studying the mapping class group, right-angled Artin and Coxeter groups, and many 3--manifold groups. We investigate strongly…

Group Theory · Mathematics 2021-06-18 Jacob Russell , Davide Spriano , Hung Cong Tran

This is a survey on algorithmic questions about combinatorial and geometric properties of convex polytopes. We give a list of 35 problems; for each the current state of knowledege on its theoretical complexity status is reported. The…

Combinatorics · Mathematics 2007-05-23 Volker Kaibel , Marc E. Pfetsch

In any Coxeter group, the set of elements whose principal order ideals are boolean forms a simplicial poset under the Bruhat order. This simplicial poset defines a cell complex, called the boolean complex. In this paper it is shown that,…

Combinatorics · Mathematics 2009-05-06 Kari Ragnarsson , Bridget Eileen Tenner

We prove that any diffeomorphism of a compact manifold can be approximated in topology C1 by another diffeomorphism exhibiting a homoclinic bifurcation (a homoclinic tangency or a heterodimensional cycle) or by one which is essentially…

Dynamical Systems · Mathematics 2010-11-18 Sylvain Crovisier , Enrique R. Pujals

Quivers constructed from hyperbolic Coxeter simplices give examples of minimal mutation-infinite quivers, however they are not the only such quivers. We classify minimal mutation-infinite quivers through a number of moves and link the…

Combinatorics · Mathematics 2016-12-12 John Lawson

We give upper and lower bounds on the conformal dimension of the Bowditch boundary of a Coxeter group with defining graph a complete graph and edge labels at least three. The lower bounds are obtained by quasi-isometrically embedding…

Geometric Topology · Mathematics 2025-04-18 Elizabeth Field , Radhika Gupta , Robert Alonzo Lyman , Emily Stark

This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…

Algebraic Topology · Mathematics 2011-02-22 Inna Zakharevich

We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…

Combinatorics · Mathematics 2025-04-08 Ezgi Kantarcı Oğuz , Cem Yalım Özel , Mohan Ravichandran

We study homomorphisms from K\"ahler groups to Coxeter groups. As an application, we prove that a cocompact complex hyperbolic lattice (in complex dimension at least 2) does not embedd into a Coxeter group or a right-angled Artin group.…

Geometric Topology · Mathematics 2013-11-13 Pierre Py

We study the centralizer of a parabolic subalgebra in the Hecke algebra associated with an arbitrary (possibly infinite) Coxeter group. While the center and cocenter have been extensively studied in the finite and affine cases, much less is…

Representation Theory · Mathematics 2025-08-21 Haiyu Chen

The positive semidefinite (psd) rank of a polytope is the smallest $k$ for which the cone of $k \times k$ real symmetric psd matrices admits an affine slice that projects onto the polytope. In this paper we show that the psd rank of a…

Optimization and Control · Mathematics 2013-08-01 João Gouveia , Richard Z. Robinson , Rekha R. Thomas

We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…

Algebraic Topology · Mathematics 2025-12-23 Daniel Carranza , Chris Kapulkin

Let $C(L)$ be the right-angled Coxeter group defined by an abstract triangulation $L$ of $\mathbb{S}^2$. We show that $C(L)$ is isomorphic to a hyperbolic right-angled reflection group if and only if $L$ can be realized as an acute…

Geometric Topology · Mathematics 2019-02-07 Sang-hyun Kim , Genevieve S. Walsh

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

Group Theory · Mathematics 2007-05-23 Michael L. Mihalik , Steven Tschantz

By a recent result obtained by R. Howlett and the author considerable progress has been made towards a complete solution of the isomorphism problem for Coxeter groups. In this paper we give a survey on the isomorphism problem and explain in…

Group Theory · Mathematics 2007-05-23 Bernhard Mühlherr

We show that every non-degenerate regular polytope can be used to construct a thin, residually-connected, chamber-transitive incidence geometry, i.e. a regular hypertope, with a tail-triangle Coxeter diagram. We discuss several interesting…

Combinatorics · Mathematics 2020-01-31 Antonio Montero , Asia Ivić Weiss

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

Computational Complexity · Computer Science 2017-03-21 Thomas Rothvoss
‹ Prev 1 8 9 10 Next ›