Skip to main content
SpringerLink
Log in

On the Effectiveness of Symmetry Breaking

  • Conference paper
Book cover Language, Life, Limits (CiE 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8493))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Imrich, W., Klavzar, S., Trofimov, V.: Distinguishing infinite graphs. Electronic Journal of Combinatorics 14, #R36 (2007)

    Google Scholar 

  2. Harizanov, V., Miller, R., Morozov, A.: Simple structures with complex symmetry. Algebra and Logic 49, 51–67 (2010)

    Article  MathSciNet  Google Scholar 

  3. Lempp, S., McCoy, C., Miller, R.G., Solomon, R.: Computable categoricity of trees of finite height. Journal of Symbolic Logic 70, 151–215 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  4. Miller, R.G.: The computable dimension of trees of infinite height. Journal of Symbolic Logic 70, 111–141 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Smith, S.M., Watkins, M.E.: Bounding the distinguishing number of infinite graphs (submitted for publication)

    Google Scholar 

  6. Smith, S.M., Tucker, T.W., Watkins, M.E.: Distinguishability of infinite groups and graphs. Electronic Journal of Combinatorics 19, #R27 (2012)

    Google Scholar 

  7. Steiner, R.M.: Effective algebraicity. Archive for Mathematical Logic 52, 91–112 (2013)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queens College and the Graduate Center of the City University of New York, Flushing, NY, 11367, USA

    Russell Miller

  2. University of Connecticut, USA, Storrs, CT, 06269

    Reed Solomon

  3. Vanderbilt University, USA, Nashville, TN, 37240

    Rebecca M. Steiner

Authors
  1. Russell Miller
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reed Solomon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rebecca M. Steiner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. College of Science, Department of Computer Science, Swansea University, SA2 8PP, Swansea, UK

    Arnold Beckmann

  2. Department of Algorithms and Their Applications, Eötvös Loránd University, Pázmány Péter sétány 1/c,, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  3. Computer Science Institute, Brandenburg University of Technology Cottbus-Senftenberg, Cottbus, Germany

    Klaus Meer

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation