Search arXivSearch

arXiv · 2503.10826

Equidistribution Conditions for Gaps of Geometric Numerical Semigroups

Abstract

In 2008, Wang \& Wang showed that the set of gaps of a numerical semigroup generated by two coprime positive integers $a$ and $b$ is equidistributed modulo 2 precisely when $a$ and $b$ are both odd. Shor generalized this in 2022, showing that the set of gaps of such a numerical semigroup is equidistributed modulo $m$ when $a$ and $b$ are coprime to $m$ and at least one of them is 1 modulo $m$. In this paper, we further generalize these results by considering numerical semigroups generalized by geometric sequences of the form $a^k, a^{k-1}b, \dots, b^k$, aiming to determine when the corresponding set of gaps is equidistributed modulo $m$. With elementary methods, we are able to obtain a result for $k=2$ and all $m$. We then work with cyclotomic rings, using results about multiplicative independence of cyclotomic units to obtain results for all $k$ and infinitely many $m$. Finally, we take an approach with cyclotomic units and Dirichlet L-functions to obtain results for all $k$ and all $m$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Caleb M. Shor, Jae Hyung Sim. 2025-11-08. Equidistribution Conditions for Gaps of Geometric Numerical Semigroups. https://doi.org/10.1016/j.jnt.2025.10.008

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