How to compute the Stanley depth of a module

DOI10.1090/MCOM/3106MaRDI QIDQ2826690zbMATH OpenOpenAlexFDO

Authors Lukas Katthän, Julio-José Moyano-Fernández, Bogdan Ichim

Publication date 18 October 2016

Published in Mathematics of Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1503.00910, http://hdl.handle.net/10234/167065

zbMATH Keywords

graded modulesHilbert depthStanley decompositionStanley depth

Mathematics Subject Classification ID

Partitions of sets (05A18) Combinatorial aspects of commutative algebra (05E40) Graded rings and modules (associative rings and algebras) (16W50)

Abstract: In this paper we introduce an algorithm for computing the Stanley depth of a finitely generated multigraded module $M$ over the polynomial ring $mathbbK[X_1,ldots,X_n]$. As an application, we give an example of a module whose Stanley depth is strictly greater than the depth of its syzygy module. In particular, we obtain complete answers for two open questions raised by Herzog. Moreover, we show that the question whether $M$ has Stanley depth at least $r$ can be reduced to the question whether a certain combinatorially defined polytope $mathscrP$ contains a $mathbb{Z}^n$-lattice point.

Recommendations

• An Algorithm for Computing the Multigraded Hilbert Depth of a Module
• How to compute the multigraded Hilbert depth of a module
• How to compute the Stanley depth of a monomial ideal
• LCM Lattices and Stanley Depth: A First Computational Approach
• An algorithm to compute the Hilbert depth

Cites work

• A new transvectant algorithm for nilpotent normal forms
• A non-partitionable Cohen-Macaulay simplicial complex
• A survey on Stanley depth
• An Algorithm for Computing the Multigraded Hilbert Depth of a Module
• An algorithm to compute the Hilbert depth
• Computing combinatorial decompositions of rings
• Discrete polymatroids
• Exploiting polyhedral symmetries in social choice
• How to compute the multigraded Hilbert depth of a module
• How to compute the Stanley depth of a monomial ideal
• scientific article; zbMATH DE number 5620826 (Why is no real title available?)
• scientific article; zbMATH DE number 3580532 (Why is no real title available?)
• scientific article; zbMATH DE number 704831 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Linear Diophantine equations and local cohomology
• Normaliz: Algorithms for affine monoids and rational cones
• On a conjecture of R. P. Stanley. I: Monomial ideals
• On the structure of nilpotent normal form modules
• Remarks on Hilbert series of graded modules over polynomial rings
• SCIP: solving constraint integer programs
• Stanley decomposition of the joint covariants of three quadratics
• Stanley decompositions and Hilbert depth in the Koszul complex
• Stanley depth and simplicial spanning trees
• The Alexander duality functors and local duality with monomial support
• The power of pyramid decomposition in Normaliz

Cited in

(7)

• Depth and Stanley depth of edge ideals associated to some line graphs
• An algorithm to compute the Hilbert depth
• Stanley depth and the lcm-lattice
• Combinatorial reductions for the Stanley depth of I and S/I
• How to compute the multigraded Hilbert depth of a module
• Standard decompositions in generic coordinates
• scientific article; zbMATH DE number 5620826 (Why is no real title available?)

Describes a project that uses

Uses Software

• Normaliz
• SCIP
• Hdepth

This page was built for publication: How to compute the Stanley depth of a module

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826690)