English
Related papers

Related papers: On conciseness of words in profinite groups

200 papers

A soluble pro-p group of finite rank is finitely axiomatizable in the class of all profinite groups if and only if for each open subgroup H, the image of Z(H) in the abelianization of H is finite, subject to some suitable hypothesis of…

Group Theory · Mathematics 2023-03-28 Dan Segal

L\'evai and Pyber proposed the following as a conjecture: Let $G$ be a profinite group such that the set of solutions of the equation $x^n=1$ has positive Haar measure. Then $G$ has an open subgroup $H$ and an element $t$ such that all…

Group Theory · Mathematics 2021-04-12 Alireza Abdollahi , Meisam Soleimani Malekan

It is proved that a profinite group $G$ has fewer than $2^{\aleph_0}$ conjugacy classes of $p$-elements for an odd prime $p$ if and only if its $p$-Sylow subgroups are finite. (Here, by a $p$-element one understands an element that either…

Group Theory · Mathematics 2022-09-30 John S. Wilson

We prove that if $G$ is a finite simple group of Lie type and $S$ a subset of $G$ of size at least two then $G$ is a product of at most $c\log|G|/\log|S|$ conjugates of $S$, where $c$ depends only on the Lie rank of $G$. This confirms a…

Group Theory · Mathematics 2012-05-18 Nick Gill , László Pyber , Ian Short , Endre Szabó

We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…

Group Theory · Mathematics 2014-10-24 Doron Puder , Ori Parzanchevski

We study equations in groups G with unique m-th roots for each positive integer m. A word equation in two letters is an expression of the form w(X,A) = B, where w is a finite word in the alphabet {X,A}. We think of A,B in G as fixed…

Group Theory · Mathematics 2014-02-26 Christopher J. Hillar , Lionel Levine , Darren Rhea

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

Group Theory · Mathematics 2021-06-30 Sesuai Y. Madanha , Bernardo G. Rodrigues

Let $G$ be a finite group. We show that the order of the subgroup generated by coprime $\gamma_k$-commutators (respectively $\delta_k$-commutators) is bounded in terms of the size of the set of coprime $\gamma_k$-commutators (respectively…

Group Theory · Mathematics 2019-02-20 Cristina Acciarri , Pavel Shumyatsky , Anitha Thillaisundaram

Given a group $G$ and elements $x_1,x_2,\dots, x_\ell\in G$, the commutator of the form $[x_1,x_2,\dots, x_\ell]$ is called a commutator of length $\ell$. The present paper deals with groups having only finitely many commutators of length…

Group Theory · Mathematics 2025-04-15 Iker de las Heras , Federico Di Concilio , Pavel Shumyatsky

Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are…

Group Theory · Mathematics 2015-03-26 P. Shumyatsky , A. Tortora , M. Tota

A group is said to have the Magnus Property (MP) if whenever two elements have the same normal closure then they are conjugate or inverse-conjugate. We show that a profinite MP group $G$ is prosolvable and any quotient of it is again MP. As…

Group Theory · Mathematics 2024-12-12 Claude Marion , Pavel Zalesskii

We define a word in two positive definite (complex Hermitian) matrices $A$ and $B$ as a finite product of real powers of $A$ and $B$. The question of which words have only positive eigenvalues is addressed. This question was raised some…

Operator Algebras · Mathematics 2007-05-23 Christopher Hillar , Charles R. Johnson

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

Group Theory · Mathematics 2021-10-27 Emmanuel Rauzy

A conjecture of Rosenberger says that a group of the form $\langle x,y|x^p=y^q=W(x,y)^r=1\rangle$ (with $r>1$) is either virtually solvable or contains a non-abelian free subgroup. This note is an account of an attack on the conjecture in…

Group Theory · Mathematics 2024-05-24 James Howie

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

Group Theory · Mathematics 2010-12-09 A. Myasnikov , D. Osin

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

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

Group Theory · Mathematics 2015-01-08 Martin R. Bridson

Let R be any ring (with 1), \Gamma a group and R\Gamma the corresponding group ring. Let H be a subgroup of \Gamma of finite index. Let M be an R\Gamma -module, whose restriction to RH is projective. Moore's conjecture: Assume for every…

Group Theory · Mathematics 2007-05-23 Eli Aljadeff

We prove that bounded conciseness is a closed property in the space of marked groups. As a consequence, we reformulate a conjecture of Fern\'andez-Alcober and Shumyatsky [7] about conciseness in the class of residually finite groups.

Group Theory · Mathematics 2025-02-10 Federico Berlai

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
‹ Prev 1 4 5 6 7 8 10 Next ›