pith. sign in

arxiv: 1104.1937 · v3 · pith:NNOODLCCnew · submitted 2011-04-11 · 🧮 math.AC · math.AG

An algorithm for computing compatibly Frobenius split subvarieties

classification 🧮 math.AC math.AG
keywords algorithmfrobeniussplittingsurjectivebeencharacteristiccompatiblecompatibly
0
0 comments X
read the original abstract

Let $R$ be a ring of prime characteristic $p$, and let $F^e_* R$ denote $R$ viewed as an $R$-module via the $e$th iterated Frobenius map. Given a surjective map $\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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.