Mathematika · 1997 · 65 citations · 12 references
Natural SciencesComputer ScienceMathematicsComputational GeometryDiscrete MathematicsGeometryArithmetic GeometryDelaunay TriangulationsBruhat OrderPoset Topology
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.
12
Constructions and complexity of secondary polytopes
Louis J. Billera, P. Filliman, Bernd Sturmfels · Advances in Mathematics · 1990 · 184 citations
Higher bruhat orders and cyclic hyperplane arrangements
Günter M. Ziegler · Topology · 1993 · 114 citations