arXiv · 2504.12146
Computation of dominant ideals
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Anna Maria Bigatti, Nursel Erey, Selvi Kara, Augustine O'Keefe, Sonja Petrović, Pierpaola Santarsiero, Janet Striuli. 2025-04-16. Computation of dominant ideals. https://arxiv.org/abs/2504.12146
Cite the original work for its findings. Save a collection to share your selection of sources.