Related papers: Primitivity rank for random elements in free group…
We prove a freeness theorem for low-rank subgroups of one-relator groups. Let $F$ be a free group, and let $w\in F$ be a non-primitive element. The primitivity rank of $w$, $\pi(w)$, is the smallest rank of a subgroup of $F$ containing $w$…
Let F_k be the free group on k generators. A word w \in F_k is called primitive if it belongs to some basis of F_k. We investigate two criteria for primitivity, and consider more generally, subgroups of F_k which are free factors. The first…
Let $F_k$ be the free group on $k$ generators, and let $H\le J\le \F_k$ be subgroups of finite rank. We present a new elementary algorithm to determine whether $H$ is a free factor of $J$. In particular, this algorithm can determine whether…
Let $F= < a,b>$ be a rank two free group. A word $W(a,b)$ in $F$ is {\sl primitive} if it, along with another group element, generates the group. It is a {\sl palindrome} (with respect to $a$ and $b$) if it reads the same forwards and…
An element w of the extension E of degree n over the finite field F=GF(q) is called free over F if {w, w^q,...,w^{q^{n-1}}} is a (normal) basis of E/F. The Primitive Normal Basis Theorem, first established in full by Lenstra and Schoof…
A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…
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^*$…
We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…
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…
Every word $w$ in the free group $F_r$ of rank $r$ induces a probability measure (the $w$-measure) on every compact group $G$, by substitution of Haar-random $G$-elements in the letters. This measure is determined by its Fourier…
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^*$. A submonoid $M$ generated by $k$ elements of $A^*$ is…
Let $\pi$ be a set of primes and $\mathfrak{F}$ be a formation. In this article a properties of the class ${\rm w}^{*}_{\pi}\mathfrak{F}$ of all groups $G$, such that $\pi(G)\subseteq \pi(\mathfrak{F})$ and the normalizers of all Sylow…
An endomorphism of a free group is called primitivity preserving if it takes every primitive element to another primitive. In this paper we prove that every primitivity preserving endomorphism of a free group of a finite rank n > 2 is an…
We introduce the notion of primitive elements in arbitrary truncated $p$-divisible groups. By design, the scheme of primitive elements is finite and locally free over the base. Primitive elements generalize the "points of exact order $N$,"…
The prime simplicial complex $\Pi(G)$ of a finite group $G$ is composed of all sets of primes $S$ where $G$ has an element of order the product of primes in $S$, with the subsets partially ordered by inclusion. This complex was introduced…
By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…
The centrepiece of this paper is a normal form for primitive elements which facilitates the use of induction arguments to prove properties of primitive elements. The normal form arises from an elementary algorithm for constructing a…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
Given an explicit presentation of a reflection group of rank two (or any rank two group for that matter), we give a simple procedure for calculating all its systems of imprimitivity, when viewed as a matrix group over the quaternions. This…
Let $\pi$ be a set of primes. According to H. Wielandt, a subgroup $H$ of a finite group $X$ is called a $\pi$-submaximal subgroup if there is a monomorphism $\phi:X\rightarrow Y$ into a finite group $Y$ such that $X^\phi$ is subnormal in…