Stanley depth and simplicial spanning trees
From MaRDI portal
Publication:494301
DOI10.1007/s10801-015-0589-yzbMath1319.05157arXiv1410.3666OpenAlexW1993399858MaRDI QIDQ494301
Publication date: 31 August 2015
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.3666
Trees (05C05) Syzygies, resolutions, complexes and commutative rings (13D02) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of commutative algebra (05E40)
Related Items
Stanley depth and the lcm-lattice ⋮ Finite atomic lattices and their monomial ideals ⋮ Betti posets and the Stanley depth ⋮ How to compute the Stanley depth of a module
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite atomic lattices and resolutions of monomial ideals
- Stanley decompositions and Hilbert depth in the Koszul complex
- The behavior of Stanley depth under polarization
- SCIP: solving constraint integer programs
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- Linear Diophantine equations and local cohomology
- The lcm-lattice in monomial resolutions
- The Alexander duality functors and local duality with monomial support
- Stanley depth and the lcm-lattice
- Stanley decompositions and partitionable simplicial complexes
- How to compute the Stanley depth of a monomial ideal
- LCM Lattices and Stanley Depth: A First Computational Approach
- How to compute the multigraded Hilbert depth of a module
- Frames and degenerations of monomial resolutions
- Skeletons of monomial ideals
- Two lower bounds for the Stanley depth of monomial ideals
- Four Generated, Squarefree, Monomial Ideals
- Simplicial matrix-tree theorems
- Monomial Ideals
- A Survey on Stanley Depth
- An Algorithm for Computing the Multigraded Hilbert Depth of a Module
- Depth of factors of square free monomial ideals
This page was built for publication: Stanley depth and simplicial spanning trees
