Publications associées (8)

Rankin-Selberg coefficients in large arithmetic progressions

Philippe Michel, Yongxiao Lin

Let (?(f) (n))(n=1) be the Hecke eigenvalues of either a holomorphic Hecke eigencuspform or a Hecke-Maass cusp form f. We prove that, for any fixed ? > 0, under the Ramanujan-Petersson conjecture for GL(2) Maass forms, the Rankin-Selberg coefficients (?(f) ...
SCIENCE PRESS2023

From Wallis to Ramanujan, in companionship with RW Gosper

Manuel Ojanguren

Accelerating the convergence of some hypergeometric series with Gosper's method leads, in a most elementary way, to some series discovered by Ramanujan, Bauer and Dougall. In particular, it is shown that one of them can be traced back to the well-known for ...
2018

CM values of higher Green's functions and regularized Petersson products

Maryna Viazovska

Higher Green functions are real-valued functions of two variables on the upper half-plane, which are bi-invariant under the action of a congruence subgroup, have a logarithmic singularity along the diagonal, and satisfy the equation f = k(1−k) f ; here i ...
Cambridge UP2015

The geometry of the universal Teichmuller space and the Euler-Weil-Petersson equation

Tudor Ratiu, François Gay-Balmaz

On the identity component of the universal Teichmuller space endowed with the Takhtajan-Teo topology, the geodesics of the Weil Petersson metric are shown to exist for all time. This component is naturally a subgroup of the quasisymmetric homeomorphisms of ...
Elsevier2015

Modular Functions and Special Cycles

Maryna Viazovska

In this thesis we study algebraic cycles on Shimura varieties of orthogonal type. Such varieties are a higher dimensional generalization of modular curves and their important feature is that they have natural families of algebraic cycles in all codimesions ...
Rheinische Friedrich-Wilhelms-Universität Bonn2013

Expanding graphs, Ramanujan graphs, and 1-factor perturbations

Antoine Musitelli

We construct (k±1)-regular graphs which provide sequences of expanders by adding or substracting appropriate 1- factors from given sequences of k- regular graphs. We compute numerical examples in a few cases for which the given sequences are from the work ...
2006

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.