English

An algorithm for computing compatibly Frobenius split subvarieties

Commutative Algebra 2012-06-01 v3 Algebraic Geometry

Abstract

Let RR be a ring of prime characteristic pp, and let FeRF^e_* R denote RR viewed as an RR-module via the eeth iterated Frobenius map. Given a surjective map ϕ:FeRR\phi : F^e_* R \to R (for example a Frobenius splitting), we exhibit an algorithm which produces all the ϕ\phi-compatible ideals. We also explore a variant of this algorithm under the hypothesis that ϕ\phi is not necessarily a Frobenius splitting (or even surjective). This algorithm, and the original, have been implemented in Macaulay2.

Keywords

Cite

@article{arxiv.1104.1937,
  title  = {An algorithm for computing compatibly Frobenius split subvarieties},
  author = {Mordechai Katzman and Karl Schwede},
  journal= {arXiv preprint arXiv:1104.1937},
  year   = {2012}
}

Comments

15 pages, many statements clarified and numerous other substantial improvements to the exposition (thanks to the referees). To appear in the Journal of Symbolic Computation

R2 v1 2026-06-21T17:52:20.172Z