Related papers: Orbit-blocking words in free groups

We show that any non abelian free group $\F$ is strongly $\aleph_0$-homogeneous, i.e. that finite tuples of elements which satisfy the same first-order properties are in the same orbit under $\Aut(\F)$. We give a characterization of…

The automorphism group of a particular free spectrahedron is determined via a novel argument involving algebraic methods.

We begin with a review of the notion of a braid group. We then discuss some known solutions to decision problems in braid groups. We then move on to proving new results in braid group algorithmics. We offer a quick solution to the…

We study the average case complexity of the uniform membership problem for subgroups of free groups, and we show that it is orders of magnitude smaller than the worst case complexity of the best known algorithms. This applies to subgroups…

We prove that the full automorphism group and the outer automorphism group of the free group of countably infinite rank are coarsely bounded. That is, these groups admit no continuous actions on a metric space with unbounded orbits, and…

In this paper we prove that every non-central subnormal subgroup of the multiplicative group of a weakly locally finite division ring contains free non-cyclic subgroups.

The avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. A word (pattern) over a finite set is said to be unavoidable if, for all but finitely many words, there exists a morphism mapping…

Motivated by the study of the conjugacy problem for outer automorphism of free groups, we develop the algorithmic theory of the free-by-cyclic group produced by unipotent linearly growing automorphisms of f.g. free groups. We compute…

If X is a CW complex, one can assign to each point of X an ordered abelian group of finite rank whose subset of positive elements depends continuously on the points of X. A locally trivial bundle which arises in this way we denote by E(X).…

We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).

Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…

We generalize presentations of the fundamental group of discriminant complements and arrive at a class of presentations associated naturally with words in the free monoid of the alphabet $\sigma_1,\dots,\sigma_{n-1}$. Our study addresses…

We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…

Let $\mathbf{F}$ be the free group on two generators $a, b$ and let a family of words $w = [[a, b], [a^3, b^n]]$ in $\mathbf{F}$. In this paper we examine surjectivity of word map $w$ on special unitary group SU(2) over complex field…

In this note, we show that an uncountable locally free group, and therefore every locally free group, has a free subgroup whose cardinality is the same as that of $G$. This result directly improve the main result in [T. Nishinaka,"Group…

A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…

On a projective variety defined over a global field, any Brauer--Manin obstruction to the existence of rational points is captured by a finite subgroup of the Brauer group. We show that this subgroup can require arbitrarily many generators.

Let $H$ be a torsion-free $\delta$-hyperbolic group with respect to a finite generating set $S$. Let $a_1,..., a_n$ and $a_{1*},..., a_{n*}$ be elements of $H$ such that $a_{i*}$ is conjugate to $a_i$ for each $i=1,..., n$. Then, there is a…

We prove that every verbally closed subgroup of a free group $F$ of a finite rank is a retract of $F.$

We study direct products of free-abelian and free groups with special emphasis on algorithmic problems. After giving natural extensions of standard notions into that family, we find an explicit expression for an arbitrary endomorphism of…