Distinguishing invariants of Cayley Graphs, Hamming graphs, and wreath product actions

Abstract

Let Γ be a nontrivial group that acts on a graph G=(V,E). The total distinguishing number D''_Γ(V∪ E) (distinguishing index D'_Γ(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 Γ that preserve the labeling belong to the pointwise stabilizer of V∪ 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 Γ acts faithfully on G, with |V|≥ 2, |E|≥ 1 and the natural action of the wreath product W=Γ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''_Γ(V\cup E)+k-1 $ for any k≥ 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.

Support-Sensitive Bohnenblust-Hille Inequalities and Local Invariants on Hamming Schemes
Andreas Defant, Daniel Galicer, Martín Mansilla +2
arXiv (Cornell University)6 Jul 2026PreprintLicence not statedFull text10 citedGeneral mathematicsOpenAlex
Quandles from group actions and a Cayley-type embedding theorem
Ryoya Kai
arXiv22 Sep 2026PreprintCC BY-NC-SA 4.0Full textAlgebra & number theory Geometry & topologyarXiv
Counting Invariants for Torus Quotients under FPF Group Actions
Xue Zhang
arXiv23 Sep 2026PreprintarXiv licenceFull textGeometry & topologyarXiv
Selfless Reduced Crossed Product C^*-Algebras Arising from Almost Periodic Actions
Syuichi Ohshima
arXiv30 Aug 2026PreprintCC BY-NC-SA 4.0Full textAnalysis & PDEsarXiv
Intermediate subalgebras of cross-product von Neumann algebras arising from weakly compact actions
Ionut Chifan, Zachary Flood
arXiv23 Oct 2026PreprintarXiv licenceFull textAnalysis & PDEsarXiv

Cite

BibTeX RIS

BibTeX

@misc{banerjee2026distinguishing,
  title = {{Distinguishing invariants of Cayley Graphs, Hamming graphs, and wreath product actions}},
  author = {Amitayu Banerjee},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.07497},
  eprint = {2611.07497},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.07497},
  note = {CC BY 4.0},
}

RIS

TY  - UNPB
TI  - Distinguishing invariants of Cayley Graphs, Hamming graphs, and wreath product actions
AU  - Amitayu Banerjee
PY  - 2026
DA  - 2026/11/05
PB  - arXiv
DO  - 10.48550/arxiv.2611.07497
UR  - https://arxiv.org/abs/2611.07497
AB  - Let Γ be a nontrivial group that acts on a graph G=(V,E). The total distinguishing number D''_Γ(V∪ E) (distinguishing index D'_Γ(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 Γ that preserve the labeling belong to the pointwise stabilizer of V∪ 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 Γ acts faithfully on G, with |V|≥ 2, |E|≥ 1 and the natural action of the wreath product W=Γ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''_Γ(V\cup E)+k-1 $ for any k≥ 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.
ER  -

Abstract

Related

Cite