Mostrar el registro sencillo

dc.contributor.authorSantos, Francisco 
dc.contributor.authorStump, Christian
dc.contributor.authorWelker, Volkmar
dc.contributor.otherUniversidad de Cantabriaes_ES
dc.date.accessioned2024-12-04T14:54:18Z
dc.date.available2024-12-04T14:54:18Z
dc.date.issued2014
dc.identifier.issn1462-7264
dc.identifier.issn1365-8050
dc.identifier.otherMTM2011-22792es_ES
dc.identifier.urihttps://hdl.handle.net/10902/34560
dc.description.abstractWe study a natural generalization of the noncrossing relation between pairs of elements in [n] to k-tuples in [n]. We show that the flag simplicial complex on ( [n] k ) induced by this relation is a regular, unimodular and flag triangulation of the order polytope of the poset given by the product [k] × [n − k] of two chains, and it is the join of a simplex and a sphere (that is, it is a Gorenstein triangulation). This shows the existence of a flag simplicial polytope whose Stanley-Reisner ideal is an initial ideal of the Graßmann-Plucker ideal, while previous constructions of such ¨ a polytope did not guaranteed flagness. The simplicial complex and the polytope derived from it naturally reflect the relations between Graßmannians with different parameters, in particular the isomorphism Gk,n ≅ Gn−k,n. This simplicial complex is closely related to the weak separability complex introduced by Zelevinsky and Leclerc.es_ES
dc.description.sponsorshipSupported by the Spanish Ministry of Science (MICINN) through grant MTM2011-22792, and by a Humboldt Research Award of the Alexander von Humboldt Foundation.es_ES
dc.format.extent12 p.es_ES
dc.language.isoenges_ES
dc.publisherEpisciences.orges_ES
dc.rights© 2014 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, Francees_ES
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.sourceDiscrete Mathematics and Theoretical Computer Science, 2014, 609-620es_ES
dc.subject.otherGraßmannianes_ES
dc.subject.otherAssociahedrones_ES
dc.subject.otherCrossinges_ES
dc.subject.otherOrder polytopees_ES
dc.subject.otherTriangulationes_ES
dc.titleNoncrossing sets and a Graßmann associahedrones_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.relation.publisherVersionhttps://doi.org/10.46298/dmtcs.2427es_ES
dc.rights.accessRightsopenAccesses_ES
dc.identifier.DOI10.46298/dmtcs.2427
dc.type.versionpublishedVersiones_ES


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo

© 2014 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, FranceExcepto si se señala otra cosa, la licencia del ítem se describe como © 2014 Discrete Mathematics and Theoretical Computer Science (DMTCS), Nancy, France