Search arXivSearch

arXiv · 2606.18027

Restricted partition functions and additive complements

Abstract

Let $\mathbb{N}$ be the set of positive integers. For subsets $\mathcal{A},\mathcal{M}\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $p(n,\mathcal{A},\mathcal{M})$ denote the number of representations of $n$ in the form $$ n=\sum_{a\in \mathcal{A}}m_a a, $$ where $m_a\in \mathcal{M}\cup \{0\}$ for all $a\in \mathcal{A}$, and only finitely many $m_a$ are nonzero. We prove that there exist two infinite sets $\mathcal{A}=\{a_n\}_{n=1}^{\infty}$ and $\mathcal{M}$ of positive integers such that $$ \lim_{n\to\infty}\frac{\log a_{n+1}-\log a_n}{\log n}=+\infty, $$ $p(n,\mathcal{A},\mathcal{M})>0$ for every $n\in\mathbb{N}$, and $p$ has polynomial growth. More generally, we prove a construction that associates restricted partition functions of polynomial growth with additive complements satisfying a simple counting condition. This answers a 2016 question of Dai and Chen in the affirmative.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuchen Ding. 2026-06-16. Restricted partition functions and additive complements. https://arxiv.org/abs/2606.18027

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

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT