Searcharxiv⌕ Search

arXiv · 2609.30407

Supercharacter theory and applications to Ramanujan sums over a finite Frobenius ring

Abstract

The theory of Ramanujan sums has been playing a fundamental role in several subfields of mathematics. They appear in the theory of special values of zeta functions, spectral graph theory, representation theory, and analytic number theory. Recent work has shown that classical Ramanujan sums can also be interpreted as a super-Fourier transform via the theory of supercharacters for the ring $\mathbb{Z}/n$. In this article, building upon our recent work on supercharacters over an arbitrary finite Frobenius ring, we explore additional arithmetical properties of Ramanujan sums. Our approach provides a unified framework that generalizes various results in the literature regarding these sums. As a by-product, we also describe a new criterion for determining when a finite commutative ring is Frobenius, which could be of independent interest to the algebra community.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tung T. Nguyen, Nguyen Duy Tân, Enrique Treviño. 2026-09-24. Supercharacter theory and applications to Ramanujan sums over a finite Frobenius ring. https://arxiv.org/abs/2609.30407

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

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗