An easy counting lemma

DOI10.1016/j.dam.2018.10.001zbMath1406.05007OpenAlexW2902014577WikidataQ124817539 ScholiaQ124817539MaRDI QIDQ1730233

Thomas B. Preußer, Matthias R. Engelhardt

Publication date: 11 March 2019

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

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

zbMATH Keywords

symmetrygroup actioncounting problemscombinatoric

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Designs and configurations (05B99)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Maximal partial spreads and the modular \(n\)-queen problem
• A survey of known results and research areas for \(n\)-queens
• The modular n-queen problem. II
• Applied finite group actions.
• Maximal partial spreads and the modular \(n\)-queen problem. II
• The modular \(n\)-queens problem in higher dimensions
• A group-based search for solutions of the \(n\)-queens problem
• Maximal partial spreads and the modular \(n\)-queen problem. III

This page was built for publication: An easy counting lemma