×

zbMATH — the first resource for mathematics

How fast can we compute orbits of groups? (English) Zbl 1395.05192
Davenport, James H. (ed.) et al., Mathematical software – ICMS 2018. 6th international conference, South Bend, IN, USA, July 24–27, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-96417-1/pbk; 978-3-319-96418-8/ebook). Lecture Notes in Computer Science 10931, 62-70 (2018).
Summary: 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.
For the entire collection see [Zbl 1391.68004].

MSC:
05E18 Group actions on combinatorial structures
05-04 Software, source code, etc. for problems pertaining to combinatorics
PDF BibTeX XML Cite
Full Text: DOI