LCM Lattices and Stanley Depth: A First Computational Approach
Ver/ Abrir
Impacto
Scholar |
Otros documentos de la autoría: Ichim, Bogdan; Katthän, Lukas; Moyano-Fernández, Julio José
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
LCM Lattices and Stanley Depth: A First Computational ApproachFecha de publicación
2015-10Editor
Taylor & FrancisCita bibliográfica
ICHIM, Bogdan; KATTHÄN, Lukas; MOYANO-FERNÁNDEZ, Julio José. LCM Lattices and Stanley Depth: A First Computational Approach. Experimental Mathematics, 2016, vol. 25, no 1, p. 46-53.Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://www.tandfonline.com/doi/full/10.1080/10586458.2015.1005257?scroll=top&nee ...Versión
info:eu-repo/semantics/sumittedVersionPalabras clave / Materias
Resumen
Let K be a field, and let S D K [X1, . . . ,Xn] be the polynomial ring.
Let / be a monomial ideal of S with up to 5 generators. In this paper, we present
a computational experiment which allows us to prove that
depthS ... [+]
Let K be a field, and let S D K [X1, . . . ,Xn] be the polynomial ring.
Let / be a monomial ideal of S with up to 5 generators. In this paper, we present
a computational experiment which allows us to prove that
depthS S / I D sdepthS S / I < sdepthS I.
This shows that the Stanley conjecture is true for S/I and I, if I can be generated
by at most 5 monomials. The result also brings additional computational evidence
for a conjecture made by Herzog. [-]
Publicado en
Experimental Mathematics, 2016, vol. 25, no 1Derechos de acceso
© 2015 Taylor & Francis
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- MAT_Articles [761]