English
Related papers

Related papers: Primitive Words, Free Factors and Measure Preserva…

200 papers

Every word $w$ in a free group naturally induces a probability measure on every compact group $G$. For example, if $w=\left[x,y\right]$ is the commutator word, a random element sampled by the $w$-measure is given by the commutator…

Group Theory · Mathematics 2022-12-27 Michael Magee , Doron Puder

Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a…

Group Theory · Mathematics 2025-02-19 Matan Seidel , Danielle Ernst-West , Doron Puder

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements. An element $\alpha \in \mathbb{F}_{q^n}$ is called $k$-normal over $\mathbb{F}_q$ if $\alpha$ and its conjugates generate a vector subspace of $\mathbb{F}_{q^n}$ of dimension…

Number Theory · Mathematics 2025-11-03 Josimar J. R. Aguirre , Sarah F. M. Mazzini , Victor G. L. Neumann

Consider a group word w in n letters. For a compact group G, w induces a map G^n \rightarrow G$ and thus a pushforward measure {\mu}_w on G from the Haar measure on G^n. We associate to each word w a 2-dimensional cell complex X(w) and…

Group Theory · Mathematics 2011-02-23 Gene S. Kopp , John D. Wiltshire-Gordon

Fix a finite field $K$ of order $q$ and a word $w$ in a free group $F$ on $r$ generators. A $w$-random element in $GL_N(K)$ is obtained by sampling $r$ independent uniformly random elements $g_1,\ldots,g_r\in GL_N(K)$ and evaluating…

Group Theory · Mathematics 2024-10-30 Danielle Ernst-West , Doron Puder , Matan Seidel

This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This makes the article almost self-contained. I also contribute by…

Formal Languages and Automata Theory · Computer Science 2026-01-28 Francis Wlazinski

Given a group word $w$ and a group $G$, the set of $w$-values in $G$ is denoted by $G_w$ and the verbal subgroup $w(G)$ is the one generated by $G_w$. In the present paper we consider profinite groups admitting a word $w$ such that the…

Group Theory · Mathematics 2021-02-16 João Azevedo , Pavel Shumyatsky

A nonnegative matrix A is said to be primitive if there exists a positive integer m such that entries in A^m are positive and smallest such m is called the exponent of A: Primitive matrices are useful in the study of finite Markov chains…

History and Overview · Mathematics 2024-03-01 Monimala Nej

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

Group Theory · Mathematics 2017-06-27 Michael Larsen , Aner Shalev

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…

Group Theory · Mathematics 2007-05-23 Michael Larsen

In this work, we explore the following question: If two words in a finitely generated free group have identical images as word maps on every finite group, must they be endomorphic to each other? In this regard, we introduce weak profinite…

Group Theory · Mathematics 2026-03-02 Shrinit Singh

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. The problem whether every word is concise in the…

Group Theory · Mathematics 2024-02-26 Pavel Shumyatsky

We consider non-elementary representations of two generator free groups in $PSL(2,\mathbb{C})$, not necessarily discrete or free, $G = < A, B >$. A word in $A$ and $B$, $W(A,B)$, is a palindrome if it reads the same forwards and backwards.…

Geometric Topology · Mathematics 2008-08-27 Jane Gilman , Linda Keen

This paper studies the free group of rank two from the point of view of Stallings core graphs. The first half of the paper examines primitive elements in this group, giving new and self-contained proofs for various known results about them.…

Group Theory · Mathematics 2014-05-29 Ori Parzanchevski , Doron Puder

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…

Number Theory · Mathematics 2007-09-17 Melvyn B. Nathanson

Let $P_k$ be the subgroup generated by $k$th powers of primitive elements in $F_r$, the free group of rank $r$. We show that $F_2/P_k$ is finite if and only if $k$ is $1$, $2$, or $3$. We also fully characterize $F_2/P_k$ for $k = 2,3,4$.…

Group Theory · Mathematics 2021-01-06 Khalid Bou-Rabee , W. Patrick Hooper

We conjecture that if $G$ is a finite primitive group and if $g$ is an element of $G$, then either the element $g$ has a cycle of length equal to its order, or for some $r,m$ and $k$, the group $G\leq S_m\wr S_r$, preserving a product…

Group Theory · Mathematics 2013-11-18 Michael Giudici , Cheryl E. Praeger , Pablo Spiga

Using the properties of the ideal of the coordinate Hermite interpolation on n-dimensional grid [4], we prove that the extension k in k[x1, x2, ..., xn] / (f1(x1), ..., fn(xn)) has a primitive element if and only if at most one of the…

Algebraic Geometry · Mathematics 2024-05-01 Aristides I. Kechriniotis

In this paper we generalize the results of Sharma, Awasthi and Gupta (see \cite{SAG}). We work over a field of any characteristic with $q = p^k$ elements and we give a sufficient condition for the existence of a primitive element $\alpha…

Number Theory · Mathematics 2020-02-06 C. Carvalho , J. P. G. Sousa , V. G. L. Neumann , G. Tizziotti

We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-automatic sequence is itself k-automatic. We also show that the…

Formal Languages and Automata Theory · Computer Science 2012-11-08 Daniel Goc , Kalle Saari , Jeffrey Shallit