513 citations
- Centre National de la Recherche ScientifiqueFR688 papers
- Sorbonne UniversitéFR684 papers
- Université Paris CitéFR573 papers
- Université Paris DiderotFR274 papers
- Université Pierre-et-Marie-CurieFR203 papers
- Sorbonne Paris CitéFR121 papers
- École Normale Supérieure - PSLFR49 papers
- Laboratoire de Mathématiques Blaise PascalFR48 papers
- Laboratoire de Mathématiques d'OrsayFR47 papers
- Département de mathématiques et applicationsFR45 papers
- École PolytechniqueFR45 papers
- OURAGAN: Outils de Résolution Algébriques pour la Géométrie et ses ApplicationsFR44 papers
23 papers · 2 filters
Smoothness of cohomology sheaves of stacks of shtukas
Cong Xue
We prove, for all reductive groups, that the cohomology sheaves with compact support of stacks of shtukas are ind-smooth over and that their geometric generic fibers ar…
Parabolicity conjecture of -isocrystals
Marco D'Addezio
In this article we prove Crew's parabolicity conjecture of -isocrystals. For this purpose, we introduce and study the notion of -hull of a sub--isocrystal. On the wa…
Stably semiorthogonally indecomposable varieties
Dmitrii Pirozhkov
A triangulated category is said to be indecomposable if it admits no nontrivial semiorthogonal decompositions. We introduce a definition of a noncommutatively stably semiorthogonal…
Motives with modulus, III: The categories of motives
Bruno Kahn, Hiroyasu Miyazaki, Shuji Saito +1
We construct and study a triangulated category of motives with modulus over a field that extends Voevodsky's category $\mathbf{DM}_{…
Non-Archimedean volumes of metrized nef line bundles
Sébastien Boucksom, Walter Gubler, Florent Martin
Let be a line bundle on a proper, geometrically reduced scheme over a non-trivially valued non-Archimedean field . Roughly speaking, the non-Archimedean volume of a cont…
Exact solutions in low-rank approximation with zeros
Kaie Kubjas, Luca Sodomaco, Elias Tsigaridas
Low-rank approximation with zeros aims to find a matrix of fixed rank and with a fixed zero pattern that minimizes the Euclidean distance to a given data matrix. We study the criti…