Examples
User documentation
Quasi-polynomials are useful for representing various combinatorial objects such as Hilbert/Ehrhart polynomials.
A quasi-polynomial is a list F_1,...,F_r
of r
univariate polynomials
(all in the same variable). Its value at the integer N
is defined to be
F_k(r)
where k = N mod r
.
Constructors and pseudo-constructors
QuasiPoly(L)
creates the quasi-polynomial whose consituents are the entries ofL
(of typestd::vector<RingElem>
)
Operations
There are only two operations on a quasi-polynomial (apart from assignment and printing):
QP(n)
evaluate the quasi-polynomialQP
at the integern
constituents(QP)
returns aconst std::vector<RingElem>&
of the constituents ofQP
Maintainer documentation
It could hardly be simpler!
Bugs, shortcomings and other ideas
Very simplistic first version. Assumes the constituents are univariate (but presumably the theory extends to multivariate?).
Printing is crude.
Main changes
2014
- July (v0.99534): first release