Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.35772

A density deficit for sums of three cube-full numbers

Basile Beyer de Ryke
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let $F$ be the set of positive cube-full integers. We prove that, for every $\varepsilon>0$, there is a reduced residue class in which $F+F+F$ has upper relative density at most $\varepsilon$. Consequently, the positive integers not representable as sums of at most three cube-full numbers have positive lower natural density. This proves the infinitude assertion in Erdős Problem \#940 for $r=3$. The argument combines a cubic-character estimate with a truncation of the parametrisation by the canonical 4-full part.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Basile Beyer de Ryke. 2026-07-26. A density deficit for sums of three cube-full numbers. https://arxiv.org/abs/2609.35772

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Compact Coefficient Formulae for Logarithmic Tangent and Hyperbolic Integrals

We develop compact coefficient-extraction formulae for several families of hyperbolic, logarithmic tangent, and Malmsten-type integrals whose values are finite linear combinations of odd zeta values and even Dirichlet beta values. The principal advantage of these formulae is that coefficients previously encoded by recursive arrays or nested finite sums are replaced by a single coefficient of an explicit elementary expression. This makes the coefficients easier to compute, keeps the dependence on the parameters visible, and reveals structural features---such as vanishing ranges, extremal coefficients, and sign patterns---without hidden cancellations. For shifted hyperbolic integrals with numerator $\sinh((2k+1)x)$, the coefficients are expressed through Chebyshev--arcsine extractions. The same mechanism yields Laurent coefficient formulae for logarithmic tangent integrals and leads to direct proofs of simple initial and terminal coefficients, including a parity-free terminal identity. For $m,n\geq1$, $m\geq n$, and $m+n$ even, we prove \[ \int_0^\infty\frac{\tanh^{m+1}x}{x^{n+1}}\,dx = (-1)^{(m-n)/2} \sum_{p=\lceil n/2\rceil}^{(m+n)/2} \binom{2p}{n} (2^{2p+1}-1) \frac{ζ(2p+1)}{π^{2p}} [u^{m+n-2p}](u\cot u)^{m+1}. \] \[\int_0^\infty \frac{\tanh^m x}{x^n\cosh x}\,dx = (-1)^{(m-n)/2} \sum_{p=\lceil n/2\rceil}^{(m+n)/2} 2^{2p}\binom{2p-1}{n-1} \frac{β(2p)}{π^{2p-1}} [u^{m+n-2p}] \frac{u}{\sin u}(u\cot u)^m \] In the diagonal zeta case, the formula gives the family $\int_0^\infty(\tanh x/x)^N\,dx$ in a direct, non-recursive form and makes the disappearance of the initial zeta values immediate.

math.GM↗
arXiv2026

Sharp Total-Support Uncertainty for the Standard Complete Set of Mutually Unbiased Bases

We determine the sharp total-support uncertainty for the standard complete set of mutually unbiased bases in every prime dimension at least five, proving that the minimum is \(T_s(p)=p^2-p+2\). This resolves all prime dimensions left open by Fiorentino and Weigert, beginning with dimension eleven, and gives a uniform analytic determination of the optimal lower bound in dimension seven, where the earlier determination was partly numerical. The main new ingredient is a sharp zero-count theorem for arbitrary complex Fourier data supported on the finite parabola. A cyclotomic reduction and truncated local expansion produce a first nonzero finite-field jet that is affine in the transverse variable, reducing the planar zero count to a one-dimensional multiplicity problem. We then classify all extremizing projective states and derive an exact enumeration formula. In dimension seven, this gives analytic four-point extremizers and exactly \(12348\) such rays, completing the analytic description and count left open in the earlier work.

math.GM↗
arXiv2026

Restricted Coprime Representations Modulo 6P: Exact CRT Formulas and Positivity Thresholds

Let $5\leq p_1<\cdots 0$. Maximizing this bound over squarefree moduli whose prime factors do not exceed a prime $p$ gives an explicit threshold $\mathcal N(p)$ satisfying $\log\mathcal N(p)\sim(\log3)p/\log p$. We also describe the complete prime cutoff at $\sqrt{2n}$ and its exact additive-prime interpretation. We also evaluate $g_P(2tP)$ explicitly using the real character of period $3$. The positivity thresholds are elementary and fully explicit; lower-bound sieves provide smaller asymptotic scales, and the present thresholds do not establish positivity at the complete cutoff for all $n\geq13$.

math.GM↗