Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2507.04402

On Minimal Excludant over Overpartitions

Judy Ann Donato
View original source ↗Read source document ↗Export metadata ↓

Abstract

A partition of a positive integer $n$ is a non-increasing sequence of positive integers which sum to $n$. A recently studied aspect of partitions is the minimal excludant of a partition, which is defined to be the smallest positive integer that is not a part of the partition. In 2024, Aricheta and Donato studied the minimal excludant of the non-overlined parts of an overpartition, where an overpartition of $n$ is a partition of $n$ in which the first occurrence of a number may be overlined. In this research, we explore two other definitions of the minimal excludant of an overpartition: (i) considering only the overlined parts, and (ii) considering both the overlined and non-overlined parts. We discuss the combinatorial, asymptotic, and arithmetic properties of the corresponding $σ$-function, which gives the sum of the minimal excludants over all overpartitions.

Explore related subjects

math.NT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Judy Ann Donato. 2025-07-06. On Minimal Excludant over Overpartitions. https://arxiv.org/abs/2507.04402

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗