Stasheff polytope as a sublattice of permutohedron
| dc.contributor.author | Adaricheva, Kira | |
| dc.date.accessioned | 2016-02-09T04:19:43Z | |
| dc.date.available | 2016-02-09T04:19:43Z | |
| dc.date.issued | 2011 | |
| dc.description.abstract | An assosiahedron Kn, known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points in Rn, forming (n ā 1)-dimensional polytope1. A permutahedron Pn is a polytope of dimension (nā1) in Rn with vertices forming various permutations of n-element set. There exists well-known orderings of vertices of Pn and Kn that make these objects into lattices: the first known as permutation lattices, and the latter as Tamari lattices. We provide a new proof to the statement that the vertices of Kn can be naturally associated with particular vertices of Pn in such a way that the corresponding lattice operations are preserved. In lattices terms, Tamari lattices are sublattices of permutation lattices. The fact was established in 1997 in paper by Bjorner and Wachs, but escaped the attention of lattice theorists. Our approach to the proof is based on presentation of points of an associahedron Kn via so-called bracketing functions. The new fact that we establish is that the embedding preserves the height of elements | ru_RU |
| dc.identifier.citation | Adaricheva Kira; 2011; Stasheff polytope as a sublattice of permutohedron; arXiv.org | ru_RU |
| dc.identifier.uri | http://nur.nu.edu.kz/handle/123456789/1204 | |
| dc.language.iso | en | ru_RU |
| dc.rights | Attribution-NonCommercial-ShareAlike 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/3.0/us/ | * |
| dc.subject | Research Subject Categories::MATHEMATICS | ru_RU |
| dc.subject | Stasheff polytope | ru_RU |
| dc.title | Stasheff polytope as a sublattice of permutohedron | ru_RU |
| dc.type | Article | ru_RU |