Abstract
Symmetry breaking involves coloring the elements of a structure so that the only automorphism which respects the coloring is the identity. We investigate how much information we would need to be able to compute a 2-coloring of a computable finite-branching tree under the predecessor function which eliminates all automorphisms except the trivial one; we also generalize to n-colorings for fixed n and for variable n.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Imrich, W., Klavzar, S., Trofimov, V.: Distinguishing infinite graphs. Electronic Journal of Combinatorics 14, #R36 (2007)
Harizanov, V., Miller, R., Morozov, A.: Simple structures with complex symmetry. Algebra and Logic 49, 51–67 (2010)
Lempp, S., McCoy, C., Miller, R.G., Solomon, R.: Computable categoricity of trees of finite height. Journal of Symbolic Logic 70, 151–215 (2005)
Miller, R.G.: The computable dimension of trees of infinite height. Journal of Symbolic Logic 70, 111–141 (2005)
Smith, S.M., Watkins, M.E.: Bounding the distinguishing number of infinite graphs (submitted for publication)
Smith, S.M., Tucker, T.W., Watkins, M.E.: Distinguishability of infinite groups and graphs. Electronic Journal of Combinatorics 19, #R27 (2012)
Steiner, R.M.: Effective algebraicity. Archive for Mathematical Logic 52, 91–112 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Miller, R., Solomon, R., Steiner, R.M. (2014). On the Effectiveness of Symmetry Breaking. In: Beckmann, A., Csuhaj-Varjú, E., Meer, K. (eds) Language, Life, Limits. CiE 2014. Lecture Notes in Computer Science, vol 8493. Springer, Cham. https://doi.org/10.1007/978-3-319-08019-2_32
Download citation
DOI: https://doi.org/10.1007/978-3-319-08019-2_32
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08018-5
Online ISBN: 978-3-319-08019-2
eBook Packages: Computer ScienceComputer Science (R0)