An algorithm for computing compatibly Frobenius split subvarieties

Abstract

Let R be a ring of prime characteristic p, and let Fe* R denote R viewed as an R-module via the eth iterated Frobenius map. Given a surjective map φ : Fe* R 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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…