Related papers: Groups whose word problems are not semilinear

Techniques are developed for creating new and general language families of only semilinear languages, and for showing families only contain semilinear languages. It is shown that for language families L that are semilinear full trios, the…

The family, L(INDLIN), of languages generated by linear indexed grammars has been studied in the literature. It is known that the Parikh image of every language in L(INDLIN) is semi-linear. However, there are bounded semi linear languages…

For a family of group words $w$ we show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely many subgroups with a prescribed property, then $w(G)$ has the same property as well. In particular, we…

Let $K$ be a $p$-adically closed field and $G$ a group interpretable in $K$. We show that if $G$ is definably semisimple (i.e. $G$ has no definable infinite normal abelian subgroups) then there exists a finite normal subgroup $H$ such that…

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…

A result by Bridson, Howie, Miller, and Short states that if $S$ is a finitely presented subgroup of the direct product of free groups, then $S$ is virtually a nilpotent extension of a direct product of free groups. Moreover, if $S$ is a…

We find algebraic conditions on a group equivalent to the position of its Diophantine problem in the Chomsky Hierarchy. In particular, we prove that a finitely generated group has a context-free Diophantine problem if and only if it is…

Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the…

Let $G$ be a hyperbolic group that splits as a graph of free groups with cyclic edge groups. We prove that, unless $G$ is isomorphic to a free product of free and surface groups, every finite abelian group $M$ appears as a direct summand in…

We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…

A group-word $w$ is called concise if the verbal subgroup $w(G)$ is finite whenever $w$ takes only finitely many values in a group $G$. It is known that there are words that are not concise. In particular, Olshanskii gave an example of such…

We study subsets $E$ of finitely generated groups where the set of all words over a given finite generating set that lie in $E$ forms a context-free language. We call these sets recognisably context-free. They are invariant of the choice of…

Let $G$ be a non-amenable locally compact group and $K$ a compact subgroup of $G$ such that $(G,K)$ is a Gelfand pair. We show that if $G$ admits a suitable boundary representation which is topologically irreducible and not unitarizable,…

Let G be a finite non-nilpotent group such that every Sylow subgroup of G is generated by at most d elements, and such that p is the largest prime dividing |G|. We show that G has a non-nilpotent image G/N, such that N is characteristic and…

We define an algebraic group over a group $G$ to be a variety - that is, a subset of $G^d$ defined by equations over $G$ - endowed with a group law whose coordinates can be expressed as word maps. In the case where $G$ is a torsion-free…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

The work investigates the problem of whether a context-free language is a subset of a group language. A.~V. Anisimov has shown that the problem of determining the unambiguity of finite automata is a special case of this problem. Then the…

In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…

We show that any finitely generated group $F$ with infinitely many ends is not a group of fractions of any finitely generated proper subsemigroup $P$, that is $F$ cannot be expressed as a product $P P^{-1}$. In particular this solves a…

Let $S$ be either a free group or the fundamental group of a closed hyperbolic surface. We show that if $G$ is a finitely generated residually-$p$ group with the same pro-$p$ completion as $S$, then two-generated subgroups of $G$ are free.…