Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T14:45:16.700Z Has data issue: false hasContentIssue false

Triangulations of cyclic polytopes and higher Bruhat orders

Published online by Cambridge University Press:  26 February 2010

Jörg Rambau
Affiliation:
Konrad-Zuse-Zentrum für Informationstechnik, Takustr. 7, D-14195 Berlin, Germany. E-mail: rambau@zib.de
Get access

Abstract

Recently Edelman and Reiner suggested two poset structures, (n, d) and (n, d) on the set of all triangulations of the cyclic d-polytope C(n, d) with n vertices. Both posets are generalizations of the well-studied Tamari lattice. While (n, d) is bounded by definition, the same is not obvious for (n, d). In the paper by Edelman and Reiner the bounds of (n, d) were also confirmed for (n, d) whenever d≤5, leaving the general case as a conjecture.

MSC classification

Information

Type
Research Article
Copyright
Copyright © University College London 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable