相关论文: Computation in word-hyperbolic groups

In this article we describe the centres of all Dyer groups. We also give a complete classification of when a Dyer group $D(\Gamma)$ is hyperbolic or acylindricality hyperbolic, with conditions that can easily be read on the Dyer graph…

Pascal's triangle will give the number of geodesics from the identity to each point of ${\bf Z}^2$ if you write it in each of the quadrants. Given a group $G$ and generating set $\cal G$ we take the {\it Pascal's function} $p_{\cal G}: G…

Proper group actions are ubiquitous in mathematics and have many of the attractive features of actions of compact groups. In this survey, we discuss proper actions of Lie groups on smooth manifolds. If the group dimension is sufficiently…

The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…

This paper presents some algorithms in linear algebraic groups. These algorithms solve the word problem and compute the spinor norm for orthogonal groups. This gives us an algorithmic definition of the spinor norm. We compute the double…

This article studies the properties of word-hyperbolic semigroups and monoids, i.e. those having context-free multiplication tables with respect to a regular combing, as defined by Duncan & Gilman. In particular, the preservation of…

By analogy with complex numbers, a system of hyperbolic numbers can be introduced in the same way: z=x+h*y with h*h=1 and x,y real numbers. As complex numbers are linked to the Euclidean geometry, so this system of numbers is linked to the…

For right-angled Coxeter groups $W_{\Gamma}$, we obtain a condition on $\Gamma$ that is necessary and sufficient to ensure that $W_{\Gamma}$ is thick and thus not relatively hyperbolic. We show that Coxeter groups which are not thick all…

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…

High-dimensional group inference is an essential part of statistical methods for analysing complex data sets, including hierarchical testing, tests of interaction, detection of heterogeneous treatment effects and inference for local…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

We show that if H is a quasiconvex subgroup of a hyperbolic group G then the relative Cayley graph Y (also known as the Schreier coset graph) for G/H is Gromov-hyperbolic. We also observe that in this situation if G is torsion-free and…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

A word $w$ is concise in a class of groups $\mathcal{C}$ if, for every group $G$ in $\mathcal{C}$, the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in $G$. This notion can be naturally extended to…

This article computes the Galois groups of congruence covers arising in the context of certain hyperbolic triangle groups. As a consequence of this computation, the genera of the respective curves are deduced.

This paper proves under certain conditions the existence of an algorithm, which detects relatively quasiconvex subgroups $H$ of relatively hyperbolic groups $(G,\mathbb{P})$. Additionally, this algorithm outputs an induced peripheral…

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right…

The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…

A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…

A longstanding question of Gromov asks whether every one-ended word-hyperbolic group contains a subgroup isomorphic to the fundamental group of a closed hyperbolic surface. An infinite family of word-hyperbolic groups can be obtained by…