Mustaţă defined Bernstein-Sato polynomials in prime characteristic for principal ideals and proved that the roots of these polynomials are related to the F F -jumping numbers of the ideal. This approach was later refined by Bitoun. Here we generalize these techniques to develop analogous notions for the case of arbitrary ideals and prove that these have similar connections to F F -jumping numbers.
more »
« less
Globally $\pmb{+}$-regular varieties and the minimal model program for threefolds in mixed characteristic
Abstract We establish the Minimal Model Program for arithmetic threefolds whose residue characteristics are greater than five. In doing this, we generalize the theory of global $$F$$ F -regularity to mixed characteristic and identify certain stable sections of adjoint line bundles. Finally, by passing to graded rings, we generalize a special case of Fujita’s conjecture to mixed characteristic.
more »
« less
- PAR ID:
- 10423301
- Date Published:
- Journal Name:
- Publications mathématiques de l'IHÉS
- ISSN:
- 0073-8301
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We use the framework of perfectoid big Cohen-Macaulay (BCM) algebras to define a class of singularities for pairs in mixed characteristic, which we call purely BCM-regular singularities, and a corresponding adjoint ideal. We prove that these satisfy adjunction and inversion of adjunction with respect to the notion of BCM-regularity and the BCM test ideal defined by the first two authors. We compare them with the existing equal characteristic purely log terminal (PLT) and purely F F -regular singularities and adjoint ideals. As an application, we obtain a uniform version of the Briançon-Skoda theorem in mixed characteristic. We also use our theory to prove that two-dimensional Kawamata log terminal singularities are BCM-regular if the residue characteristic p > 5 p>5 , which implies an inversion of adjunction for three-dimensional PLT pairs of residue characteristic p > 5 p>5 . In particular, divisorial centers of PLT pairs in dimension three are normal when p > 5 p > 5 . Furthermore, in Appendix A we provide a streamlined construction of perfectoid big Cohen-Macaulay algebras and show new functoriality properties for them using the perfectoidization functor of Bhatt and Scholze.more » « less
-
We prove that F-injectivity localizes, descends under faithfully flat homomorphisms, and ascends under flat homomorphisms with Cohen–Macaulay and geometrically F-injective fibers, all for arbitrary Noetherian rings of prime characteristic. As a consequence, we show that the F-injective locus is open on most rings arising in arithmetic and geometry. As a geometric application, we prove that over an algebraically closed field of characteristic p > 3, generic projection hypersurfaces associated to suitably embedded smooth projective varieties of dimension ≤5 are F-pure, and hence F-injective. This geometric result is the positive characteristic analogue of a theorem of Doherty.more » « less
-
We generalize Hermite interpolation with error correction, which is the methodology for multiplicity algebraic error correction codes, to Hermite interpolation of a rational function over a field K from function and function derivative values. We present an interpolation algorithm that can locate and correct <= E errors at distinct arguments y in K where at least one of the values or values of a derivative is incorrect. The upper bound E for the number of such y is input. Our algorithm sufficiently oversamples the rational function to guarantee a unique interpolant. We sample (f/g)^(j)(y[i]) for 0 <= j <= L[i], 1 <= i <= n, y[i] distinct, where (f/g)^(j) is the j-th derivative of the rational function f/g, f, g in K[x], GCD(f,g)=1, g <= 0, and where N = (L[1]+1)+...+(L[n]+1) >= C + D + 1 + 2(L[1]+1) + ... + 2(L[E]+1) where C is an upper bound for deg(f) and D an upper bound for deg(g), which are input to our algorithm. The arguments y[i] can be poles, which is truly or falsely indicated by a function value infinity with the corresponding L[i]=0. Our results remain valid for fields K of characteristic >= 1 + max L[i]. Our algorithm has the same asymptotic arithmetic complexity as that for classical Hermite interpolation, namely soft-O(N). For polynomials, that is, g=1, and a uniform derivative profile L[1] = ... = L[n], our algorithm specializes to the univariate multiplicity code decoder that is based on the 1986 Welch-Berlekamp algorithm.more » « less
-
We study the geometry of smooth projective surfaces defined by Frobenius forms, a class of homogenous polynomials in prime characteristic recently shown to have minimal possible F-pure threshold among forms of the same degree. We call these surfaces extremal surfaces, and show that their geometry is reminiscent of the geometry of smooth cubic surfaces, especially non-Frobenius split cubic surfaces. For instance, extremal surfaces have many lines but no triangles, hence many “star points” analogous to Eckardt points on a cubic surface. We generalize the classical notion of a double six for cubic surfaces to a double 2d on an extremal surface of degree d. We show that, asymptotically in d, smooth extremal surfaces have at least (1/16)d^{14} double 2d's. A key element of the proofs is the large automorphism group of an extremal surface, which we show to act transitively on many associated sets, such as the set of triples of skew lines on the extremal surface.more » « less
An official website of the United States government

