The fourth moment of individual Dirichlet L-functions on the critical line

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.

We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for n-sided dice with pairwise ordering induced by the probability, relative to 1/2, that a throw from one die is higher than the other. We ...

We characterize the local smoothness and the asymptotic growth rate of the Levy white noise. We do so by characterizing the weighted Besov spaces in which it is located. We extend known results in two ways. First, we obtain new bounds for the local smoothn ...

The generation of wide-angle diffraction patterns can be done in different ways using either thin diffractive optical elements with small features sizes or arrays of microoptics with large optical paths that are thick diffractive optical elements. Our aim ...

A method and system for deriving particle characteristics is described. The method comprises imaging the movement of at least one free-floating particle in a liquid environment at at least one moment in time, determining for at least one moment in time a m ...

Range-only localization has applications as diverse as underwater navigation, drone tracking and indoor localization. While the theoretical foundations of lateration---range-only localization for static points---are well understood, there is a lack of unde ...

The focus of this work is on the development of an error-driven isogeometric framework, capable of automatically performing an adaptive simulation in the context of second- and fourth-order, elliptic partial differential equations defined on two-dimensiona ...

This work focuses on the development of a posteriori error estimates for fourth-order, elliptic, partial differential equations. In particular, we propose a novel algorithm to steer an adaptive simulation in the context of Kirchhoff plates and Kirchhoff–Lo ...

In this paper we study the regularized Petersson product between a holomorphic theta series associated to a positive definite binary quadratic form and a weakly holomorphic weight-one modular form with integral Fourier coefficients. In [18], we proved that ...

We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised systems, such as the generation of ...

This work studies the robustness certification problem of neural network models, which aims to find certified adversary-free regions as large as possible around data points. In contrast to the existing approaches that seek regions bounded uniformly along a ...

The fourth moment of individual Dirichlet L-functions on the critical line

Chattez avec Graph Search

The probability of intransitivity in dice and close elections

Wavelet analysis of the Besov regularity of Levy white noise

Light pattern generation with hybrid refractive microoptics under Gaussian beam illumination

Methods and systems for particle characterisation

Relax and Recover: Guaranteed Range-Only Continuous Localization

Adaptive isogeometric analysis on two-dimensional trimmed domains based on a hierarchical approach

A hierarchical approach to the a posteriori error estimation of isogeometric Kirchhoff plates and Kirchhoff–Love shells

Petersson inner products of weight-one modular forms

Efficient Verifiable Delay Functions

On Certifying Non-Uniform Bounds against Adversarial Attacks