A Lower Bound for the Diameter of Cayley Graph of the Symmetric Group $S_n$ Generated by $(12), (12 \dots n), (1n \dots 2)$

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Antiufeev, Grigorii
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914504263073792
author Antiufeev, Grigorii
author_facet Antiufeev, Grigorii
contents Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the identity element $()$ is the element $s = [n\ n-1 \dots 1]$. In the present work, we obtain a lower bound on the decomposition complexity of elements $s(1n \dots 2)^{i}$ into the generators $(12), (12 \dots n), (1n \dots 2)$, where $i$ ranges over the set $\{1,2,\dots,n\}$. As a consequence, we derive the lower bound $n(n-1)/2$ for the diameter of Cayley graph of the group $S_n$ generated by $(12), (12 \dots n), (1n \dots 2)$.
format Preprint
id arxiv_https___arxiv_org_abs_2601_08715
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle A Lower Bound for the Diameter of Cayley Graph of the Symmetric Group $S_n$ Generated by $(12), (12 \dots n), (1n \dots 2)$
Antiufeev, Grigorii
Combinatorics
Group Theory
20B30 (Primary) 05C25 (Secondary)
Let us denote elements of the symmetric group $S_n$ using square brackets for the one-line notation. Cycles will be represented using parentheses, following the standard cycle notation. Under this convention, the full reversal of the identity element $()$ is the element $s = [n\ n-1 \dots 1]$. In the present work, we obtain a lower bound on the decomposition complexity of elements $s(1n \dots 2)^{i}$ into the generators $(12), (12 \dots n), (1n \dots 2)$, where $i$ ranges over the set $\{1,2,\dots,n\}$. As a consequence, we derive the lower bound $n(n-1)/2$ for the diameter of Cayley graph of the group $S_n$ generated by $(12), (12 \dots n), (1n \dots 2)$.
title A Lower Bound for the Diameter of Cayley Graph of the Symmetric Group $S_n$ Generated by $(12), (12 \dots n), (1n \dots 2)$
topic Combinatorics
Group Theory
20B30 (Primary) 05C25 (Secondary)
url https://arxiv.org/abs/2601.08715