English
Related papers

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

200 papers

We use a recent result of Alexander and Nishinaka to show that if $G$ is a non-elementary torsion-free hyperbolic group and $R$ is a countable domain, then the group ring $RG$ is primitive. This implies that the group ring $KG$ of any…

Group Theory · Mathematics 2018-06-14 Brent B. Solie

A group $G$ is said to be $k$-generated if it has a generating set with $k$ elements. A positive integer $n$ is called a \emph{2-generated number} if every group of order $n$ is 2-generated. In this article, we establish an arithmetic…

Group Theory · Mathematics 2025-08-25 Bireswar Das , Kavita Samant , Dhara Thakkar

We prove the following results. Let w be a multilinear commutator word. If G is a profinite group in which all w-values are contained in a union of countably many periodic subgroups, then the verbal subgroup w(G) is locally finite. If G is…

Group Theory · Mathematics 2013-09-04 Eloisa Detomi , Marta Morigi , Pavel Shumyatsky

A C*-algebra is called primitive if it admits a faithful and irreducible *-representation. We show that if A_1 and A_2 are separable, unital, residually finite dimensional C*-algebras that are not both two dimensional, then their unital…

Operator Algebras · Mathematics 2012-06-22 Ken Dykema , Francisco Torres-Ayala

Let $F$ be a finitely generated free group and let $H\le F$ be a finitely generated subgroup. Given an element $g\in F$, we study the ideal $\mathfrak{I}_g$ of equations for $g$ with coefficients in $H$, i.e. the elements $w(x)\in H*\langle…

Group Theory · Mathematics 2025-06-25 Dario Ascari

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

Group Theory · Mathematics 2024-10-23 Julian Wykowski

Let $z\ne \pm1,w^2$ be a fixed integer, and let $f(t)\ne g(t)^2$ be a fixed polynomial over the integers. It is shown that the subset of primes $p\geq 2$ such that $z$ and $f(z)$ is a pair of simultaneous primitive roots modulo $p$ has…

General Mathematics · Mathematics 2022-04-06 N. A. Carella

Primitive types are fundamental components available in any programming language, which serve as the building blocks of data manipulation. Understanding the role of these types in source code is essential to write software. Little work has…

Software Engineering · Computer Science 2021-05-20 Mahfouth Alghamdi , Shinpei Hayashi , Takashi Kobayashi , Christoph Treude

The classical Waring problem deals with expressing every natural number as a sum of g(k) kth powers. Similar problems for finite simple groups have been studied recently, and in this paper we study them for finite quasisimple groups G. We…

Group Theory · Mathematics 2011-07-19 Michael Larsen , Aner Shalev , Pham Huu Tiep

Let $\mathbb{F}_q$ be the finite field of $q$ elements, and let $k\mid q-1$ be a positive integer. Let $f(x)=ax^2+bx+c$ be a quadratic polynomial in $\mathbb{F}_q[x]$ with $b^2-4ac\ne0$. In this paper, we show that if…

Number Theory · Mathematics 2021-04-27 Hai-Liang Wu , Yue-Feng She

We are interested in semigroups of the form $\langle G,a\rangle\setminus G$, where $G$ is a permutation group of degree $n$ and $a$ a non-permutation on the domain of $G$. A theorem of the first author, Mitchell and Schneider shows that, if…

Group Theory · Mathematics 2016-11-28 João Araújo , Peter J. Cameron

Let $w$ be a word in the free group of rank $n \in \mathbb{N}$ and let $\mathcal{V}(w)$ be the variety of groups defined by the law $w=1$. Define $\mathcal{V}(w^*)$ to be the class of all groups $G$ in which for any infinite subsets $X_1,…

Group Theory · Mathematics 2007-05-23 Alireza Abdollahi

Let $F_n$ be a free group of rank $n$. In this paper we discuss three algorithmic problems related to automorphisms of $F_2$. A word $u$ of $F_n$ is called positive if $u$ does not have negative exponents. A word $u$ in $F_n$ is called…

Group Theory · Mathematics 2011-05-03 Donghi Lee

The Gilman-Maskit algorithm for determining the discreteness or non-discreteness of a two-generator subgroup of $\mathrm{PSL}_2\mathbb{R}$ terminates with a pair of generators that are Farey words. The Farey words are primitive words that…

Group Theory · Mathematics 2016-04-19 Andrew E. Silverio

Let $G$ be a finitely generated group, $A$ a finite set of generators and $K$ a subgroup of $G$. We call the pair $(G,K)$ context-free if the set of all words over $A$ that reduce in $G$ to an element of $K$ is a context-free language. When…

Group Theory · Mathematics 2012-12-05 Tullio Ceccherini-Silberstein , Wolfgang Woess

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…

Group Theory · Mathematics 2013-03-21 Frédérique Bassino , Armando Martino , Cyril Nicaud , Enric Ventura , Pascal Weil

We study the intersection of finitely generated factor-free subgroups of free products of groups by utilizing the method of linear programming. For example, we prove that if $H_1$ is a finitely generated factor-free noncyclic subgroup of…

Group Theory · Mathematics 2018-01-03 Sergei V. Ivanov

Motivated by results about "untangling" closed curves on hyperbolic surfaces, Gupta and Kapovich introduced the primitivity and simplicity index functions for finitely generated free groups, $d_{prim}(g;F_N)$ and $d_{simp}(g;F_N)$, where…

Group Theory · Mathematics 2022-12-02 Ilya Kapovich , Zachary Simon

A number field $K$ is called primitive if $\mathbb Q$ and $K$ are the only subfields of $K$. Let $X$ be a nice curve over $\mathbb Q$ of genus $g$. A point $P$ of degree $d$ on $X$ is called primitive if the field of definition $\mathbb…

Number Theory · Mathematics 2024-11-12 Maarten Derickx

A code $X$ is not primitivity preserving if there is a primitive list ${\mathbf w} \in {\tt lists} X$ whose concatenation is imprimitive. We formalize a full characterization of such codes in the binary case in the proof assistant…

Formal Languages and Automata Theory · Computer Science 2025-10-09 Štěpán Holub , Martin Raška , Štěpán Starosta