Computing generalized Frobenius powers of monomial ideals

MaRDI QIDQ6341696zbMATH OpenFDO

Authors Christopher A. Francisco, Matthew Mastroeni, Jeffrey Mermin, Jay Schweig

Publication date 29 May 2020

Mathematics Subject Classification ID

Characteristic (p) methods (Frobenius endomorphism) and reduction to characteristic (p); tight closure (13A35) Linear programming (90C05)

Abstract: Generalized Frobenius powers of an ideal were introduced in work of Hern'andez, Teixeira, and Witt as characteristic-dependent analogs of test ideals. However, little is known about the Frobenius powers and critical exponents of specific ideals, even in the monomial case. We describe an algorithm to compute the critical exponents of monomial ideals and use this algorithm to prove some results about their Frobenius powers and critical exponents. Rather than using test ideals, our algorithm uses techniques from linear optimization.

This page was built for publication: Computing generalized Frobenius powers of monomial ideals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6341696)