Stanley depth and simplicial spanning trees

DOI10.1007/S10801-015-0589-YMaRDI QIDQ494301zbMATH OpenOpenAlexFDO

Authors Lukas Katthän

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

zbMATH Keywords

monomial idealStanley conjectureStanley depthLCM lattice

Mathematics Subject Classification ID

Trees (05C05) Simplicial sets and complexes in algebraic topology (55U10) Combinatorial aspects of commutative algebra (05E40) Syzygies, resolutions, complexes and commutative rings (13D02)

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.

Recommendations

• Depths and Stanley depths of path ideals of spines
• Stanley depth of monomial ideals with small number of generators
• Stanley decompositions and partitionable simplicial complexes
• Skeletons of monomial ideals
• Graph and depth of a monomial squarefree ideal

Cites work

• scientific article; zbMATH DE number 1194481 (Why is no real title available?)
• scientific article; zbMATH DE number 863503 (Why is no real title available?)
• scientific article; zbMATH DE number 2190625 (Why is no real title available?)
• A survey on Stanley depth
• An Algorithm for Computing the Multigraded Hilbert Depth of a Module
• Depth of factors of square free monomial ideals
• Enumeration of \({\mathbb{Q}}\)-acyclic simplicial complexes
• Finite atomic lattices and resolutions of monomial ideals
• Four generated, squarefree, monomial ideals
• Frames and degenerations of monomial resolutions
• How to compute the Stanley depth of a monomial ideal
• How to compute the multigraded Hilbert depth of a module
• LCM Lattices and Stanley Depth: A First Computational Approach
• Linear Diophantine equations and local cohomology
• Monomial Ideals
• SCIP: solving constraint integer programs
• Simplicial matrix-tree theorems
• Skeletons of monomial ideals
• Stanley decompositions and Hilbert depth in the Koszul complex
• Stanley decompositions and partitionable simplicial complexes
• Stanley depth and the lcm-lattice
• The Alexander duality functors and local duality with monomial support
• The behavior of Stanley depth under polarization
• The lcm-lattice in monomial resolutions
• Two lower bounds for the Stanley depth of monomial ideals

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

Describes a project that uses

Uses Software

• Hdepth
• SCIP

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)