相关论文: Computation in word-hyperbolic groups
A hyperbolic reflection group is a discrete group generated by reflections in the faces of an $n$-dimensional hyperbolic polyhedron. This survey article is dedicated to the study of arithmetic hyperbolic reflection groups with an emphasis…
Let $V$ be a finite graph and let $\phi:V\rightarrow V$ be an irreducible train track map whose mapping torus has word-hyperbolic fundamental group $G$. Then $G$ acts freely and cocompactly on a CAT(0) cube complex.
Given a hyperbolic group $G$ and a maximal infinite cyclic subgroup $\langle g \rangle$, we define a {\it drilling of $G$ along $g$}, which is a relatively hyperbolic group pair $(\widehat{G}, P)$. This is inspired by the well-studied…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…
Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…
We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…
We present an algorithm that computes Bowditch's canonical JSJ decomposition of a given one-ended hyperbolic group over its virtually cyclic subgroups. The algorithm works by identifying topological features in the boundary of the group. As…
We define hyperbolic groupoids, generalizing the notion of a Gromov hyperbolic group. Examples of hyperbolic groupoids include actions of Gromov hyperbolic groups on their boundaries, pseudogroups generated by expanding self-coverings,…
Gromov asked whether every one-ended word-hyperbolic group contains a hyperbolic surface group. We prove that every one-ended double of a free group has a hyperbolic surface subgroup if (1) the free group has rank two, or (2) every…
We investigate the relationship between the metric boundary and the Gromov boundary of a hyperbolic metric space. We show that the Gromov boundary is a quotient topological space of the metric boundary, and that therefore a word-hyperbolic…
We prove that the topological complexity of a finite index subgroup of a hyperbolic group is linear in its index. This follows from a more general result relating the size of the quotient of a free cocompact action of hyperbolic group on a…
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
We introduce and study the notions of hyperbolically embedded and very rotating families of subgroups. The former notion can be thought of as a generalization of the peripheral structure of a relatively hyperbolic group, while the later one…
We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…
We propose a new generalisation of Cayley automatic groups, varying the time complexity of computing multiplication, and language complexity of the normal form representatives. We first consider groups which have normal form language in the…
We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…
Power circuits are data structures which support efficient algorithms for highly compressed integers. Using this new data structure it has been shown recently by Myasnikov, Ushakov and Won that the Word Problem of the one-relator Baumslag…
A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…