An algorithm for computing compatibly Frobenius split subvarieties

DOI10.1016/j.jsc.2012.02.004zbMath1250.13004arXiv1104.1937OpenAlexW2076888520MaRDI QIDQ414631

Karl Schwede, Mordechai Katzman

Publication date: 11 May 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1104.1937

zbMATH Keywords

algorithmFrobenius maptest idealFrobenius splittingprime characteristiccompatibly split

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Characteristic (p) methods (Frobenius endomorphism) and reduction to characteristic (p); tight closure (13A35)

Related Items (8)

Local 𝔪-adic constancy of F-pure thresholds and test ideals ⋮ Annihilators of Artinian modules compatible with a Frobenius map ⋮ A generalization of the Katzman-Zhang algorithm ⋮ Frobenius split subvarieties pull back in almost all characteristics ⋮ An algorithm for producing F-pure ideals ⋮ $D$-module and $F$-module length of local cohomology modules ⋮ Strong test ideals associated to Cartier algebras ⋮ Fsplitting

Uses Software

• Macaulay2
• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Discreteness and rationality of \(F\)-thresholds
• \(F\)-adjunction
• Centers of \(F\)-purity
• Discreteness and rationality of \(F\)-jumping numbers on singular varieties
• The Frobenius structure of local cohomology
• Frobenius splitting methods in geometry and representation theory
• Finiteness of the Number of Compatibly Split Subvarieties
• Graded annihilators of modules over the Frobenius skew polynomial ring, and tight closure
• Parameter-test-ideals of Cohen–Macaulay rings
• F-Purity and Rational Singularity
• SINGULAR

This page was built for publication: An algorithm for computing compatibly Frobenius split subvarieties