Bounds for log canonical thresholds with applications to birational rigidity

By Tommaso de Fernex, L. Ein, M. Mustaţă. 2002

119 citations recorded by the source corpus.

We use intersection theory, degeneration techniques and jet schemes to study log canonical thresholds. Our first result gives a lower bound for the log canonical threshold of a pair in terms of the log canonical threshold of the image by a suitable smooth morphism. This in turn is based on an inequality relating the log canonical threshold and the Samuel multiplicity, generalizing our previous result from math.AG/0205171. We then give a lower bound for the log canonical threshold of an affine scheme defined by homogeneous equations of the same degree in terms of the dimension of the non log terminal locus (this part supersedes math.AG/0105113). As an application of our results, we prove the birational superrigidity of every smooth hypersurface of degree N in P^N, if 4\leq N\leq 12.

Subfields: Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics

View Paper: https://www.semanticscholar.org/paper/15d8b265be4981c3ffbda1593bb92c412e9120a0

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Yuri Prokhorov
  2. J.-L. Colliot-Th'elene
  3. J. McKernan
  4. H. Blum
  5. M. Mustaţă
  6. C. Birkar
  7. Chi Li

In Geometry and Topology

  1. H. Blum
  2. Chi Li
  3. Yuri Prokhorov
  4. M. Mustaţă
  5. J. McKernan
  6. J.-J. Sansuc
  7. J.-L. Colliot-Th'elene
  8. C. Birkar

In Mathematical Physics

  1. H. Blum
  2. M. Mustaţă
  3. J. McKernan
  4. Yuri Prokhorov
  5. J.-J. Sansuc
  6. J.-L. Colliot-Th'elene
  7. C. Birkar
  8. S. Ishii

Citations in the corpus