Skip to main content Accessibility help
×
Home

Triangulations of cyclic polytopes and higher Bruhat orders

  • Jörg Rambau (a1)

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.

Copyright

References

Hide All
1.Bayer, M. M.. Equidecomposable and weakly neighborly polytopes. Israel Journal of Mathematics, 81 (1993), 301320.
2.Billera, L. J., Filliman, P. and Sturmfels, B., Constructions and complexity of secondary polytopes. Advances in Mathematics, 83 (1990), 155179.
3.Billera, L. J., Gelfand, I. M. and Sturmfels, B.. Duality and minors of secondary polyhedra. Journal of Combinatorial Theory, Series B, 57 (1993), 258268.
4.Billera, L. J., Kapranov, M. M. and Sturmfels, B.. Cellular strings on polytopes. Proceedings of the American Mathematical Society, 122 (1994), 549555.
5.Björner, A., Vergnas, M. Las, Sturmfels, B., White, N. and Ziegler, G. M.. Oriented Matroids, Encyclopedia of Mathematics, Vol. 46 (Cambridge University Press, Cambridge, 1993)
6.Loera, J. de. Triangulations of Polytopes and Computational Algebra, Ph.D. thesis (Cornell University, 1995).
7.Edelman, P. H. and Reiner, V.. The higher Stasheff Tamari posets. Mathematika, 43 (1996), 127154.
8.Edelsbrunner, H.. Algorithms in Geometry and Topology, Course script 497 (University of Illinois, Urbana-Champaign, Spring 1993).
9.Gelfand, I. M., Kapranov, M. M. and Zelevinsky, A. V.. Discriminants of polynomials in several variables and triangulations of Newton polyhedra. Leningrad Mathematical Journal, 2 (1991), 449505.
10.Grünbaum, B.. Convex Polytopes (Interscience, London, 1967).
11.Joe, B.. Three dimensional triangulations from local transformations. SIAM Journal of Scientific Statistical Computation, 10 (1989), 718741.
12.Kapranov, M. M. and Voevodsky, V. A.. Combinatorial-geometric aspects of polycategory theory: pasting schemes and higher Bruhat orders (list of results). Cahiers de Topologie et Géométrie différentielle catégoriques, 32 (1991), 1127.
13.Lee, C.. Triangulations of polytopes. CRC Handjournal of Discrete and Computational Geometry (Goodman, J. E. and O'Rourke, J., eds.), (CRC-Press, 1997).
14.Loera, J. A. de, Hosten, S., Santos, F. and Sturmfels, B.. The polytope of all triangulations of a point configuration. Documenta Mathematika, (1996), 103119.
15.Manin, Yu. I. and Schechtman, V. V.. Arrangements of hyperplanes, higher braid groups and higher Bruhat orders. Advanced Studies in Pure Mathematics, 17 (1989), 289308.
16.Rambau, J. and Ziegler, G. M.. Projections of polytopes and the Generalized Baues Conjecture. Discrete & Computational Geometry, 16.
17.Ziegler, G. M.. Higher Bruhat orders and cyclic hyperplane arrangements. Topology 32 (1993), 259279.
18.Ziegler, G. M.. Shelling polyhedral 3-balls and 4-polytopes. To appear in Discrete & Computational Geometry.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

Triangulations of cyclic polytopes and higher Bruhat orders

  • Jörg Rambau (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed