English
Related papers

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

200 papers

A finite word $w$ with $\vert w\vert=n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called \emph{rich}. Let $\Factor(w)$ be the set of factors of the word $w$. It is known that there…

Combinatorics · Mathematics 2019-09-06 Josef Rukavicka

Let $w$ be a multilinear commutator word. In the present paper we describe recent results that show that if $G$ is a profinite group in which all $w$-values are contained in a union of finitely (or in some cases countably) many subgroups…

Group Theory · Mathematics 2017-03-06 Cristina Acciarri , Pavel Shumyatsky

Let $G$ be a finite primitive permutation group on a set $\Omega$ with nontrivial point stabilizer $G_{\alpha}$. We say that $G$ is extremely primitive if $G_{\alpha}$ acts primitively on each of its orbits in $\Omega \setminus \{\alpha\}$.…

Group Theory · Mathematics 2020-09-01 Timothy C. Burness , Adam R. Thomas

Consider the wreath product $\Gamma = F\wr \mathrm{F_n} = \bigoplus_{\mathrm{F_n}}F\rtimes\mathrm{F_n}$, with $F$ a finite group and $\mathrm{F_n}$ the free group on $n$ generators. We study the Baum-Connes conjecture for this group. Our…

Operator Algebras · Mathematics 2019-11-13 Sanaz Pooya

Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an alphabet with $k$ letters, where $\alpha$ is a positive rational number and $k$ is positive integer. We prove that if $\alpha\geq 5$, $k\geq…

Formal Languages and Automata Theory · Computer Science 2023-07-10 Josef Rukavicka

Suppose $G$ is a free product $G = A_1 * A_2* \cdots * A_k * F_N$, where each of the groups $A_i$ is torsion-free and $F_N$ is a free group of rank $N$. Let $\mathcal{O}$ be the deformation space associated to this free product…

Group Theory · Mathematics 2025-05-02 Matt Clay , Caglar Uyanik

In this paper, we consider a natural generalization of the concept of order of an element in a group: an element $g \in G$ is said to have order $k$ in a subgroup $H$ of $G$ (\resp \wrt a coset $Hu$) if $k$ is the first strictly positive…

Group Theory · Mathematics 2021-05-11 Jordi Delgado , Enric Ventura , Alexander Zakharov

Let $\mathfrak F$ be a formation and let $G$ be a group. A subgroup $H$ of $G$ is $\mathrm{K}\mathfrak F$-subnormal (submodular) in $G$ if there is a subgroup chain $H=H_0\le \ H_1 \le \ \ldots \le H_i \leq H_{i+1}\le \ldots \le \ H_n=G$…

Group Theory · Mathematics 2023-06-23 Victor S. Monakhov , Irina L. Sokhor

It is well known that a nontrivial commutator in a free group is never a proper power. We prove a theorem that generalizes this fact and has several worthwhile corollaries. For example, an equation $[ x_1, y_1] \ldots [ x_k, y_k] = z^n$,…

Group Theory · Mathematics 2018-10-03 S. V. Ivanov , Anton A. Klyachko

Let $w=w(x_1,...,x_n)$ be a word, i.e. an element of the free group $F = \langle x_1,...,x_n \rangle$. The verbal subgroup $w(G)$ of a group $G$ is the subgroup generated by the set $\{ w(x_1,...,x_n) : x_1,...,x_n \in G \}$ of all…

Group Theory · Mathematics 2024-03-14 Francesca Lisi , Luca Sabatini

Let $w=w(x_1,\ldots,x_r)$ be a lower central word or a derived word. We show that the word $w(u_1,\ldots,u_r)$ is concise whenever $u_1,\ldots,u_r$ are non-commutator words in disjoint sets of variables, thus proving a generalized version…

Group Theory · Mathematics 2023-07-28 Gustavo A. Fernández-Alcober , Matteo Pintonello

A deterministic finite (semi)automaton is primitive if its transition monoid (semigroup) acting on the set of states has no non-trivial congruences. It is synchronizing if it contains a constant map (transformation). In analogy to…

Formal Languages and Automata Theory · Computer Science 2023-07-06 Igor Rystsov , Marek Szykuła

Let $q=p^k$ be a prime power, let $\mathbb{F}_q$ be a finite field and let $n\geq2$ be an integer. This note investigates the existence small primitive normal elements in finite field extensions $\mathbb{F}_{q^n}$. It is shown that a small…

General Mathematics · Mathematics 2026-01-06 N. A. Carella

In this article we relate two different densities. Let $F_k$ be the free group of finite rank $k \ge 2$ and let $\alpha$ be the abelianization map from $F_k$ onto $ \mathbb{Z}^k$. We prove that if $S \subseteq \mathbb{Z}^k$ is invariant…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Igor Rivin , Paul Schupp , Vladimir Shpilrain

Denote by $\mathbb F_q$ the finite field of order $q$ and by $\mathbb F_{q^n}$ its extension of degree $n$. Some $a\in\mathbb F_{q^n}$ is called primitive if it generates the multiplicative group $\mathbb F_{q^n}^*$ and it is called…

Number Theory · Mathematics 2025-11-21 Theodoulos Garefalakis , Giorgos Kapetanakis

Let $G$ be a finite primitive permutation group on a set $\Omega$ and recall that the fixed point ratio of an element $x \in G$, denoted ${\rm fpr}(x)$, is the proportion of points in $\Omega$ fixed by $x$. Fixed point ratios in this…

Group Theory · Mathematics 2022-11-09 Timothy C. Burness , Robert M. Guralnick

We consider amalgamated unital full free products of the form $A_1*_DA_2$, where $A_1, A_2$ and $D$ are finite dimensional C*-algebras and there are faithful traces on $A_1$ and $A_2$ whose restrictions to $D$ agree. We provide several…

Operator Algebras · Mathematics 2014-01-09 Francisco Torres-Ayala

Let $p$ be a prime. If an integer $g$ generates a subgroup of index $t$ in $(\mathbb Z/p\mathbb Z)^*,$ then we say that $g$ is a $t$-near primitive root modulo $p$. We point out the easy result that each primitive residue class contains a…

Number Theory · Mathematics 2019-11-13 Pieter Moree , Min Sha

Let $H$ be a subgroup of $\text{Sym}_n$, the symmetric group of degree $n$. For a fixed integer $l \geq 2$, the group $G$ presented with generators $x_1, x_2, \ldots ,x_n$ and with relations $x_{i_1}x_{i_2}\cdots x_{i_l} =x_{\sigma (i_1)}…

Rings and Algebras · Mathematics 2022-03-16 Ferran Cedo , Eric Jespers , Georg Klein

A graph of order $n$ is said to be $k$-\emph{factor-critical} $(0\le k<n)$ if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not $k$-factor-critical…

Combinatorics · Mathematics 2026-03-12 Kevin Pereyra
‹ Prev 1 8 9 10 Next ›