English

On Some Problems from the Kourovka Notebook

Group Theory 2026-07-20 v1 Combinatorics

Abstract

The Kourovka Notebook is a long-running collection of open problems in group theory. In this paper we present solutions to eight of its problems. We construct a group with exactly two maximal locally soluble normal subgroups and show that, for every 1kn!1 \le k\le n!, there is a group containing nn distinct elements whose n!n! ordered products take exactly kk distinct values. We also give examples showing that group order together with the statistic gφ(g)\sum_g\varphi(\lvert g\rvert) does not determine simplicity, and we construct a surjective non-injective Rota-Baxter operator on a non-abelian group. Further, we determine the group generated by the class transpositions of moduli at most kk, prove that every power graph of a finite group that is a cograph is chordal, show that the right-relatively convex subgroups of a right-orderable group need not form a sublattice of its subgroup lattice, and disprove a proposed rank inequality for certain pp-group extensions. All of these solutions were autonomously discovered and formally verified in Lean by Aristotle, a formal reasoning agent developed by Harmonic.

Cite

@article{arxiv.2607.17477,
  title  = {On Some Problems from the Kourovka Notebook},
  author = {Wouter van Doorn and Elias Judin and Pietro Monticone and Daniel Morrison},
  journal= {arXiv preprint arXiv:2607.17477},
  year   = {2026}
}

Comments

21 pages