English
Related papers

Related papers: Strong conciseness in profinite groups

200 papers

Suppose $R$ is a profinite ring. We construct a large class of profinite groups $\widehat{{\scriptstyle\bf L}'{\scriptstyle\bf H}_R}\mathfrak{F}$, including all soluble profinite groups and profinite groups of finite cohomological dimension…

Group Theory · Mathematics 2014-12-08 Ged Corob Cook

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

We give experimental support for a conjecture of Louder and Wilton saying that words of imprimitivity rank greater than two yield hyperbolic one-relator groups.

Group Theory · Mathematics 2023-11-27 Christopher H. Cashen , Charlotte Hoffmann

If a finite group G has a presentation with d generators and r relations, it is well-known that r - d is at least the rank of the Schur multiplier of G; a presentation is called efficient if equality holds. There is an analogous definition…

Group Theory · Mathematics 2009-05-05 R. M. Guralnick , W. M. Kantor , M. Kassabov , A. Lubotzky

We say that a class of finite structures for a finite first-order signature is $r$-compressible if each structure $G$ in the class has a first-order description of size at most $O(r(|G|))$. We show that the class of finite simple groups is…

Logic · Mathematics 2016-04-29 Andre Nies , Katrin Tent

We show that a compact group $G$ has finite conjugacy classes, i.e., is an FC-group if and only if its center $Z(G)$ is open if and only if its commutator subgroup $G'$ is finite. Let $d(G)$ denote the Haar measure of the set of all pairs…

Group Theory · Mathematics 2012-06-20 Karl H. Hofmann , Francesco G. Russo

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

We give new and improved results on the freeness of subgroups of free profinite groups: A subgroup containing the normal closure of a finite word in the elements of a basis is free; Every infinite index subgroup of a finitely generated…

Group Theory · Mathematics 2017-05-17 Mark Shusterman

We prove that every small profinite group can be decomposed into a direct product of indecomposable profinite groups, and that such a decomposition is unique up to order and isomorphisms of the components. We also investigate the…

Group Theory · Mathematics 2024-12-11 Tamar Bar-On , Nikolay Nikolov

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina

Finitely generated (non-abelian) free metabelian pro-p groups, and wreath products of f.g. free abelian pro-p groups, are all finitely axiomatizable in the class of all profinite groups.

Group Theory · Mathematics 2023-03-28 Dan Segal

The complex algebra of an inverse semigroup with finitely many idempotents in each $\mathcal D$-class is stably finite by a result of Munn. This can be proved fairly easily using $C^*$-algebras for inverse semigroups satisfying this…

Group Theory · Mathematics 2022-07-25 Pedro V. Silva , Benjamin Steinberg

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

A word is called closed if it has a prefix which is also its suffix and there is no internal occurrences of this prefix in the word. In this paper we study words that are rich in closed factors, i.e., which contain the maximal possible…

Combinatorics · Mathematics 2023-01-05 Olga Parshina , Svetlana Puzynina

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

Group Theory · Mathematics 2007-05-23 J. -C. Birget , A. Yu. Olshanskii , E. Rips , M. Sapir

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 $w\in\mathbf F_k$ be a non-trivial word and denote by $w(G)\subseteq G$ the image of the associated word map $w\colon G^k\to G$. Let $G$ be one of the finite groups ${\rm S}_n,{\rm GL}_n(q),{\rm Sp}_{2m}(q),{\rm GO}_{2m}^\pm(q),{\rm…

Group Theory · Mathematics 2023-04-03 Jakob Schneider , Andreas Thom

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 describe solutions of the equation $x^ny^m=a^nb^m$ in acylindrically hyperbolic groups (AH-groups), where $a,b$ are non-commensurable special loxodromic elements and $n,m$ are integers with sufficiently large common divisor. Using this…

Group Theory · Mathematics 2019-03-20 Oleg Bogopolski

Let $G$ be a non-elementary hyperbolic group. Let $w$ be a group word such that the set $w[G]$ of all its values in $G$ does not coincide with $G$ or 1. We show that the width of verbal subgroup $w(G)=<w[G]>$ is infinite. That is, there is…

Group Theory · Mathematics 2014-08-29 Alexei Myasnikov , Andrey Nikolaev