Graph-theoretical estimates of the diameters of the Rubik's Cube groups

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Hirata, So
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914961706450944
author Hirata, So
author_facet Hirata, So
contents 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\,(\geq 3)$, even girth $g\,(\geq 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ás and de la Vega. They range from 60% to 77% of the correct diameters of large-$n$ graphs.
format Preprint
id arxiv_https___arxiv_org_abs_2407_12961
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Graph-theoretical estimates of the diameters of the Rubik's Cube groups
Hirata, So
Combinatorics
Discrete Mathematics
Group Theory
Probability
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\,(\geq 3)$, even girth $g\,(\geq 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ás and de la Vega. They range from 60% to 77% of the correct diameters of large-$n$ graphs.
title Graph-theoretical estimates of the diameters of the Rubik's Cube groups
topic Combinatorics
Discrete Mathematics
Group Theory
Probability
url https://arxiv.org/abs/2407.12961