SearcharxivSearch

arXiv · 2609.26228

Finite Soluble Groups Need Not Admit Increasing Unrefinable Subgroup Chains

Abstract

In correspondence beginning on August 8, 2026, V. S. Monakhov and I. L. Sokhor communicated the following question to the author: does every finite group have an unrefinable chain of subgroups whose successive indices are nondecreasing? We answer this question in the negative, even among soluble groups. For every odd prime p, we construct a soluble matrix group of degree five over the field with p elements. The group has order 64 times the eighth power of p and has no such chain. These counterexamples form an infinite family whose smallest member, obtained when p equals three, has order 419904. The construction is based on an example due to Kohler, and the obstruction follows from three elementary calculations of maximal subgroup indices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Richie Sater. 2026-08-11. Finite Soluble Groups Need Not Admit Increasing Unrefinable Subgroup Chains. https://arxiv.org/abs/2609.26228

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Margulis-Soifer theorem for one-relator groups

We establish the Margulis-Soifer dichotomy for one-relator groups: every one-relator group is either virtually solvable or has a maximal subgroup of infinite index. We also present examples of one-relator groups with and without free maximal subgroups of infinite index, as well as examples that possess both free and non-free infinite index maximal subgroups. Triviality of the Frattini subgroup is also shown for all non-solvable one-relator groups. We close the paper with a short list of questions.

math.GR

Finite quotients of spherical Artin groups

We show the smallest non-abelian quotients of spherical and affine Artin groups are isomorphic to the smallest non-abelian quotients of the corresponding Coxeter groups. We deduce irreducible spherical Artin groups are determined by their finite quotient groups.

math.GR

Cosets with constant characteristic polynomial

Let H be a linear group. We show that if there is an invertible matrix x such that all the elements of xH share the same characteristic polynomial then H is virtually solvable. There are plenty of applications that will be presented in future paper. Here, we discuss some applications to the generalized Weigold conjecture and present an alternative straightforward proof of the Formanek--Procesi nonlinearity theorem for Aut(F_n), n>2, over every field. When n>5 our non-linearity proof gives a stronger result than the original Formanek--Procesi theorem.

math.GR