Dynamical generalizations of the Prime Number Theorem and disjointness of additive and multiplicative semigroup actions
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.
We establish estimates for the number of solutions of certain affine congruences. These estimates are then used to prove Manin's conjecture for a cubic surface split over Q whose singularity type is D-4. This improves on a result of Browning and answers a ...
Let k be an algebraically closed field of characteristic p, where p is a prime number or 0. Let G be a finite group and ppk(G) be the Grothendieck group of p-permutation kG-modules. If we tensor it with C, then Cppk becomes a C-linear biset functor. Recall ...
The transposition of atmospheric turbulence statistics from the time domain, as conventionally sampled in field experiments, is explained by the so-called ergodic hypothesis. In micrometeorology, this hypothesis assumes that the time average of a measured ...
We discuss the adaptive behaviour of a collection of heterogeneous dynamical systems interacting via a weighted network. At each vertex, the network is endowed with a dynamical system with individual (initially different) control parameters governing the l ...
In this paper we prove the conjecture of Korevaar and Meyers: for each N≥cdtd, there exists a spherical t-design in the sphere Sd consisting of N points, where cd is a constant depending only on d. ...
Most of the known public-key cryptosystems have an overall complexity which is dominated by the key-production algorithm, which requires the generation of prime numbers. This is most inconvenient in settings where the key-generation is not an one-off proce ...
We introduce new sufficient conditions for a numerical method to approximate with high order of accuracy the invariant measure of an ergodic system of stochastic differential equations, independently of the weak order of accuracy of the method. We then pre ...
Society for Industrial and Applied Mathematics2014
We introduce an easily computable topological measure which locates the effective crossover between segregation and integration in a modular network. Segregation corresponds to the degree of network modularity, while integration is expressed in terms of th ...
This thesis is devoted to the ergodic theory of the piecewise monotone continuous maps of the interval. The coding is a classical approach for these maps. Thanks to the coding, we get a symbolic dynamical system which is almost isomorphic to the initial dy ...
We provide here some probabilistic interpretations of the generalized binomial distributions proposed by Gazeau et al. ["Generating functions for generalized binomial distributions," J. Math. Phys. 53, 103304 (2012)]. In the second part, we prove the "stro ...
