Discrete & Computational Geometry

January 2000, Volume 23, Issue 1, pp 121–127 | Cite as

A Theorem on Higher Bruhat Orders

• Authors
• Authors and affiliations

• S. Felsner
• H. Weil

• 73 Downloads
• 8 Citations

Abstract.

We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n,2) , i.e., \(B(n,2) = B_\subseteq(n,2)\) .

Keywords

Bruhat Order Inclusion Order High Bruhat Order 

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download to read the full article text

Copyright information

© Springer-Verlag New York Inc. 2000

Authors and Affiliations

• S. Felsner
  • 1
• H. Weil
  • 1

1. 1.Fachbereich Mathematik und Informatik, Freie Universität Berlin, Takustrasse 9, 14195 Berlin, Germany felsner@inf.fu-berlin.de, weil@inf.fu-berlin.deDE