A note on the shortest law for the symmetric group
Combinatorics
2026-07-09 v1 Group Theory
Abstract
Let denote the length of the shortest non-trivial two-variable law for the symmetric group . Buskin's quantitative subgroup-separability argument gives the classical lower bound . In this short note we give an improvement by proving that .
Cite
@article{arxiv.2607.08557,
title = {A note on the shortest law for the symmetric group},
author = {Adrian Beker and Luka Milićević and Rudi Mrazović},
journal= {arXiv preprint arXiv:2607.08557},
year = {2026}
}
Comments
9 pages, 1 figure