An algorithm for producing F-pure ideals

TL;DR

This paper introduces an algorithm to compute all F-pure ideals associated with a Cartier map in polynomial rings over finite fields, advancing computational methods in algebraic geometry.

Contribution

It presents a novel algorithm specifically designed for calculating F-pure ideals in polynomial rings over finite fields.

Findings

Algorithm successfully computes F-pure ideals

Efficient method improves existing computational approaches

Applicable to algebraic geometry and commutative algebra problems

Abstract

This paper describes a method for computing all F-pure ideals for a given Cartier map of a polynomial ring over a finite field.