How to compute the Stanley depth of a module
![Thumbnail](/xmlui/bitstream/handle/10234/167065/14459.pdf.jpg?sequence=11&isAllowed=y)
Visualitza/
Impacte
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
Metadades
Mostra el registre complet de l'elementcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONMetadades
Títol
How to compute the Stanley depth of a moduleData de publicació
2017Editor
American Mathematical SocietyISSN
0025-5718; 1088-6842Tipus de document
info:eu-repo/semantics/articleVersió de l'editorial
http://www.ams.org/journals/mcom/2017-86-303/home.htmlVersió
info:eu-repo/semantics/sumittedVersionResum
In this paper we introduce an algorithm for computing the Stanleydepth of a finitely generated multigraded module M over the polynomialring K[X1,...,Xn]. As an application, we give an example of a module whoseStanley ... [+]
In this paper we introduce an algorithm for computing the Stanleydepth of a finitely generated multigraded module M over the polynomialring K[X1,...,Xn]. As an application, we give an example of a module whoseStanley 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 leastr can be reduced to the question whether a certain combinatorially definedpolytope P contains a Zn-lattice point. [-]
Publicat a
MATHEMATICS OF COMPUTATION Volume 86, Number 303, January 2017, Pages 455–472Drets d'accés
(c) 2016 American Mathematical Society.
"First published in MATHEMATICS OF COMPUTATION in volume 86 and number 303, January 2017, published by the American Mathematical Society"
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Apareix a les col.leccions
- MAT_Articles [765]