Metraipolis › archive › dc_714e4dafb24e

The Borel Distinguishing Number of Schreier Graphs — arXiv:2609.15003

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.15003
License (as archived)
CC0-1.0
Archived
2026-10-16T01:25:50.166Z
SHA-256 of the archived text
596a088e850126bef38339d077dd361ffe86db1e5079b4f5a2497d02a1c19fd2
Stable URL of this page
https://metraipolis.com/documento/dc_714e4dafb24e

How to cite

The Borel Distinguishing Number of Schreier Graphs — arXiv:2609.15003 — arXiv (en), https://arxiv.org/abs/2609.15003 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_714e4dafb24e (Metraipolis archive dc_714e4dafb24e, sha256 596a088e850126bef38339d077dd361ffe86db1e5079b4f5a2497d02a1c19fd2)
BibTeX
@misc{dc714e4dafb24e,
  title = {The Borel Distinguishing Number of Schreier Graphs — arXiv:2609.15003},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.15003},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_714e4dafb24e; sha256 596a088e850126bef38339d077dd361ffe86db1e5079b4f5a2497d02a1c19fd2},
  year = {2026}
}

Archived text

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

The Borel distinguishing number $D_B(\mathcal{G})$ of a Borel graph $\mathcal{G}$, recently introduced by Bilge and Kaya, is the minimum number of colors required to break the symmetry of $\mathcal{G}$ in a Borel way. In this paper, we investigate the Borel distinguishing number of Schreier graphs induced by the free part of the shift action $\Gamma \curvearrowright n^\Gamma$. We prove that $D_B(\mathcal{G})\le n+1$ for $\Gamma=\mathbb{Z}^d$ equipped with the standard generators. Moreover, we show that $D_B(\mathcal{G})\ge n+1$ if $ \Gamma$ is amenable and $ \{\gamma \in \mathrm{Aut}(\mathrm{Cay}(\Gamma,S)) \mid \gamma(e) = e \}$ is non-trivial. We also show that $D_B(\mathcal{G})$ is finite if $\Gamma$ is finitely generated, and give some applications of our results. These results answer some questions raised by Bilge and Kaya.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Logic (math.LO) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.15003 — 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-10-16T00:39:30.299Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).