Monomial divisibility diagrams represent monomial ideals as compact DAGs via maximal subtree sharing, enabling faster membership queries than generator lists with divmasks and delivering speed-ups in Gröbner basis algorithms.
Cox, John Little, and Donal O’Shea
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A data structure for monomial ideals with applications to signature Gr\"obner bases
Monomial divisibility diagrams represent monomial ideals as compact DAGs via maximal subtree sharing, enabling faster membership queries than generator lists with divmasks and delivering speed-ups in Gröbner basis algorithms.