An algorithm for computing compatibly Frobenius split subvarieties
Commutative Algebra
2012-06-01 v3 Algebraic Geometry
Abstract
Let be a ring of prime characteristic , and let denote viewed as an -module via the th iterated Frobenius map. Given a surjective map (for example a Frobenius splitting), we exhibit an algorithm which produces all the -compatible ideals. We also explore a variant of this algorithm under the hypothesis that is not necessarily a Frobenius splitting (or even surjective). This algorithm, and the original, have been implemented in Macaulay2.
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