Let $\mathrm{IMS}_n(m)$ count the $n\times n$ nonnegative integer matrices whose row sums, column sums, main-diagonal sum, and antidiagonal sum are all $m$. We determine the Ehrhart series $F_n(q)=\sum_{m\geq0}\mathrm{IMS}_n(m)q^m$ as reduced rational functions for $n=7$ and $n=8$. Their numerator--denominator degrees...
By using constant term manipulations, we present the first polynomial-time algorithm for lattice-point counting in fixed dimension that does not rely on Barvinok's unimodular decomposition. The algorithm instead operates directly on a rational generating function in the form of a nested root average, as produced by the...
This work investigates the corresponding challenging denumerant problem and presents a polynomial-time algorithm that eliminates the computational bottlenecks caused by large values of $M$, $N$ and $b$.
Jinlong Tang, Guoce Xin, Zi-Hao Zhang· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.