Preprint
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.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- ASYMPTOTIC DEGREE OF RANDOM MONOMIAL IDEALSJournal of Commutative Algebra, 2023
- Monomial ideals with large projective dimensionJournal of Pure and Applied Algebra, 2020
- Random flag complexes and asymptotic syzygiesAlgebra & Number Theory, 2018
- Minimal resolutions of dominant and semidominant idealsJournal of Pure and Applied Algebra, 2017
- The Eliahou-Kervaire resolution is cellularJournal of Commutative Algebra, 2010
- Minimal free resolutions that are not supported by a CW-complexJournal of Algebra, 2008
- Lyubeznik's Resolution and Rooted ComplexesJournal of Algebraic Combinatorics, 2002
- Generic and Cogeneric Monomial IdealsJournal of Symbolic Computation, 2000
- Cellular resolutions of monomial modulesJournal für die reine und angewandte Mathematik (Crelles Journal), 1998
- Minimal resolutions of some monomial idealsJournal of Algebra, 1990