Search arXivSearch

arXiv · 2310.10609

Bounds on the Möbius-signed partition numbers

Abstract

For $n \in \mathbb{N}$ let $Π[n]$ denote the set of partitions of $n$, i.e., the set of positive integer tuples $(x_1,x_2,\ldots,x_k)$ such that $x_1 \geq x_2 \geq \cdots \geq x_k$ and $x_1 + x_2 + \cdots + x_k = n$. Fixing $f:\mathbb{N}\to\{0,\pm 1\}$, for $π= (x_1,x_2,\ldots,x_k) \in Π[n]$ let $f(π) := f(x_1)f(x_2)\cdots f(x_k)$. In this way we define the {signed partition numbers} \[ p(n,f) = \sum_{π\inΠ[n]} f(π). \] Following work of Vaughan and Gafni on partitions into primes and prime powers, we derive asymptotic formulae for quantities $p(n,μ)$ and $p(n,λ)$, where $μ$ and $λ$ denote the Möbius and Liouville functions from prime number theory, respectively. In addition we discuss how quantities $p(n,f)$ generalize the classical notion of restricted partitions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taylor Daniels. 2024-11-20. Bounds on the Möbius-signed partition numbers. https://doi.org/10.1007/s11139-024-00885-8

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