550 citations
- Université de LilleFR551 papers
- Centre National de la Recherche ScientifiqueFR378 papers
- Laboratoire de Physique des PlasmasFR168 papers
- Université Lille 1FR149 papers
- Institut national de recherche en sciences et technologies du numériqueFR56 papers
- Laboratoire de Mathématiques Blaise PascalFR32 papers
- KU LeuvenBE29 papers
- Sorbonne UniversitéFR24 papers
- Université Paris CitéFR24 papers
- École PolytechniqueFR22 papers
- Institut de Mathématiques de Jussieu-Paris Rive GaucheFR21 papers
- Centre Inria de l'Université de LilleFR17 papers
925 papers
From Cell Decomposition to Motivic Integration, Hensel Minimality, and Point Counting
Raf Cluckers
Following Macintyre's quantifier elimination result for semi-algebraic -adic sets from 1976, Denef's cell decomposition from 1984 has played a catalyzing role for both motivic i…
Canonical metric on a mildly singular Kähler varieties with an intermediate log Kodaira dimension
Hassan Jolany
Existence of canonical metric on a canonical model of projective singular variety was a long standing conjecture and the major part of this conjecture is about varieties which do n…
Generalized Hitchin-Kobayashi correspondence and Weil-Petersson current
Hassan Jolany
In this paper we extend Hitchin-Kobayashi correspondence along holomorphic fibre space and we show that there exists a generalized Hermitian-Einstein metric which is twisted with W…
Generalized Sasaki-Einstein metric twisted with Weil-Petersson metric
Hassan Jolany
Existence of canonical metric on a Sasakian variety was a long standing conjecture and the major part of this conjecture is about varieties which do not have definite basic first C…
Improving on the Brun-Titchmarsh Theorem
Olvier Ramaré, Jan Christoph Schlage-Puchta
We prove that the number of primes in an interval of length is at most when is large enough. This is obtained through a sieving process which can be seen…
Semi-discrete convex order and Laguerre tessellation fitting
David P. Bourne, Thomas Gallouët, Quentin Mérigot +1
Laguerre tessellations offer an efficient way to parameterize a large class of convex partitions of Euclidean space using only a set of points and scalar weights. For this reason,…