An algorithm for computing compatibly Frobenius split subvarieties

preprint2012arXivOpen access

Abstract

Let RR be a ring of prime characteristic pp, and let F∗eRF^e_* R denote RR viewed as an RR-module via the eeth iterated Frobenius map. Given a surjective map ϕ:F∗eR→Rϕ: F^e_* R \to R (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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.