Skip to main content
SpringerLink
Log in

How Fast Can We Compute Orbits of Groups?

  • Conference paper
  • First Online:
Mathematical Software – ICMS 2018 (ICMS 2018)

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

Included in the following conference series:

Abstract

Many problems in Combinatorics and related fields reduce to the problem of computing orbits of groups acting on finite sets. One of the techniques is known under the name Snakes and Ladders. We offer the alternate name poset classification algorithm. We will describe this technique and compare the performance on example problems.

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 EPUB and 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

References

  1. Al-Azemi, A., Betten, A., Chowdhury, S.R.: A rainbow clique search algorithm for BLT-sets. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 71–79. Springer, Cham (2018)

    Google Scholar 

  2. Bamberg, J., Betten, A., Cara, Ph., De Beule, J., Lavrauw, M., Neunhöffer, M.: Finite Incidence Geometry. FinInG - a GAP package, version 1.4 (2017)

    Google Scholar 

  3. Betten, A.: Classifying discrete objects with orbiter. ACM Commun. Comput. Algebra 47(3/4), 183–186 (2014). https://doi.org/10.1145/2576802.2576832

    Article  Google Scholar 

  4. Betten, A.: Orbiter - a program to classify discrete objects (2016–2018). https://github.com/abetten/orbiter

  5. Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes, Classification by Isometry and Applications. Algorithms and Computation in Mathematics, vol. 18. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-31703-1

    Book  MATH  Google Scholar 

  6. Betten, A.: Rainbow cliques and the classification of small BLT-sets. In: Kauers, M. (ed.) ISSAC 2013, 26–29 June 2013, Boston, Massachusetts, pp. 53–60 (2013)

    Google Scholar 

  7. Betten, A., Hirschfeld, J.W.P., Karaoglu, F.: Classification of cubic surfaces with twenty-seven lines over the finite field of order thirteen. Eur. J. Math. 4(1), 37–50 (2018)

    Article  MathSciNet  Google Scholar 

  8. Betten, A., Karaoglu, F.: Cubic surfaces over small finite fields. Submitted to Designs, Codes and Cryptography

    Google Scholar 

  9. Betten, A.: Classifying cubic surfaces over finite fields using orbiter. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 55–61. Springer, Cham (2018)

    Google Scholar 

  10. Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24, 235–265 (1997)

    Article  MathSciNet  Google Scholar 

  11. Braun, M.: Some new designs over finite fields. Bayreuth. Math. Schr. 74, 58–68 (2005)

    MathSciNet  MATH  Google Scholar 

  12. The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.8.10 (2018). https://www.gap-system.org

  13. Kaski, P., Östergård, P.: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol. 15. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-28991-7

    Book  Google Scholar 

  14. Koch, M.: Neue Strategien zur Lösung von Isomorphieproblemen. (German) [New strategies for the solution of isomorphism problems] Ph.D. thesis. University of Bayreuth (2015)

    Google Scholar 

  15. Leon, J.S.: Partitions, refinements, and permutation group computation. In: Groups and Computation, II (New Brunswick, NJ, 1995), vol. 28. DIMACS Series Discrete Mathematics Theoretical Computer Science, pp. 123–158. American Mathematical Society, Providence (1997)

    Google Scholar 

  16. McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306–324 (1998)

    Article  MathSciNet  Google Scholar 

  17. McKay, B.D., Piperno, A.: Practical graph isomorphism II. J. Symbolic Comput. 60, 94–112 (2014). https://doi.org/10.1016/j.jsc.2013.09.003

    Article  MathSciNet  MATH  Google Scholar 

  18. Schmalz, B.: Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen. (German) [Use of subgroup ladders for the determination of double cosets]. Bayreuth. Math. Schr. 31, 109–143 (1990)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Colorado State University, Fort Collins, USA

    Anton Betten

Authors
  1. Anton Betten
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anton Betten .

Editor information

Editors and Affiliations

  1. University of Bath, Bath, United Kingdom

    James H. Davenport

  2. Johannes Kepler University, Linz, Austria

    Manuel Kauers

  3. University of Waterloo, Waterloo, Ontario, Canada

    George Labahn

  4. Czech Technical University in Prague, Prague 6, Czech Republic

    Josef Urban

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Betten, A. (2018). How Fast Can We Compute Orbits of Groups?. In: Davenport, J., Kauers, M., Labahn, G., Urban, J. (eds) Mathematical Software – ICMS 2018. ICMS 2018. Lecture Notes in Computer Science(), vol 10931. Springer, Cham. https://doi.org/10.1007/978-3-319-96418-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-96418-8_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-96417-1

  • Online ISBN: 978-3-319-96418-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation