Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.19921

Lefschetz decompositions of Kudla-Millson theta functions

Jan Hendrik Bruinier·Riccardo Zuffetti
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the 1980's Kudla and Millson introduced a theta function in two variables. It behaves as a Siegel modular form with respect to the first variable, and is a closed differential form on an orthogonal Shimura variety with respect to the other variable. We prove that the Lefschetz decomposition of the cohomology class of that theta function is also its modular decomposition in Eisenstein, Klingen and cuspidal parts. We also show that the image of the Kudla-Millson lift is contained in the primitive cohomology of X. As an application, we deduce dimension formulas for the cohomology of X in low degree. Our results cover the cases of moduli spaces of compact hyperkähler manifolds.

Explore related subjects

math.NTmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Hendrik Bruinier, Riccardo Zuffetti. 2026-07-17. Lefschetz decompositions of Kudla-Millson theta functions. https://arxiv.org/abs/2406.19921

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↗