F-purity versus log canonicity for polynomials

Details F-purity versus log canonicity for polynomials F-purity versus log canonicity for polynomials

2011-12-12

arxiv.org/abs/1112.2423v1

Mathematics

Commutative Algebra

20 pages, 1 figure

Scientific paper

In this article, we consider the conjectured relationship between F-purity and log canonicity for polynomials over the complex numbers. We associate to a collection M of n monomials a rational polytope P contained in [0,1]^n. Using P and the Newton polyhedron associated to M, we define a non-degeneracy condition under which log canonicity and dense F-pure type are equivalent for all linear combinations of the monomials in M. We also show that log canonicity corresponds to F-purity for very general polynomials. Our methods rely on showing that the F-pure and log canonical threshold agree for infinitely primes, and we accomplish this by comparing these thresholds with the thresholds associated to their monomial ideals.

Affiliated with

Also associated with

No associations

Rating

F-purity versus log canonicity for polynomials 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 F-purity versus log canonicity for polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and F-purity versus log canonicity for polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-708261