Enumerative combinatorics
Closed forms for the number of polygon dissections
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Enumeration, Construction and Random Generation of Block Codes
Designs, Codes and Cryptography
Linear codes over finite fields and finite projective geometries
Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Multidimensional Ehrhart reciprocity
Journal of Combinatorial Theory Series A
Note: Maximal periods of (Ehrhart) quasi-polynomials
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
We say that the sequence (a"n) is quasi-polynomial in n if there exist polynomials P"0,...,P"s"-"1 and an integer n"0 such that, for all n=n"0, a"n=P"i(n) where i=n(mod s). We present several families of combinatorial objects with the following properties: Each family of objects depends on two or more parameters, and the number of isomorphism types of objects is quasi-polynomial in one of the parameters whenever the values of the remaining parameters are fixed to arbitrary constants. For each family we are able to translate the problem of counting isomorphism types of objects into the problem of counting integer points in a union of parametrized rational polytopes. The families of objects to which this approach is applicable include combinatorial designs, linear and unrestricted codes, and dissections of regular polygons.