=ADD=
=author=
Lisonek; Petr
=title=
Quasi-Polynomials: A Case Study in Experimental Combinatorics
=number=
93-18
=year=
1993
=sponsor=
 Austrian Science Foundation (FWF) project no. P7220,
 Austrian Ministery of Science and Research 
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-18.ps.gz
=abstract=
We prove that certain interesting combinatorial
quantities (typically depending on two parameters)
possess compact closed forms when one of the parameters
becomes fixed. The examples include necklaces,
0,1-matrices, bipartite graohs, multigraphs and polygon
dissections. A subset of the examples can be treated in
uniform way which resides in the generalization of
restricted partitions by means of finite group action.
The theory given in this paper bases on empiric results
of other authors and serves as a case study of the
experimental methods in enumerative combinatorics. A
computer algebra package for manipulating
quasi-polynomials is shortly introduced in the last
section.

=location=
2
=owner=
2
=source=
3
=reftype=
14