Mathematics > Combinatorics
[Submitted on 3 Aug 2018 (v1), last revised 7 Apr 2019 (this version, v2)]
Title:Distinguishing Numbers and Generalizations
View PDFAbstract:The distinguishing number of a graph was introduced by Albertson and Collins as a measure of the amount of symmetry contained in the graph. Tymoczko extended this definition to faithful group actions on sets; taking the set to be the vertex set of a graph and the group to be the automorphism group of the graph allows one to recover the previous definition. Since then, several authors have studied properties of the distinguishing number as well as extensions of the notion. In this paper, we first answer a few open questions regarding the distinguishing number. Next we turn to generalizations regarding the labeling of Cartesian powers of a set and the different subgroups that can be obtained through labelings. We then introduce a new partially ordered set on partitions that follows naturally from extending the theory of distinguishing numbers to that of distinguishing partitions. Then we investigate the groups obtainable from partitioning Cartesian powers of a set in more detail and show how the original notion of the distinguishing number of a graph can be recovered in this way. Next, we introduce a polynomial and a symmetric function generalization of the distinguishing number. Finally, we present a large number of open questions and problems for further research.
Submission history
From: Caleb Ji [view email][v1] Fri, 3 Aug 2018 03:14:33 UTC (16 KB)
[v2] Sun, 7 Apr 2019 01:41:21 UTC (17 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.