相关论文: Translation equivalent elements in free groups

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

For a group $G$ generated by $k$ elements, the Nielsen equivalence classes are defined as orbits of the action of $\operatorname{Aut} F_k$, the automorphism group of the free group of rank $k$, on the set of generating $k$-tuples of $G$.…

We show that for every $n\ge 2$ there exists a torsion-free one-ended word-hyperbolic group $G$ of rank $n$ admitting generating $n$-tuples $(a_1,\ldots ,a_n)$ and $(b_1,\ldots ,b_n)$ such that the $(2n-1)$-tuples $$(a_1,\ldots ,a_n,…

We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…

Every word $w$ in a free group naturally induces a probability measure on every compact group $G$. For example, if $w=\left[x,y\right]$ is the commutator word, a random element sampled by the $w$-measure is given by the commutator…

Let F_{n+m} be the free group of rank n+m, with generators x_1,...,x_{n+m}. An automorphism \phi of F_{n+m} is called partially symmetric if for each 1 \le i \le m, \phi(x_i) is conjugate to x_j or x_j^{-1} for some 1 \le j \le m. Let…

Extensions of a direct product T of two cyclic groups Z_n1 and Z_n2 by an Abelian (gauge) group G with the trivial action of T on G are considered. All possible (nonequivalent) factor systems are determined using the Mac Lane method. Some…

Let $F= < a,b>$ be a rank two free group. A word $W(a,b)$ in $F$ is {\sl primitive} if it, along with another group element, generates the group. It is a {\sl palindrome} (with respect to $a$ and $b$) if it reads the same forwards and…

The \emph{word problem} of a group $G = \langle \Sigma \rangle$ can be defined as the set of formal words in $\Sigma^*$ that represent the identity in $G$. When viewed as formal languages, this gives a strong connection between classes of…

A group $G$ is said to be equationally Noetherian if every system of equations in $G$ is equivalent to a finite subsystem. We show that all free-by-cyclic groups are equationally Noetherian. As a corollary, we deduce that the set of…

We study the existence of homomorphisms between Out(F_n) and Out(F_m) for n > 5 and m < n(n-1)/2, and conclude that if m is not equal to n then each such homomorphism factors through the finite group of order 2. In particular this provides…

An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling…

Let $F$ be a free group. We present for arbitrary $g\in\mathbb{N}$ a LogSpace (and thus polynomial time) algorithm that determines whether a given $w\in F$ is a product of at most $g$ commutators; and more generally an algorithm that…

The Hanna Neumann conjecture states that if F is a free group, then for all finitely generated subgroups H,K <= F, rank(H intersect K) - 1 <= [ rank(H)-1 ] [ rank(K)-1 ] In this paper, we show that if one of the subgroups, say H, has a…

We investigate the category of U(h)-free g-modules. Using a functor from this category to the category of coherent families, we show that U(h)-free modules only can exist when g is of type A or C. We then proceed to classify isomorphism…

It is well known that if $G$ admits a f.g. subgroup $H$ with a weaklyaperiodic SFT (resp. an undecidable domino problem), then $G$itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the…

Howie and Duncan observed that a word in a free product with length at least two and which is not a proper power can be decomposed as a product of two cyclic subwords each of which is uniquely positioned. Using this property, they proved…

Homology of the group Aut(F_n) of automorphisms of a free group on n generators is known to be independent of n in a certain stable range. Using tools from homotopy theory, we prove that in this range it agrees with homology of symmetric…

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

Given a construction $f$ on groups, we say that a group $G$ is \textit{$f$-realisable} if there is a group $H$ such that $G\cong f(H)$, and \textit{completely $f$-realisable} if there is a group $H$ such that $G\cong f(H)$ and every…