Computation of dominant ideals
Anna Maria Bigatti, Nursel Erey, Selvi Kara, Augustine O'Keefe, Sonja Petrović, Pierpaola Santarsiero, Janet Striuli
TL;DR
The paper addresses the problem of when a monomial ideal is dominant and how this property exactly characterizes when the Taylor resolution is minimal. It develops two complementary approaches: combinatorial enumeration under a fixed $\mathrm{lcm}$ and probabilistic sampling via Erdős–Rényi-type models to study dominance in high-dimensional settings. It delivers explicit counting formulas for dominant ideals in low-variable cases, details algorithmic implementations (Macaulay2 and CoCoA), and demonstrates that random sampling can reveal how often dominance occurs depending on the number of generators, degrees, and dimension. This work provides a quantitative, reproducible framework for assessing non-minimality of Taylor resolutions and guides exploration of large spaces of monomial ideals through both exact and stochastic methods.
Abstract
We consider the problem of determining whether a monomial ideal is dominant. This property is critical for determining for which monomial ideals the Taylor resolution is minimal. We first analyze dominant ideals with a fixed least common multiple of generators using combinatorial methods. Then, we adopt a probabilistic approach via the \er\ type model, examining both homogeneous and non-homogeneous cases. This model offers an efficient alternative to exhaustive enumeration, allowing the study of dominance through small random samples, even in high-dimensional settings.
