2014
DOI: 10.1090/s0002-9939-2014-12260-x
|View full text |Cite
|
Sign up to set email alerts
|

$F$-invariants of diagonal hypersurfaces

Abstract: In this note, we derive formulas for the F -pure threshold, higher jumping numbers, and test ideals of diagonal and Fermat hypersurfaces. For these hypersurfaces, we answer a question of Schwede regarding the denominators of F -pure thresholds, and obtain tight upper bounds for the number of higher jumping numbers. Our results are valid over all (or all but finitely many) characteristics, and therefore allow us to construct examples in which the characteristic p setting is drastically different than that over … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
16
0
1

Year Published

2014
2014
2019
2019

Publication Types

Select...
5
1

Relationship

2
4

Authors

Journals

citations
Cited by 19 publications
(18 citation statements)
references
References 17 publications
1
16
0
1
Order By: Relevance
“…The deformation space in (4) refers to embedded deformations of X ⊂ P n ; if n 5, this coincides with the versal deformation space of X as an abstract variety (see Remark 4.7). The following example from [He2] shows that all possible values of h from (1) above are indeed attained:…”
Section: Calabi-yau Hypersurfacesmentioning
confidence: 97%
See 1 more Smart Citation
“…The deformation space in (4) refers to embedded deformations of X ⊂ P n ; if n 5, this coincides with the versal deformation space of X as an abstract variety (see Remark 4.7). The following example from [He2] shows that all possible values of h from (1) above are indeed attained:…”
Section: Calabi-yau Hypersurfacesmentioning
confidence: 97%
“…for a proof, see[He2, Theorem 3.1].Proof of Theorem 4.1. If µ f (p) = p, then Lemma 3.4 (1) shows that µ f (q) = q for all q, and assertions (1-3) follow.…”
mentioning
confidence: 99%
“…We point out that for large p or large bounds B, the algorithms given are not feasible. For more effective methods for computing F-pure thresholds in certain cases, we refer the reader to [10,11,12]. Additionally, we refer the reader to [19] for computations of test ideals in a more general (e.g., non-principal) setting.…”
Section: •2 Algorithmsmentioning
confidence: 99%
“…Daniel Hernández has computed many examples of F -thresholds in his PhD thesis (c.f. [24]), including any "diagonal" hypersurfaces x a1 1 + · · · + x an n (see [26]). There is also an algorithm to compute the F -threshold of any binomial as well; see [27], [51].…”
Section: Viewing These Rmentioning
confidence: 99%