Distinguishing extension numbers for $\mathbf R^n$ and $S^n$
Alex Lombardi

TL;DR
This paper calculates the distinguishing extension number for certain geometric and combinatorial structures, resolving some conjectures and disproving others, thereby advancing understanding of symmetry-breaking colorings.
Contribution
It explicitly computes the distinguishing extension number for circles and cycle vertices, and provides bounds and counterexamples for Euclidean spaces, addressing open conjectures in the field.
Findings
Computed extension numbers for $S^1$ and cycle vertices.
Proved finiteness of extension number for $ ext{R}^2$ with $SE(2)$.
Disproved conjectures for $ ext{R}^n$ and $S^{n-1}$ with their isometry groups.
Abstract
In the setting of a group acting faithfully on a set , a -coloring is called -distinguishing if the only element of that fixes is the identity element. The distinguishing number is the minimum value of such that a -distinguishing -coloring of exists. Now, fixing , a subset with trivial pointwise stabilizer satisfies the precoloring extension property if every precoloring can be extended to a -distinguishing -coloring of . The distinguishing extension number is then defined to be the minimum such that for all applicable , implies that holds. In this paper, we compute in two particular instances: when is the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Photochromic and Fluorescence Chemistry
