Combinatorial families enumerated by quasi-polynomials

DOI10.1016/j.jcta.2006.06.013zbMath1117.05005OpenAlexW2158356697WikidataQ56225457 ScholiaQ56225457MaRDI QIDQ880005

Petr Lisoněk

Publication date: 10 May 2007

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2006.06.013

zbMATH Keywords

linear codegroup actionisomorphismblock designrational polytopepolygon dissectionunrestricted code

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (3)

Counting symmetry classes of dissections of a convex regular polygon ⋮ Maximal periods of (Ehrhart) quasi-polynomials ⋮ Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On general dissections of a polygon
• Enumeration, construction and random generation of block codes
• Applied finite group actions.
• Cycle indices of linear, affine, and projective groups
• Multidimensional Ehrhart reciprocity
• Closed forms for the number of polygon dissections
• Linear codes over finite fields and finite projective geometries

This page was built for publication: Combinatorial families enumerated by quasi-polynomials