Searcharxiv⌕ Search

arXiv · 2611.13792

A congruence-group counterexample to Kourovka Problem 21.7

Abstract

For every prime $p>24$, let $H$ be the kernel of $\SL_2(\Z/p^9\Z)\to\SL_2(\F_p)$. We prove that $H$ is not IYB, whereas $H\times C_{p^8}$ is IYB. The proof excludes a pre-Lie multiplication on the rank-three Lie ring with bracket $p[x,y]$ over $\Z/p^8\Z$ using three trace identities. It follows that the supersoluble group $H\times(C_{p^8}\rtimes C_2)$, with the involution acting by inversion, has IYB Sylow subgroups and is not IYB. Its nilpotent residual is cyclic and its Sylow $p$-subgroup has nilpotency class eight. For $p=31$, an action of order three gives a supersoluble counterexample of odd order $3\cdot31^{32}$. The same construction gives an IYB $p$-group with a specified central cyclic direct factor such that the quotient of the whole group by the unique subgroup of order $p$ in that factor is non-IYB.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lü Gong. 2026-11-10. A congruence-group counterexample to Kourovka Problem 21.7. https://searcharxiv.com/abs/2611.13792

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Algorithms for experimenting with Zariski dense matrix groups over number fields

Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to find the set of congruence quotients of $H$ modulo all maximal ideals of a finitely generated subring $R$ of $\mathbb{P}$ such that $H\leq \mathrm{SL}(n,R)$. The algorithms have been implemented in GAP. Potential applications are illustrated by a range of experiments in degree $2$, with a special focus on Bianchi groups.

math.GR↗

Two problems about bases and independent sets in free groups

We will answer a problem of Dotsenko that asks for a tight upper bound on the rank of subgroups given a maximum length for its generators. Then, we will use the same tools to answer a longstanding problem of Grigorchuk in the 10th edition of the Kourovka notebook. We accomplish this using Stallings foldings and simple graph theory.

math.GR↗