{"paper":{"title":"F-purity versus log canonicity for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.AC","authors_text":"Daniel J. Hern\\'andez","submitted_at":"2011-12-12T02:27:57Z","abstract_excerpt":"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 in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.2423","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}