Stanley depth and simplicial spanning trees
From MaRDI portal
Publication:494301
DOI10.1007/S10801-015-0589-YzbMATH Open1319.05157arXiv1410.3666OpenAlexW1993399858MaRDI QIDQ494301FDOQ494301
Authors: Lukas Katthän
Publication date: 31 August 2015
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Abstract: We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a simplex. We apply this result to verify the Stanley conjecture for quotients of monomial ideals with up to six generators. For seven generators we obtain a partial result.
Full work available at URL: https://arxiv.org/abs/1410.3666
Recommendations
Trees (05C05) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of commutative algebra (05E40) Syzygies, resolutions, complexes and commutative rings (13D02)
Cites Work
- SCIP: solving constraint integer programs
- Title not available (Why is that?)
- Stanley decompositions and partitionable simplicial complexes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monomial Ideals
- Linear Diophantine equations and local cohomology
- The Alexander duality functors and local duality with monomial support
- How to compute the Stanley depth of a monomial ideal
- Two lower bounds for the Stanley depth of monomial ideals
- The behavior of Stanley depth under polarization
- A survey on Stanley depth
- Simplicial matrix-tree theorems
- Frames and degenerations of monomial resolutions
- Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
- The lcm-lattice in monomial resolutions
- How to compute the multigraded Hilbert depth of a module
- Stanley decompositions and Hilbert depth in the Koszul complex
- Depth of factors of square free monomial ideals
- Finite atomic lattices and resolutions of monomial ideals
- Stanley depth and the lcm-lattice
- LCM Lattices and Stanley Depth: A First Computational Approach
- Skeletons of monomial ideals
- Four generated, squarefree, monomial ideals
- An Algorithm for Computing the Multigraded Hilbert Depth of a Module
Cited In (7)
- Combinatorial reductions for the Stanley depth of \(I\) and \(S/I\)
- 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
- Depth functions and mutidimensional medians on minimal spanning trees
- Depths and Stanley depths of path ideals of spines
Uses Software
This page was built for publication: Stanley depth and simplicial spanning trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494301)