Related papers: On rational and concise words

We deal with the following conjecture. If w is a group word and G is a finite group in which any nilpotent subgroup generated by w-values has exponent dividing e, then the exponent of the verbal subgroup w(G) is bounded in terms of e and w…

We prove that a subset of a virtually free group is rational if and only if the language of geodesic words representing its elements (in any generating set) is rational and that the language of geodesics representing conjugates of elements…

Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is…

Let v and w be nontrivial words in two free groups. We prove that, for all sufficiently large finite non-abelian simple groups G, there exist subsets C of v(G) and D of w(G) of size such that every element of G can be realized in at least…

We propose a criterion for preserving the regularity of a formal language representation when passing from groups to subgroups. We use this criterion to show that the regularity of a positive cone language in a left-orderable group passes…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…

A group G has restricted centralizers if for each g in G the centralizer C_G(g) either is finite or has finite index in G. A theorem of Shalev states that a profinite group with restricted centralizers is abelian-by-finite. In the present…

An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…

We call a finite group irrational if none of its elements is conjugate to a distinct power of itself. We prove that those groups are solvable and describe certain classes of these groups, where the above property is only required for…

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…

A finite group $G$ is called uniformly semi-rational if there exists an integer $r$ such that the generators of every cyclic sugroup $\langle x \rangle$ of $G$ lie in at most two conjugacy classes, namely $x^G$ or $(x^r)^G$. In this paper,…

Much work has been done to study groups with few rational conjugacy classes or few rational irreducible characters. In this paper we look at the opposite extreme. Let $G$ be a finite group. Given a conjugacy class $K$ of $G$, we say it is…

We give a geometric characterization of finite rational groups. In particular, we prove that a finite group is rational if and only if there exists a finite geometry $\Gamma$ of type $I$ and action of $G$ on $\Gamma$ as a group of…

A word $w$ in a free group is {\em achiral} if for every group $G,$ $G_w=G_{w^{-1}},$ where $G_w$ is the image of the word map $w$ on $G.$ We will give few classes of examples of achiral words. Cocke and Ho asked whether Engel words are…

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

Every word in a free group $F$ induces a probability measure on every finite group in a natural manner. It is an open problem whether two words that induce the same measure on every finite group, necessarily belong to the same orbit of…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…