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(t; \boldsymbol{A})$ when the entries of $\boldsymbol{A}$ are bounded by a constant. In this paper, we extend this algorithm by incorporating Barvinok's algorithm, enabling it to handle the case where a fixed number of entries of $\boldsymbol{A}$ are allowed to be unbounded.
The Koml\'os problem asks for signs $\varepsilon\in\{-1,1\}^n$ with $\|A\varepsilon\|_\infty$ bounded by an absolute constant whenever the columns of $A\in\mathbb R^{m\times n}$ have Euclidean norm at most $1$. We give the first polynomial-time algorithm for this problem in the unit-cost real-RAM model. Our determinist...
Let $b_1,\dots,b_d\ge2$ be fixed integers, and let $k$ be their multiplicative rank. We study representations $n=a+b_1^{u_1}\cdots b_d^{u_d}$, where $a$ belongs to a set $\mathcal{A}$ of positive integers and $u_1,\dots,u_d$ are positive integers, counting distinct tuples of exponents separately. Under density and corr...
A cyclic number is a positive integer $n$ such that $\gcd(n, \varphi(n)) = 1$. Erd\H{o}s showed that the number of cyclic numbers up to $x$, $C(x)$, has $C(x) \sim e^{-\gamma}x/\log_3(x)$ asymptotically as $x$ tends to infinity. We define Wieferich numbers to be odd, positive integers $n$ such that $(n, (2^{\ell(n)}-1)...
Let $m\geq 2$ be an integer, and let $d\geq 2$ be an even integer. We study monic, reciprocal, non-cyclotomic polynomials $$ P(x)=x^d+a_{d-1}x^{d-1}+\cdots+a_1x+1\in\mathbb{Z}[x]. $$ For a fixed residue class $r\in\{0,1,\ldots,m-1\}$, we prove that there exists an effectively computable constant $c_{r,m}>1$ such that t...
A deterministic algorithm that finds signs with $\|A\varepsilon\|_\infty<99$ using $O(mn+n^{\omega+2}\log^3 n)$ arithmetic operations, where $\omega>2$ is any fixed attainable matrix-multiplication exponent; with the current bounds on $\omega$ this is $\widetilde O(mn+n^{4.372})$.
Let $K$ be a number field, let $S$ be a finite set of places of $K$ containing the archimedean places, and let $\mathcal{O}_{K,S}$ denote the ring of $S$-integers of $K$. We prove that multiplication is positive-existentially definable in $(\mathcal{O}_{K,S},0,1,+,\mid)$ if and only if the unit group $\mathcal{O}_{K,S}...
Carlos Mart'inez-Ranero· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.