skip to main content
column

Classifying discrete objects with orbiter

Published:28 January 2014Publication History
Skip Abstract Section

Abstract

Orbiter is a software package to classify discrete objects such as designs, graphs, codes, and objects from finite geometry. It employs the method of breaking the symmetry to attack difficult problem instances by means of subobjects that serve as a stepping stone. The algorithms combine techniques from Group Theory and from Combinatorics. Orbiter is a library of C++ functions that provide functionality for Discrete Mathematics. In order to be applied to a specific problem, code has to be written taylored to the specific application.

References

  1. John Bamberg, Anton Betten, Cheryl Praeger, and Alfred Wassermann. Unitals in the Desarguesian Projective Plane of Order Sixteen. To appear in Journal of Statistical Planning and Inference.Google ScholarGoogle Scholar
  2. Anton Betten. The Packings of PG(3, 3). Submitted to Journal of Combinatorial Designs.Google ScholarGoogle Scholar
  3. Anton Betten. Rainbow Cliques and the Classification of Small BLT-Sets. Accepted for the Proceedings of ISSAC 2013. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Anton Betten, Reinhard Laue, and Alfred Wassermann. DISCRETA, a tool for constructing t-designs. In: Computer Algebra Handbook, Edited by Johannes Grabmeier, Erich Kaltofen, VolkerWeispfennig, Springer 2003, pp 372--375.Google ScholarGoogle Scholar
  5. Cynthia A. Brown, Larry Finkelstein, and Paul Walton Purdom, Jr. Backtrack searching in the presence of symmetry. In Applied algebra, algebraic algorithms and error-correcting codes (Rome, 1988), volume 357 of Lecture Notes in Comput. Sci., pages 99--110. Springer, Berlin, 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Cynthia A. Brown, Larry Finkelstein, and Paul Walton Purdom, Jr. Backtrack searching in the presence of symmetry. Nordic J. Comput., 3(3):203--219, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. J. Cameron and J. H. van Lint. Designs, graphs, codes and their links, volume 22 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. GAP -- Groups, Algorithms, and Programming, Version 4.4. The GAP Group, Aachen, Germany and St. Andrews, Scotland, 2004.Google ScholarGoogle Scholar
  9. P. Kaski and P. Östergård. Classification algorithms for codes and designs, volume 15 of Algorithms and Computation in Mathematics. Springer-Verlag, Berlin, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. E. Knuth. Dancing links. eprint arXiv:cs/0011047, November 2000. in Davies, Jim; Roscoe, Bill; Woodcock, Jim, Millennial Perspectives in Computer Science: Proceedings of the 1999 Oxford-Microsoft Symposium in Honour of Sir Tony Hoare, Palgrave, pp. 187--214.Google ScholarGoogle Scholar
  11. R. Laue. Construction of combinatorial objects---a tutorial. Bayreuth. Math. Schr., 43:53--96, 1993. Konstruktive Anwendungen von Algebra und Kombinatorik (Bayreuth, 1991).Google ScholarGoogle Scholar
  12. J.S. Leon. Partitions, refinements, and permutation group computation. In Groups and computation, II (New Brunswick, NJ, 1995), volume 28 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 123--158. Amer. Math. Soc., Providence, RI, 1997.Google ScholarGoogle Scholar
  13. Magma. The Computational Algebra Group within the School of Mathematics and Statistics of the University of Sydney, 2004.Google ScholarGoogle Scholar
  14. Nauty User's Guide (Version 2.4), Brendan McKay, Australian National University, Nov 4, 2009.Google ScholarGoogle Scholar
  15. Orbiter -- A Program To Classify Discrete Objects, http://www.math.colostate.edu/~betten/orbiter/orbiter.html, Anton Betten, 2013.Google ScholarGoogle Scholar
  16. B. Schmalz. t-Designs zu vorgegebener Automorphismengruppe. Bayreuth. Math. Schr., 41:1--164, 1992. Dissertation, Universität Bayreuth, Bayreuth, 1992.Google ScholarGoogle Scholar
  17. Alfred Wassermann. Finding simple t-designs with enumeration techniques. J. Combin. Des., 6(2):79--90, 1998.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Classifying discrete objects with orbiter

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Communications in Computer Algebra
        ACM Communications in Computer Algebra  Volume 47, Issue 3/4
        September/December 2013
        116 pages
        ISSN:1932-2240
        DOI:10.1145/2576802
        Issue’s Table of Contents

        Copyright © 2014 Author

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 28 January 2014

        Check for updates

        Qualifiers

        • column

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader