Papers › Graph-theoretical estimates of the diameters of the Rubik's Cube groups
Graph-theoretical estimates of the diameters of the Rubik's Cube groups
So Hirata
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
A strict lower bound for the diameter of a symmetric graph is proposed, which is calculable with the order n and other local parameters of the graph such as the degree k (≥3), even girth g (≥4), and number of g-cycles traversing a vertex, which are easily determined by inspecting a small portion of the graph (unless the girth is large). It is applied to the symmetric Cayley graphs of some Rubik's Cube groups of various sizes and metrics, yielding slightly tighter lower bounds of the diameters than those for random k-regular graphs proposed by Bollob\'{a}s and de la Vega. They range from 60% to 77% of the correct diameters of large-n graphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections