Metraipolis › archive › dc_dcc806e1979d

Distinguishing invariants of Cayley Graphs, Hamming graphs, and wreath product actions — arXiv:2611.07497

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07497
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:45.326Z
SHA-256 of the archived text
e4149a36585bfdc7cdc9b2cfdb5bf19df409d20019670d8c61d1e7afc4ca27ef
Stable URL of this page
https://metraipolis.com/documento/dc_dcc806e1979d

How to cite

Distinguishing invariants of Cayley Graphs, Hamming graphs, and wreath product actions — arXiv:2611.07497 — arXiv (en), https://arxiv.org/abs/2611.07497 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dcc806e1979d (Metraipolis archive dc_dcc806e1979d, sha256 e4149a36585bfdc7cdc9b2cfdb5bf19df409d20019670d8c61d1e7afc4ca27ef)
BibTeX
@misc{dcdcc806e1979d,
  title = {Distinguishing invariants of Cayley Graphs, Hamming graphs, and wreath product actions — arXiv:2611.07497},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07497},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dcc806e1979d; sha256 e4149a36585bfdc7cdc9b2cfdb5bf19df409d20019670d8c61d1e7afc4ca27ef},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07497. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $\Gamma$ be a nontrivial group that acts on a graph $G=(V,E)$. The total distinguishing number $D''_{\Gamma}(V\cup E)$ (distinguishing index $D'_{\Gamma}(E)$) of the action is the least number of labels required for a total labeling (edge labeling) of $G$ so that the only elements of $\Gamma$ that preserve the labeling belong to the pointwise stabilizer of $V\cup E$ (pointwise stabilizer of $E$). We obtain upper bounds of these invariants for Cayley graphs and under various group actions, including free actions, wreath product actions, and coordinatewise actions on Cartesian powers of graphs. Our first main result shows that, if $\Gamma$ acts faithfully on $G$, with $|V|\geq 2, |E|\geq 1$ and the natural action of the wreath product $W=\Gamma\wr S_k$ on $V^k$ induces an action of $W$ on the Cartesian power $G^{k}=(V^{k},E_k)$, then $ D''_{W}(V^k\cup E_k)\le D''_{\Gamma}(V\cup E)+k-1 $ for any $k\geq 2$. We also establish the sharpness of several of our bounds through examples involving cyclic, symmetric, and alternating groups. Moreover, we determine these distinguishing invariants for the symmetric group action on Hamming graphs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Group Theory (math.GR).
Pagina del lavoro: https://arxiv.org/abs/2611.07497 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:27.842Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).