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$.
Abstract
Aardal and Lenstra systematically studied hard knapsack problems of the form $a_1x_1+\cdots+a_nx_n=b$, where $a_i=p_iM+r_iN$, $(M,N)$ is a coprime pair of positive integers, and the integers $|p_i|, |r_i|$ are small relative to $M$ and $N$. We investigate the corresponding challenging denumerant problem (i.e., counting the number of nonnegative integer solutions) and present a polynomial-time algorithm. This eliminates the computational bottlenecks caused by large values of $M$, $N$ and $b$. The proposed algorithm achieves a time complexity of $O(n^4\Delta^2\log n\log\Delta)$, which depends solely on the parameters $n$ and $\Delta=\max_{i,j}|r_i p_j - r_j p_i|$. Moreover, we consider the problem of expressing a general vector $(a_1,\dots,a_n)$ in the above form using the LLL algorithm.
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...
The unfair $0$--$1$ polynomial conjecture asks whether a factorization \[C(x)=A(x)B(x),\] with $A$ and $B$ monic and having nonnegative real coefficients, and $C$ a polynomial with all the coefficients 0 and 1, must already be a factorization into $0$--$1$ polynomials. Let $k$ be odd and $0<a<1$. We study the possibili...
We give an exact algorithm for minimizing an arbitrary rational quadratic polynomial $x^T Q x + c^T x + \gamma$ over the integer points of a bounded rational polyhedron $\{x : Ax \le b\}$. For $n$ variables and $m$ inequalities, the running time is $$2^{O(n \log(n+1))} (m+1)^{O(n)} \beta^{O(n)} (1+L)^{O(1)},$$ where $\...
Let $p_1,\dots,p_r\geq 5$ be distinct primes, let $P=p_1\cdots p_r$, and put $M=6P$. For a positive integer $n$, let $g_P(2n)$ denote the number of unordered representations $2n=h+k$, with $1\leq h\leq k$, such that $\gcd(h,M)=\gcd(k,M)=1$. Using the canonical remainder operator $\delta_q(x)=x-q\lfloor x/q\rfloor$, we...
The degree-distortion tradeoff for polynomial approximation of the $d$-dimensional cross-polytope $B_1^d$ is determined, and degree $\Theta(d)$ is necessary and sufficient for constant distortion.
A positive $D(n)$-$m$-tuple is a set $A=\{a_1,\ldots,a_m\}$ of distinct positive integers such that $a_i a_j+n$ is a square for every $i\ne j$. In 2005, Dujella and Luca obtained an absolute bound for the cardinality of a $D(p)$- or $D(-p)$-tuple of positive integers, uniformly in the prime $p$. We extend the underlyin...
A. Dujella· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
