English
Related papers

Related papers: On words that are concise in residually finite gro…

200 papers

Elements of the free group define interesting maps, known as word maps, on groups. It was previously observed by Lubotzky that every subset of a finite simple group that is closed under endomorphisms occurs as the image of some word map. We…

Group Theory · Mathematics 2019-01-04 William Cocke , Meng-Che "Turbo" Ho

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

Group Theory · Mathematics 2017-01-19 Lev Glebsky

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

Group Theory · Mathematics 2017-11-28 Laurent Bartholdi , Ivan Mitrofanov

In this paper we show that there exists an uncountable family of finitely generated simple groups with the same positive theory as any non-abelian free group. In particular, these simple groups have infinite $w$-verbal width for all…

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

Group Theory · Mathematics 2026-02-24 Sathasivam Kalithasan , Viji Z. Thomas

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Logic · Mathematics 2023-07-25 Annalisa Conversano

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…

Group Theory · Mathematics 2025-08-11 Lucy Koch-Hyde , Siobhan O'Connor , Eamonn Olive , Vladimir Shpilrain

We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…

Category Theory · Mathematics 2019-03-28 Clara Loeh

A ring is called clean if every element is the sum of an invertible element and an idempotent. This paper investigates the cleanness of AW*-algebras. We prove that all finite AW*-algebras are clean, affirmatively solving a question posed by…

Operator Algebras · Mathematics 2025-04-21 Lu Cui , Minghui Ma

Let $G=< x,t\mid w>$ be a one-relator group, where $w$ is a word in $x,t$. If $w$ is a product of conjugates of $x$ then, associated with $w$, there is a polynomial $A_w(X)$ over the integers, which in the case when $G$ is a knot group, is…

Group Theory · Mathematics 2019-02-20 I. M. Chiswell , A. M. W. Glass , John S. Wilson

A group $G$ has $FW_n$ if every action on a $n$-dimensional $\mathrm{CAT}(0)$ cube complex has a global fixed point. This provides a natural stratification between Serre's $FA$ and Kazhdan's $(T)$. For every $n$, we show that random groups…

Group Theory · Mathematics 2025-05-28 Zachary Munro

A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…

Logic · Mathematics 2017-01-11 Wei Wang

A language $L$ is said to be dense if every word in the universe is an infix of some word in $L$. This notion has been generalized from the infix operation to arbitrary word operations $\varrho$ in place of the infix operation…

Formal Languages and Automata Theory · Computer Science 2019-03-08 Joey Eremondi , Oscar H. Ibarra , Ian McQuillan

Let $\sigma =\{\sigma_{i} | i\in I\}$ be some partition of the set of all primes $\Bbb{P}$ and let $G$ be a finite group. Then $G$ is said to be $\sigma $-full if $G$ has a Hall $\sigma _{i}$-subgroup for all $i$. A subgroup $A$ of $G$ is…

Group Theory · Mathematics 2017-09-20 Alexander N. Skiba

Let R be a class of groups closed under taking semidirect products with finite kernel and fully residually R-groups. We prove that R contains all R-by-{finitely generated residually finite} groups. It follows that a semidirect product of a…

Group Theory · Mathematics 2020-08-28 Goulnara Arzhantseva , Światosław R. Gal

Let $G$ be a finite group, let $p$ be a prime and let $w$ be a group-word. We say that $G$ satisfies $P(w,p)$ if the prime $p$ divides the order of $xy$ for every $w$-value $x$ in $G$ of $p'$-order and for every non-trivial $w$-value $y$ in…

Group Theory · Mathematics 2025-11-03 Yerko Contreras Rojas , Valentina Grazian , Carmine Monetta

In this note we provide a (decidable) graph-structural characterisation of the infiniteness of $L(w_1, ..., w_k)$, where $L(w_1, ..., w_k) = \{w \in A^* | |w|_{w_1} = \cdots = |w|_{w_k}\}$ is the set of all words that contain the same…

Formal Languages and Automata Theory · Computer Science 2019-10-29 Ryoma Sin'ya

In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…

Group Theory · Mathematics 2026-04-29 Laura Ciobanu , Daniel Turaev

Finite groups with given systems of permuteral and strongly permuteral subgroups are studied. New characterizations of w-supersoluble and supersoluble groups are received.

Group Theory · Mathematics 2013-05-14 A. F. Vasil'ev , V. A. Vasil'ev , T. I. Vasil'eva

Let G be a finite quasisimple group of Lie type. We show that there are regular semisimple elements x,y in G, x of prime order, and |y| is divisible by at most two primes, such that the product of the conjugacy classes of x and y contain…

Group Theory · Mathematics 2015-03-23 Robert M. Guralnick , Pham Huu Tiep