Search arXivSearch

arXiv · 1812.06180

Nonabelian Hodge theory and vector valued modular forms

Abstract

We examine the relationship between nonabelian Hodge theory for Riemann surfaces and the theory of vector valued modular forms. In particular, we explain how one might use this relationship to prove a conjectural three-term inequality on the weights of free bases of vector valued modular forms associated to complex, finite dimensional, irreducible representations of the modular group. This conjecture is known for irreducible unitary representations and for all irreducible representations of dimension at most 12. We prove new instances of the three-term inequality for certain nonunitary representations, corresponding to a class of maximally-decomposed variations of Hodge structure, by considering the same inequality with respect to a new type of modular form, called a "Higgs form", that arises naturally on the Dolbeault side of nonabelian Hodge theory. The paper concludes with a discussion of a strategy for reducing the general case of nilpotent Higgs bundles to the case under consideration in our main theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cameron Franc, Steven Rayan. 2018-12-14. Nonabelian Hodge theory and vector valued modular forms. https://doi.org/10.1090/conm%2F753%2F15166

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