Related papers: A Free Group of Rotations of Rank 2

Lists of equivalence classes of words under rotation or rotation plus reversal (i.e., necklaces and bracelets) have many uses, and efficient algorithms for generating these lists exist. In combinatorial group theory elements of a group are…

We classify all subgroups of $SO(3)$ that are generated by two elements, each a rotation of finite order, about axes separated by an angle that is a rational multiple of $\pi$. In all cases we give a presentation of the subgroup. In most…

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings'…

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

In this paper, we prove results on enumerations of sets of Rota-Baxter words in a finite number of generators and a finite number of unary operators. Rota-Baxter words are words formed by concatenating generators and images of words under…

Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions of CTs can be made algorithmic. A key…

The 4-simplex has vertices 5 unit quaternions, which we arrange so that one of them is the unit. We show that the remaining 4 vertices are the generators of a free group. For the proof, we introduce a new alternating length on words in free…

This work discusses the open problem of the faithfulness of the reduced Burau representation for $n=4$. Birman showed that in order to prove this representation is faithful, it is sufficient to find two matrices $A$ and $B$ that generate a…

An approach to a classification of groups generated by 3-state automata over a 2-letter alphabet and the current progress in this direction are presented. Several results related to the whole class are formulated. In particular, all finite,…

We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…

We construct automata over a binary alphabet with $2n$ states, $n\geq 2$, whose states freely generate a free group of rank $2n$. Combined with previous work, this shows that a free group of every finite rank can be generated by finite…

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…

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…

We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3.

We construct a family of automata with n states, n>3, acting on a rooted binary tree that generate the free products of cyclic groups of order 2.

Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_{\phi}(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $\phi$. If an orbit like that is finite, we determine precisely what its…

We prove a new version of the classical peak-reduction theorem for automorphisms of free groups in the setting of right-angled Artin groups. We use this peak-reduction theorem to prove two important corollaries about the action of the…

Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…