Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.06285

The Siegel-Weil formula in geometry and arithmetic

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

Abstract

The present paper is an extended version of the lecture notes of a course given by the first author at the summer school on Formulas of Siegel and Weil (Bielefeld, September 2025). We survey three perspectives on the Siegel-Weil formula: classical, geometric, and arithmetic. We first recall the Siegel-Weil formula for elliptic theta series arising from positive definite lattices. We next discuss the higher genus case for lattices of arbitrary signature from an adelic viewpoint. After introducing orthogonal Shimura varieties, we present the geometric Siegel-Weil formula, in which the generating series of volumes of special cycles is shown to be an Eisenstein series. We conclude with the (partly conjectural) arithmetic Siegel-Weil formula, relating degrees of special cycles in arithmetic Chow groups to central derivatives of Eisenstein series.

Explore related subjects

math.NTmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jan Hendrik Bruinier, Riccardo Zuffetti. 2026-07-07. The Siegel-Weil formula in geometry and arithmetic. https://arxiv.org/abs/2607.06285

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↗