Combinatorial families enumerated by quasi-polynomials
From MaRDI portal
Publication:880005
DOI10.1016/j.jcta.2006.06.013zbMath1117.05005WikidataQ56225457 ScholiaQ56225457MaRDI QIDQ880005
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
linear code; group action; isomorphism; block design; rational polytope; polygon dissection; unrestricted code
05A15: Exact enumeration problems, generating functions
Related Items
Counting symmetry classes of dissections of a convex regular polygon, Generalizations of Khovanskiĭ's theorems on the growth of sumsets in abelian semigroups, Maximal periods of (Ehrhart) quasi-polynomials
Uses Software
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