Publications associées (8)

Birational characterization of abelian varieties and ordinary abelian varieties in characteristic p>0

Zsolt Patakfalvi, Lei Zhang

Let k be an algebraically closed field of characteristic p > 0. We give a birational characterization of ordinary abelian varieties over k: a smooth projective variety X is birational to an ordinary abelian variety if and only if kappa(S)(X) = 0 and b(1)(X ...
DUKE UNIV PRESS2019

Modular functors, cohomological field theories, and topological recursion

Nicolas Gerson Orantin

Given a topological modular functor V in the sense of Walker, we construct vector bundles Z (lambda) over bar, over (M) over bar (g,n) whose Chern characters define semi-simple cohomological field theories. This construction depends on a determinati ...
AMER MATHEMATICAL SOC2018

Moyennabilité et courbure

Martin Anderegg

As Avez showed (in 1970), the fundamental group of a compact Riemannian manifold of nonpositive sectional curvature has exponential growth if and only if it is not flat. After several generalizations from Gromov, Zimmer, Anderson, Burger and Shroeder, the ...
EPFL2010

Nilpotent centralizers and Springer isomorphisms

Donna Testerman

Let GG be a semisimple algebraic group over a field KK whose characteristic is very good for GG, and let σσ be any GG-equivariant isomorphism from the nilpotent variety to the unipotent variety; the map σσ is known as a Springer isomorphism. Let y∈G(K)y∈G( ...
2009

Relative class number of Abelian number fields of prime conductor below 10000

Mohammad Amin Shokrollahi

In this paper we compute the relative class number of all imaginary Abelian fields of prime conductor below 10000. Our approach is based on a novel multiple evaluation technique, and, assuming the ERH, it has a running time of O(p2 log 2(p) log log (p)), w ...
1999

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.