Rational subgroups of biautomatic groups

@article{Gersten1991RationalSO,
  title={Rational subgroups of biautomatic groups},
  author={S. M. Gersten and H. B. Short},
  journal={Annals of Mathematics},
  year={1991},
  volume={134},
  pages={125-158}
}
Centralizers of finite subsets in biautomatic groups are them- selves biautomatic. Every polycyclic subgroup of a biautomatic group is abelian by finite. 
Virtually Biautomatic Groups
We introduce virtually biautomatic groups (groups with finite index biautomatic subgroups) and generalize results of Gersten and Short [3] and Mosher [5] on centralizers, normalizers, and quotients
Central quotients of biautomatic groups
Abstract. The quotient of a biautomatic group by a subgroup of the center is shown to be biautomatic. The main tool used is the Neumann-Shapiro triangulation of Sn-1, associated to a biautomatic
Quasi-flats in semihyperbolic groups
We prove that the Cayley graph of a group which is semihyperbolic but not hyperbolic contains a subset quasi-isometric to R2.
Finitely Presented Subgroups of Automatic Groups and their Isoperimetric Functions
We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of
POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN
Abstract Let G be a polycyclic, metabelian or soluble of type (FP)∞ group such that the class Rat(G) of all rational subsets of G is a Boolean algebra. Then, G is virtually abelian. Every soluble
Automatic groups, subgroups and cosets
The history, definition and principal properties of automatic groups and their generalisations to subgroups and cosets are reviewed briefly, mainly from a computational perspective. A result about
Regular Path Systems and (Bi)automatic Groups
We develop a new method of proving that groups acting on various classes of spaces, with nontrivial stabilizers admitted, are automatic or biautomatic. We apply this method to buildings, CAT(0)
SOME PROPERTIES OF SUBSETS OF HYPERBOLIC GROUPS
ABSTRACT We present some results about quasiconvex subgroups of infinite index and their products. After that we extend the standard notion of a subgroup commensurator to an arbitrary subset of a
Abelian Subgroups of Garside Groups
In this article, we show that for every abelian subgroup H of a Garside group, some conjugate g −1 Hg consists of ultra summit elements and the centralizer of H is a finite index subgroup of the
2 7 A pr 2 00 4 SOME PROPERTIES OF SUBSETS OF HYPERBOLIC GROUPS
We present some results about quasiconvex subgroups of infinite index and their products. After that we extend the standard notion of a subgroup commensurator to an arbitrary subset of a group, and
...
...

References

SHOWING 1-10 OF 29 REFERENCES
Reducible Diagrams and Equations Over Groups
Diagrammatic reducibility is related to the solution of equations over groups. Sufficient conditions for the reducibility of all spherical diagrams are given, unifying and generalizing work of Adian,
Combings of Groups
We use combings to prove a theorem a la Rips. Applying it to hyperbolic groups one recovers Rips’ Theorem. When applied to automatic groups the theorem yields, via a theorem of Ken Brown, a proof
Discrete Groups of Motions
This paper deals with the discrete groups of rigid motions of the hyperbolic plane. It is known (12) that the finitely generated, orientation-preserving groups have the following presentations:
Lectures on three-manifold topology
Loop theorem-sphere theorem: The Tower Construction Connected sums 2-manifolds embedded in 3-manifolds Hierarchies Three-manifold groups Seifert fibered manifolds Peripheral structure Essential
Small cancellation theory and automatic groups: Part II
The main results obtained in Part I can be rephrased in the language of root systems and Euclidean planar tessellations as saying that finite A1 x A1 and A 2 piecewise Euclidean (abbreviated PE)
Real length functions in groups
This paper is a study of the structure of a group G equipped with a 'length' function from G to the nonnegative real numbers. The properties that we require this function to satisfy are derived from
Finite Automata and Their Decision Problems
TLDR
Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Manifolds of Nonpositive Curvature
Preface.-Introduction.-Lectures on Manifolds of Nonpositive Curvature.-Simply Connected Manifolds of Nonpositive Curvature.-Groups of Isometries.-Finiteness theorems.-Strong Rigidity of Locally
Dendrology of Groups: An Introduction
TLDR
The study of group actions on “generalized trees” or “ℝ-trees” has recently been attracting the attention of mathematicians in several different fields and has been developed further by the above-mentioned people and also by H. Culler, H. Gillet, M. Rimlinger and J. Stallings.
...
...