Hexagon

math.GR — Group Theory

Soluble subgroup pairs in symmetric and alternating groups

Contributed by Qiyue Tang

We prove that every pair of soluble subgroups of the symmetric group $S_n$ or the alternating group $A_n$ has trivially intersecting conjugates whenever $n\ge21$ . This answers the second question of Anagnostopoulou-Merkouri and Burness in Problem 21.3 of the Kourovka Notebook.

A mix of human-written and AI-generated textHuman understanding: some parts

Nov 03, 2026PDF ↗View work →

hexagon:2611.00039v1

math.CO — Combinatorics

Exact diameter of the symmetric group with LX generators

Contributed by Sergei Uskov, Alexander Chervov, Fedor Levkovich-Maslyuk, Ivan Litvak, Andrei Smolensky, Alexander Soibelman

We prove an exact formula for the diameter of the directed Cayley graph for the symmetric group $S_n$ with generators $L$ (left cyclic shift) and $X$ (exchange of the first two elements). For every $n \geq 5$ , we show that the diameter equals $(3n^2-8n+12)/4$ for even $n$ and $(3n^2-8n+9)/4$ for odd $n$ . This resolves a longstanding question first proposed in the 1960's and refined in more recent work. The proof is AI-assisted and is based on a variety of combinatorial arguments. We also describe the agentic system we developed that led to this proof and looks highly promising for attacking other questions of this type. An accompanying Lean 4 formalization rigorously verifies the result.

A mix of human-written and AI-generated textHuman understanding: some partsCayley graphsGlushkov conjectureLean 4directed diameterformal verificationsymmetric groups

Nov 03, 2026PDF ↗View work →

Matching works

Soluble subgroup pairs in symmetric and alternating groups

Exact diameter of the symmetric group with LX generators

Advanced search

math.AC — Commutative Algebra
math.AG — Algebraic Geometry
math.AP — Analysis of PDEs
math.AT — Algebraic Topology
math.CA — Classical Analysis and ODEs
math.CO — Combinatorics
math.CT — Category Theory
math.CV — Complex Variables
math.DG — Differential Geometry
math.DS — Dynamical Systems
math.FA — Functional Analysis
math.GM — General Mathematics
math.GN — General Topology
math.GR — Group Theory
math.GT — Geometric Topology
math.HO — History and Overview
math.IT — Information Theory
math.KT — K-Theory and Homology
math.LO — Logic
math.MG — Metric Geometry
math.NA — Numerical Analysis
math.NT — Number Theory
math.OA — Operator Algebras
math.OC — Optimization and Control
math.PR — Probability
math.QA — Quantum Algebra
math.RA — Rings and Algebras
math.RT — Representation Theory
math.SG — Symplectic Geometry
math.SP — Spectral Theory
math.ST — Statistics Theory
cs.AI — Artificial Intelligence
cs.CC — Computational Complexity
cs.CG — Computational Geometry
cs.DM — Discrete Mathematics
cs.DS — Data Structures and Algorithms
cs.FL — Formal Languages and Automata Theory
cs.IT — Information Theory
cs.LO — Logic in Computer Science
cs.MS — Mathematical Software
cs.NA — Numerical Analysis
cs.SC — Symbolic Computation
math-ph — Mathematical Physics
quant-ph — Quantum Physics
stat.TH — Statistics Theory