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)\) .
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received April 7, 1998.
Rights and permissions
About this article
Cite this article
Felsner, S., Weil, H. A Theorem on Higher Bruhat Orders. Discrete Comput Geom 23, 121–127 (2000). https://doi.org/10.1007/PL00009485
Issue Date:
DOI: https://doi.org/10.1007/PL00009485