Distinguishing extension numbers for Rn and Sn

Abstract

In the setting of a group acting faithfully on a set X, a k-coloring c: X→ \1, 2, ..., k\ is called -distinguishing if the only element of that fixes c is the identity element. The distinguishing number D(X) is the minimum value of k such that a -distinguishing k-coloring of X exists. Now, fixing k= D(X), a subset W⊂ X with trivial pointwise stabilizer satisfies the precoloring extension property P(W) if every precoloring c: X-W→ \1, ..., k\ can be extended to a -distinguishing k-coloring of X. The distinguishing extension number extD(X, ) is then defined to be the minimum n such that for all applicable W⊂ X, |W|≥ n implies that P(W) holds. In this paper, we compute extD(X, ) in two particular instances: when X = S1 is the unit circle and = Isom(S1) = O(2) is its isometry group, and when X = V(Cn) is the set of vertices of the cycle of order n and = Aut(Cn) = Dn, the dihedral group of a regular n-gon. This resolves two conjectures of Ferrara, Gethner, Hartke, Stolee, and Wenger. In the case of X= R2, we prove that extD( R2, SE(2))<∞, which is consistent with (but does not resolve) another conjecture of Ferrara et al. On the other hand, we also prove that for all n≥ 3, extD(Sn-1, O(n)) = ∞, and for all n≥ 3, extD( Rn, E(n))=∞, disproving two other conjectures from the same authors.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…