We have 5 of 20 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Let $P$ be a $d$-dimensional lattice polytope with Ehrhart polynomial $L_P(t)$. Motivated by the study of Ehrhart positivity and magic positivity, we investigate the Taylor coefficients $\mathsf{A}_j(P;k)$ in the shifted expansion $L_P(t)=\sum_{j=0}^{d}\mathsf{A}_j(P;k)(t-k)^j$ about a real center $k$. In this paper, w...
Sylvester's denumerant $d(t; \boldsymbol{A})$ counts the number of nonnegative integer solutions to $\sum_{i=1}^{N} a_i x_i = t$, where $\boldsymbol{A} = (a_1, \dots, a_N)$ is a sequence of positive integers with $\gcd(\boldsymbol{A}) = 1$. In 2025, Xin and Zhang gave a polynomial time algorithm in $N$ for computing $d...
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$.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
