Related papers: Word length in surface groups with characteristic …

We study the properties of groups that have presentations in which the square of each generator gives the identity and all relations are of even length. We consider the parabolic subgroups of such a group and show that every element has a…

We give various estimates of the minimal number of self-intersections of a nontrivial element of the kth term of the lower central series and derived series of the fundamental group of a surface. As an application, we obtain a new…

We prove two conjectures on the automorphism group of a one-dimensional formal group law defined over a field of positive characteristic. The first is that if a series commutes with a nontorsion automorphism of the formal group law, then…

Let F be a local field of positive characteristic, and let G be either a Heisenberg group over F, or a certain (nonabelian) two-dimensional unipotent group over F. If H is an arithmetic subgroup of G, we provide an explicit description of…

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…

Formal languages based on the multiplication tables of finitely generated groups are investigated and used to give a linguistic characterization of word hyperbolic groups.

We study the word length entropy of automorphisms of residually nilpotent groups, and how the entropy of such group automorphisms relates to the entropy of induced automorphisms on various nilpotent quotients. We show that much like the…

For any finite collection $f_i$ of fully irreducible automorphisms of the free group $F_n$ we construct a connected $\delta$-hyperbolic $Out(F_n)$-complex in which each $f_i$ has positive translation length.

If totally periodic points are dense in a subshift $X$, its automorphism group is residually finite. We show a weak converse: if periodic points are not dense in a subshift $X$, then the automorphism group of $X \times Y$ is not residually…

In this paper we obtain a bound on the number of isometry classes of finite area hyperbolic surfaces which are length isospectral to a given surface depending only on the topological type of the surface and the length of the shortest closed…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…

We show that, if $w_1, \ldots , w_6$ are words which are not an identity of any (non-abelian) finite simple group, then $w_1(G)w_2(G) \cdots w_6(G) = G$ for all (non-abelian) finite simple groups $G$. In particular, for every word $w$,…

Let $H$ be a Krull monoid with class group $G$ such that every class contains a prime divisor. Then every nonunit $a \in H$ can be written as a finite product of irreducible elements. If $a=u\_1 \cdot \ldots \cdot u\_k$, with irreducibles…

We introduce a new framework linking group theory and formal language theory which generalizes a number of ways these topics have been linked in the past. For a language class C in the Chomsky hierarchy, we say a group is epiC if it admits…

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

The density of a rational language can be understood as the frequency of some "pattern" in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational…

A group is combable if it can be represented by a language of words satisfying a fellow traveller property; an automatic group has a synchronous combing which is a regular language. This paper gives a systematic analysis of the properties…

This work addresses the existence of transitive extensions of certain infinite permutation groups which arise as the automorphism groups of model-theoretic structures which are generic in the Fra\"iss\'e sense. The study of transitive…

In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…