Related papers: The stable conjugation-invariant word norm is rati…

For any group, there is a natural (pseudo-)norm on the vector space B1 of real (group) 1-boundaries, called the stable commutator length norm. This norm is closely related to, and can be thought of as a relative version of, the Gromov…

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…

In this note we prove that finitely generated virtually free groups are stable with respect to a normalized $p$-Schatten norm for $1\leq p < \infty$. In particular, this implies that virtually free groups are Hilbert-Schmidt stable.

This work is concerned with the stable norm in word hyperbolic groups as defined by Gromov. We give a short elementary proof of one of its basic property, that is existence of a computable uniform non null lower bound for stable norm in a…

We show that the Aut-invariant word norm on right angled Artin and right angled Coxeter groups is unbounded (except in few special cases). To prove unboundedness we exhibit certain characteristic subgroups. This allows us to find unbounded…

In this paper we consider the {\em conjugacy stability} property of subgroups and provide effective procedures to solve the problem in several classes of groups. In particular, we start with free groups, that is, we give an effective…

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…

Let G be one of the groups SL_n C, Sp_2n C, SO_m C, O_m C, or G_2. For a generically free G-representation V, we say that N is a level of stable rationality for V/G if V/G x P^N is rational. In this paper we improve known bounds for the…

Accessible groups for which the language of all words defining the identity is accepted by a certain class of nested stack automata are virtually free.

We compute the rational stable homology of the automorphism groups of free nilpotent groups. These groups interpolate between the general linear groups over the ring of integers and the automorphism groups of free groups, and we employ…

This note provides an alternate account of Calegari's rationality theorem for stable commutator length in free groups.

We initiate an investigation into the local structure of simple nonnuclear C$^*$-crossed products by showing that stable rank one is generic within two natural classes of minimal actions of free groups on the Cantor set. The arguments also…

Let $F$ be a free non-abelian group. We show that for any group word $w$ the set $w[F]$ of all values of $w$ in $F$ is rational in $F$ if and only if $w[F] = 1$ or $w[F] = F.$ We generalize this to a wide class of free products of groups.

The study of verbal subgroups within a group is well-known for being an effective tool to obtain structural information about a group. Therefore, conditions that allow the classification of words in a free group are of paramount importance.…

We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…

We study verbally closed subgroups of free solvable groups. A number of results is proved that give sufficient conditions under whose a verbally closed subgroup is turned to be a retract and so algebraically closed of the full group.

We prove (using grammars) that the free inverse monoid of every finite rank has co-context-free word problem. Equivalently, the co-word problem of the free inverse monoid of every finite rank is context-free.