Bounds for log canonical thresholds with applications to birational rigidity

Mathematics – Algebraic Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, AMS-LaTeX; v2: corrected reference; v3: last application, to the complete intersection of type (2,6) in P^8, was rem

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bounds for log canonical thresholds with applications to birational rigidity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds for log canonical thresholds with applications to birational rigidity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds for log canonical thresholds with applications to birational rigidity will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-426844

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.