English
Related papers

Related papers: On profinite groups admitting a word with only few…

200 papers

We consider metric versions of weak soficity, LEF and residual finiteness. The main results of the paper extend Glebsky and Rivera's characterization of weak soficity to the case of normally finitely generated groups with word metrics.…

Group Theory · Mathematics 2025-04-23 Aleksander Ivanov

Let $m,n$ be positive integers and $w$ a multilinear commutator word. Assume that $G$ is a finite group having subgroups $G_1,\ldots,G_m$ whose union contains all $w$-values in $G$. Assume further that all elements of the subgroups…

Group Theory · Mathematics 2019-01-08 Pavel Shumyatsky , Danilo Silveira

We investigate some properties of the $p$-elements of a profinite group $G$. We prove that if $p$ is odd and the probability that a randomly chosen element of $G$ is a $p$-element is positive, then $G$ contains an open prosolvable subgroup.…

Group Theory · Mathematics 2024-07-01 Andrea Lucchini , Nowras Otmen

Let $G$ be a profinite group. We prove that the commutator subgroup $G'$ is finite-by-procyclic if and only if the set of all commutators of $G$ is contained in a union of countably many procyclic subgroups.

Group Theory · Mathematics 2016-11-08 Cristina Acciarri , Pavel Shumyatsky

Broadly speaking, a finiteness property of groups is any generalisation of the property of having finite order. A large part of infinite group theory is concerned with finiteness properties and the relationships between them. Profinite…

Group Theory · Mathematics 2010-02-16 Colin Reid

We prove that a finite group is rational if and only if it has a set of permutation characters which separate conjugacy classes. It follows from this that a finite group is rational if and only if it has a representation as a permutation…

Group Theory · Mathematics 2019-05-21 Cecil Andrew Ellard

A finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is attained, the word $w$ is called rich. An infinite word $w$ is called rich if every finite factor of $w$ is rich. Let $w$ be a word…

Combinatorics · Mathematics 2021-01-21 Josef Rukavicka

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

Group Theory · Mathematics 2026-03-30 Alexey Talambutsa

A group $G$ is said to have dense solitary subgroups if each non-empty open interval in its subgroup lattice $L(G)$ contains a solitary subgroup. In this short note, we find all finite groups satisfying this property.

Group Theory · Mathematics 2024-12-13 Marius Tărnăuceanu

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

Group Theory · Mathematics 2021-06-30 Sesuai Y. Madanha

We prove that every profinite group in a certain class with a rational probabilistic zeta function has only finitely many maximal subgroups.

Group Theory · Mathematics 2013-12-25 Duong Hoang Dung

The article deals with profinite groups in which the centralizers are pronilpotent (CN-groups). It is shown that such groups are virtually pronilpotent. More precisely, let G be a profinite CN-group, and let F be the maximal normal…

Group Theory · Mathematics 2018-09-13 Pavel Shumyatsky

We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method…

Group Theory · Mathematics 2021-10-04 M. R. Bridson , D. B. McReynolds , A. W. Reid , R. Spitler

In the paper we characterize the class of finite solvable groups by two-variable identities in a way similar to the characterization of finite nilpotent groups by Engel identities. More precisely, a sequence of words $u_1,...,u_n,... $ is…

We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…

Group Theory · Mathematics 2009-10-21 Jeremy Macdonald

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…

We show that an element w of a free group F on n generators defines a surjective word map of PSL(2,C)^n onto PSL(2,C) unless w belongs to the second derived subgroup of F. We also describe certain words maps that are surjective on SL(2,C) x…

Group Theory · Mathematics 2015-06-30 Tatiana Bandman , Yuri G. Zarhin

We prove that every word is strongly concise in the class of compact $R$-analytic groups.

Group Theory · Mathematics 2025-09-19 Andoni Zozaya

We find a lower bound to the size of finite groups detecting a given word in the free group, more precisely we construct a word w_n of length n in non-abelian free groups with the property that w_n is the identity on all finite quotients of…

Group Theory · Mathematics 2011-05-19 Martin Kassabov , Francesco Matucci

Let G be a finitely presented group, and let p be a prime. Then G is 'large' (respectively, 'p-large') if some normal subgroup with finite index (respectively, index a power of p) admits a non-abelian free quotient. This paper provides a…

Group Theory · Mathematics 2007-05-23 Marc Lackenby
‹ Prev 1 3 4 5 6 7 10 Next ›