Computational Algorithms for the Enumeration of Group Invariant Partitions

DOI10.1137/0204017MaRDI QIDQ4096956zbMATH OpenOpenAlexFDO

Authors Dennis White, S. Gill Williamson

Publication date 1975

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0204017

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to group theory (20-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cited in

(2)

• Construction of vector lists and isomorph rejection
• A de Bruijn-type formula for enumerating patterns of partitions

This page was built for publication: Computational Algorithms for the Enumeration of Group Invariant Partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096956)