Related papers: On certain C-test words for free groups

A BFC-group is a group in which all conjugacy classes are finite with bounded size. In 1954 B. H. Neumann discovered that if G is a BFC-group then the derived group G' is finite. Let w=w(x_1,\dots,x_n) be a multilinear commutator. We study…

Motivated by classical nontransitivity paradoxes, we call an $n$-tuple $(x_1,\dots,x_n) \in[0,1]^n$ \textit{cyclic} if there exist independent random variables $U_1,\dots, U_n$ with $P(U_i=U_j)=0$ for $i\not=j$ such that…

Given a (finite or infinite) subset $X$ of the free monoid $A^*$ over a finite alphabet $A$, the rank of $X$ is the minimal cardinality of a set $F$ such that $X \subseteq F^*$. We say that a submonoid $M$ generated by $k$ elements of $A^*$…

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

If F is a free group of finite rank at least two then any group of the form F by Z is large. In this short note we show how this statement follows by combining a very recent theorem of Hagen and Wise (using work of Agol and of Wise) with…

Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v=\phi(u) for some \phi \in AutF_n}. In this…

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 give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…

Let $F_n= F\langle x_1,...,x_n\rangle$ denote the free group of rank $n\ge 2$ and let $\mathrm{End}(F_n)$ be the endomorphism monoid of $F_n$. We show that automorphisms of $F_n$ are detected via the $\mathrm{End}(F_n)$-action on the first…

For an arbitrary word $w$ on an alphabet, we can define the alternating symbol graph, $G(w)$, as the graph in which the edge $(a, b)$ is in $E$ iff the letters $a$ and $b$ alternate in the word $w$. A graph $G = (V, E)$ is said to be…

Determining the index of the Simon congruence is a long outstanding open problem. Two words $u$ and $v$ are called Simon congruent if they have the same set of scattered factors, which are parts of the word in the correct order but not…

Let V(KG) be the normalized group of units of the group ring KG of a non-Dedekind group G with nontrivial torsion part t(G) over the integral domain K. We give a simple method for constructing free objects in V(KG).In particular, we show…

We provide a geometric model for the free $X$-generated $F$-restriction semigroup in the extended signature $(\cdot\,, ^+, ^m,\lambda)$, where the unary operation $^m$ maps an element $a$ to the maximum element $a^m$ of its $\sigma$-class,…

We prove that, although it is undecidable if a subgroup fixed by an automorphism intersects nontrivially an arbitrary subgroup of $F_n\times F_m$, there is an algorithm that, taking as input a monomorphism and an endomorphism of $F_n\times…

Let $\Sigma = X\cup X^{-1} = \{ x_1 ,x_2 ,..., x_m ,x_1^{-1} ,x_2^{-1} ,..., x_m^{-1} \}$ and let $G$ be a group with set of generators $\Sigma$. Let $\mathfrak{L} (G) =\left\{ \left. \omega \in \Sigma^* \; \right\vert \;\omega \equiv e \;…

For any subgroup H of Out(F_n), either H has a finite index subgroup that fixes the conjugacy class of some proper, nontrivial free factor of F_n, or H contains a fully irreducible element phi, meaning that no positive power of phi fixes…

We consider words $w$ over the alphabet $\Sigma=\{0,1,2\}$. It is shown that there are irreducibly square-free words of all lengths $n$ except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions $uu$ as factors), but by…

Let $\mathfrak A$ be an alphabet and $W$ be a set of words in the free monoid ${\mathfrak A}^*$. Let $S(W)$ denote the Rees quotient over the ideal of ${\mathfrak A}^*$ consisting of all words that are not subwords of words in $W$. A set of…

A word $w$ in a free group is called {\em chiral} if there exists a group $G$ such that image of word map corresponding to word $w$ is not closed with respect to inverse. Similarly a group $G$ is said to be {\em chiral} if there exists a…

We study the language-theoretic aspects of the word problem, in the sense of Duncan & Gilman, of free products of semigroups and monoids. First, we provide algebraic tools for studying classes of languages known as super-AFLs, which…