English
Related papers

Related papers: The domino problem for hyperbolic groups

200 papers

Let G be a word-hyperbolic group, obtained as a graph of free groups amalgamated along cyclic subgroups. If H_2(G;Q) is nonzero, then G contains a closed hyperbolic surface subgroup. Moreover, the unit ball of the Gromov-Thurston norm on…

Group Theory · Mathematics 2008-07-22 Danny Calegari

The following short note provides an alternative proof of a result of Coornaert: namely, that given a non-elementary word-hyperbolic group $G$ with a finite generating set $X$, there exist constants $\lambda,D > 1$ such that \[…

Group Theory · Mathematics 2019-02-15 Motiejus Valiunas

We prove that the fundamental group of a finite graph of convergence groups with parabolic edge groups is a convergence group. Using this result, under some mild assumptions, we prove a combination theorem for a graph of convergence groups…

Group Theory · Mathematics 2022-02-08 Ravi Tomar

We prove that, if a group is relatively hyperbolic, the parabolic subgroups are virtually nilpotent if and only if there exists a hyperbolic space with bounded geometry on which it acts geometrically finitely. This provides, by use of M.…

Group Theory · Mathematics 2007-05-23 F. Dahmani , A. Yaman

Thurston's hyperbolization theorem for Haken manifolds and normal surface theory yield an algorithm to determine whether or not a compact orientable 3-manifold with nonempty boundary consisting of tori admits a complete finite-volume…

Geometric Topology · Mathematics 2019-02-01 Robert C. Haraway

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

A cubelike graph is a Cayley graph on the product $\mathbb{Z}_2\times\cdots\times\mathbb{Z}_2$ of the integers modulo $2$ with itself finitely many times. In 1992, Payan proved that no cubelike graph can have chromatic number $3$. The…

Combinatorics · Mathematics 2023-11-14 Jonathan Cervantes , Mike Krebs

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers where this homomorphism is prescribed by the action of a semiregular subgroup of $\textrm{Aut}(G)$. We study…

Discrete Mathematics · Computer Science 2017-01-31 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela

We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…

Geometric Topology · Mathematics 2020-07-08 Mahan Mj

We prove three results about the graph product $G=\G(\Gamma;G_v, v \in V(\Gamma))$ of groups $G_v$ over a graph $\Gamma$. The first result generalises a result of Servatius, Droms and Servatius, proved by them for right-angled Artin groups;…

Group Theory · Mathematics 2011-10-26 Derek F. Holt , Sarah Rees

Let $\mathbf{k} := (k_1,\dots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\mathbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

Combinatorics · Mathematics 2017-10-11 Oleg Pikhurko , Katherine Staden , Zelealem B. Yilma

We provide multicolored and infinite generalizations for a Ramsey-type problem raised by Bollob\'as, concerning colorings of $K_n$ where each color is well-represented. Let $\chi$ be a coloring of the edges of a complete graph on $n$…

Combinatorics · Mathematics 2020-10-21 Matthew Bowen , Ander Lamaison , Alp Müyesser

We study a generalisation of Vizing's theorem, where the goal is to simultaneously colour the edges of graphs $G_1,\dots,G_k$ with few colours. We obtain asymptotically optimal bounds for the required number of colours in terms of the…

Combinatorics · Mathematics 2024-11-07 Simona Boyadzhiyska , Richard Lang , Allan Lo , Michael Molloy

Suppose that a group $G$ acts non-elementarily on a hyperbolic space $S$ and does not fix any point of $\partial S$. A subgroup $H\le G$ is said to be geometrically dense in $G$ if the limit sets of $H$ and $G$ coincide and $H$ does not fix…

Group Theory · Mathematics 2022-11-21 D. Osin

The notions of stable and Morse subgroups of finitely generated groups generalize the concept of a quasiconvex subgroup of a word-hyperbolic group. For a word-hyperbolic group $G$, Kapovich provided a partial algorithm which, on input a…

Group Theory · Mathematics 2020-04-21 Heejoung Kim

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

Combinatorics · Mathematics 2013-03-25 Michal Adamaszek

Recently it was shown that many classic graph problems -- Independent Set, Dominating Set, Hamiltonian Cycle, and more -- can be solved in subexponential time on unit-ball graphs. More precisely, these problems can be solved in…

Computational Geometry · Computer Science 2026-01-14 Mark de Berg , Sándor Kisfaludi-Bak

We build quasi--isometry invariants of relatively hyperbolic groups which detect the hyperbolic parts of the group; these are variations of the stable dimension constructions previously introduced by the authors. We prove that, given any…

Group Theory · Mathematics 2016-09-19 Matthew Cordes , David Hume

The set of equivalence classes of cobounded actions of a group G on different hyperbolic metric spaces carries a natural partial order. Following Abbott--Balasubramanya--Osin, the group G is H--accessible if the resulting poset has a…

Geometric Topology · Mathematics 2023-05-15 Carolyn Abbott , Hoang Thanh Nguyen , Alexander J. Rasmussen

We prove asymptotically optimal bounds on the number of edges a graph $G$ must have in order that any $r$-colouring of $E(G)$ has a colour class which contains every $D$-degenerate graph on $n$ vertices with bounded maximum degree. We also…

Combinatorics · Mathematics 2022-11-30 Peter Allen , Julia Böttcher
‹ Prev 1 4 5 6 7 8 10 Next ›