For a finite sequence of positive integers $\boldsymbol{a}=(a_1,\dots,a_n)$, the restricted partition function $q_{\boldsymbol{a}}(k)$ denote the number of nonnegative integer solutions to the equation $a_1x_1+a_2x_2+\cdots +a_nx_n=k$. It is proved to be a quasi-polynomial of degree $n-1$. Write $q_{\boldsymbol{a}}(k)=\sum_{j=0}^{n-1}c_j(k)k^j$ with periodic coefficient functions $c_j$, and set $b_m=\#\{i:m\mid a_i\}$. In 2008, Beck, Sam, and Woods conjectured that the minimum period of $c_j(k)$ is $\mathrm{lcm}\{m:b_m>j\}$. In this paper, we derive an exact root-of-unity formula for every coefficient function $c_j(k)$. The formula proves the conjectured divisibility upper bound, but it also reveals a lower bound for the period of $c_j(k)$. Both divisibility bounds are sharp. This leads us to construct a family of counterexamples to this conjecture.
Fix an integer $K\ge2$, and let $C_K^n =\{(e^{\frac{2\pi ij}{K}})_{j=0}^{K-1}\}^n$ be the product of cyclic groups of order $K$. For a Fourier character $\chi_\alpha$, let $s(\alpha)$ be the number of active coordinates. We give a self-contained proposed proof that the dimension-free Bohnenblust--Hille constants governed by interaction order grow polynomially: if $p_d=2d/(d+1)$ and \[ \gamma_2=\frac12, \qquad \gamma_K=\frac{K\log(K-1)}{4(K-2)}\quad(K\ge3), \] then the $\ell^{p_d}$ norm of Fourier coefficients $\{\hat f(\alpha)\}$ is bounded by $L^\infty$ norm of $f$ multiplied by $C(K) d^{4\gamma_K+5}$. The constant $C(K)$ is actually at most of the order $K^{5/2}$.
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.
Let $(a_n)_{n\geqslant 0}$ be a sequence of integers. Its dual sequence $(a_n^*)_{n\geqslant 0}$ is defined by \begin{equation*} a_n^* := \sum_{k=0}^{n} \binom{n}{k}(-1)^k a_k. \end{equation*} Let $p>3$ be a prime. In this paper we mainly investigate congruences modulo $p^2$ involving central binomial coefficients and $p$-adic dual sequences. For example, we prove that for any sequence $(a_k)_{k\ge0}$ of $p$-adic integers, \begin{align*} \sum^{(p-1)/2}_{k=0}\binom{2k}{k}^2\frac{a_{2k}}{16^k}\equiv\left( \frac{-1}{p}\right) \sum_{k=0}^{p-1}\frac{\mathcal{P}_{k}}{16 ^{k}}a_{k}^*\pmod{p^2}, \end{align*} where $(\mathcal{P}_n)_{n\ge0}$ are the Catalan--Larcombe--French numbers given by \begin{equation*} \mathcal{P}_0=1,\quad \mathcal{P}_1=8, \quad n^2 \mathcal{P}_n = 8(3n^2-3n+1)\mathcal{P}_{n-1}-128(n-1)^2\mathcal{P}_{n-2} \quad (n\ge2). \end{equation*} We also establish a new formula for $\sum_{k=0}^{(p-1)/2}\binom{2k}{k}a_{2k}^*/4^k \pmod{p^2}$ and as a consequence we confirm some conjectures of Z.-W. Sun \cite{Sun2014CANT} on the generalized central trinomial coefficients $T_{2k}(b,c)$, i.e., the coefficient of $x^{2k}$ in $(x^2+bx+c)^{2k}$, where $b,c$ are integers.
Let $A=\{a_{0}, a_{1}, \ldots, a_{k-1}\}$ be a set of $k>7$ integers such that $0=a_{0}<a_1<\cdots<a_{k-1}$ and $\gcd(A)=1$. The set $2^{\wedge}A=\{a+b: a, b\in A, a\neq b\}$ is called the restricted sumsets of $A$. Freiman-Lev conjecture is a well-known conjecture which related to restricted sumsets [V.F. Lev, Restricted set addition in groups, I. The classical setting, J. London Math. Soc. 62(2000), 27-40]. Up to now, Freiman-Lev conjecture is still open for all $a_{k-2}\geqslant 2k-4$ and $a_{k-1}\geqslant 2k-2$. In this paper, we complete the proof of the Freiman-Lev conjecture by resolving this final and most challenging case.
Let $q$ be an odd prime power, and let $A_n=(a_{ij})\in\mathbb F_q^{n\times n}$ be a random matrix whose entries are independent and uniformly distributed on $\mathbb F_q$. The permanent of $A_n$ is defined by $\operatorname{per}(A_n)=\sum_{\sigma\in S_n}\prod_{i=1}^n a_{i,\sigma(i)}$, where $S_n$ denotes the symmetric group on $[n]$. Ghasemi, Gross, and Kopparty conjectured the zero-mass asymptotic $\Pr[\operatorname{per}(A_n)=0]=1/q+o(1)$ for every fixed odd prime power $q$, and Hunter, Kwan, and Sauermann subsequently stated its equivalent full-distribution formulation: for every fixed $q$ and every $x\in\mathbb F_q$, \[ \lim_{n\to\infty}\Pr[\operatorname{per}(A_n)=x]=\frac1q. \] In this paper, we prove this conjecture. More precisely, we prove that there is an absolute constant $C>0$ such that \[\frac12\sum_{x\in\mathbb F_q}\left|\Pr[\operatorname{per}(A_n)=x]-\frac1q\right|\le C\frac{\log n}{n}\] for every odd prime power $q$ and every $n\ge 7$. The estimate is uniform in $q$, so the conclusion remains valid for every sequence $q=q(n)$ of odd prime powers.
For a vector of positive integers $\mathbf{b} = (b_1,\ldots,b_h)$ with $\gcd(b_1,\ldots,b_h) = 1$, we study sets $A \subseteq \mathbb{N}$ for which every sufficiently large integer has a bounded positive number of representations \[ n = b_1 x_1 + \cdots + b_h x_h \qquad (x_1,\ldots,x_h\in A). \] We prove that such a set exists for every binary vector $\mathbf{b} \neq (1,1)$, and for some general higher-dimensional families, including $\mathbf{b} = (u_1, p^d u_2, \ldots, p^{(h-1)d} u_h)$ where $p\nmid u_1\cdots u_h$.
Unknown authors· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
