Equivalence classes of matchings and lattice-square designs

DOI10.1016/j.dam.2004.02.013zbMath1056.05007OpenAlexW2069117347MaRDI QIDQ1765511

William Y. C. Chen, David C. Torney

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.02.013

zbMATH Keywords

Linear algebraFinite fieldDihedral groupSpreadCombinatorial enumerationGroup actionSemidirect productCollineationDesign isomorphismEquivalence classHyperoctahedral groupIsomorphism group

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Other designs, configurations (05B30) Finite fields and commutative rings (number-theoretic aspects) (11T99) Permutation groups (20B99)

Uses Software

• GAP

Cites Work

• Automating Pólya theory: The computational complexity of the cycle index polynomial
• Pooling, lattice square, and union jack designs
• Principles of combinatorics
• Induced Cycle Structures of the Hyperoctahedral Group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence classes of matchings and lattice-square designs