Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 167 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 33 tok/s Pro
GPT-5 High 40 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 193 tok/s Pro
GPT OSS 120B 425 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Distinguishing extension numbers for $\mathbf R^n$ and $S^n$ (1408.5849v1)

Published 25 Aug 2014 in math.CO and math.MG

Abstract: In the setting of a group $\Gamma$ acting faithfully on a set $X$, a $k$-coloring $c: X\rightarrow {1, 2, ..., k}$ is called $\Gamma$-distinguishing if the only element of $\Gamma$ that fixes $c$ is the identity element. The distinguishing number $D_\Gamma(X)$ is the minimum value of $k$ such that a $\Gamma$-distinguishing $k$-coloring of $X$ exists. Now, fixing $k= D_\Gamma(X)$, a subset $W\subset X$ with trivial pointwise stabilizer satisfies the precoloring extension property $P(W)$ if every precoloring $c: X-W\rightarrow {1, ..., k}$ can be extended to a $\Gamma$-distinguishing $k$-coloring of $X$. The distinguishing extension number $\text{ext}_D(X, \Gamma)$ is then defined to be the minimum $n$ such that for all applicable $W\subset X$, $|W|\geq n$ implies that $P(W)$ holds. In this paper, we compute $\text{ext}_D(X, \Gamma)$ in two particular instances: when $X = S1$ is the unit circle and $\Gamma = \text{Isom}(S1) = O(2)$ is its isometry group, and when $X = V(C_n)$ is the set of vertices of the cycle of order $n$ and $\Gamma = \text{Aut}(C_n) = D_n$, the dihedral group of a regular $n$-gon. This resolves two conjectures of Ferrara, Gethner, Hartke, Stolee, and Wenger. In the case of $X=\mathbf R2$, we prove that $\text{ext}_D(\mathbf R2, SE(2))<\infty$, 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\geq 3$, $\text{ext}_D(S{n-1}, O(n)) = \infty$, and for all $n\geq 3$, $\text{ext}_D(\mathbf Rn, E(n))=\infty$, disproving two other conjectures from the same authors.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.