A theorem on higher Bruhat orders

DOI10.1007/PL00009485zbMath0996.52016OpenAlexW1992761246MaRDI QIDQ1961856

Helmut Weil, Stefan Felsner

Publication date: 30 January 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009485

zbMATH Keywords

higher Bruhat ordersinclusion ordersingle-step inclusion

Mathematics Subject Classification ID

Oriented matroids in discrete geometry (52C40) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

Related Items (17)

On interrelations between strongly, weakly and chord separated set-systems (a geometric approach) ⋮ Diameter of the commutation classes graph of a permutation ⋮ Complete graph drawings up to triangle mutations ⋮ Higher Bruhat orders in type B ⋮ Cubillages of cyclic zonotopes ⋮ Distances on rhombus tilings ⋮ Minimal representations of order types by geometric graphs ⋮ Majority rule on rhombus tilings and Condorcet super-domains ⋮ Minimal Representations of Order Types by Geometric Graphs ⋮ Acyclic sets of linear orders via the Bruhat orders ⋮ Sweeps, arrangements and signotopes ⋮ Homotopy type of intervals of the second higher Bruhat orders ⋮ Arrangements of pseudocircles: on circularizability ⋮ Distances on Lozenge Tilings ⋮ Unnamed Item ⋮ Diameter of graphs of reduced words and galleries ⋮ Fan realizations of type \(A\) subword complexes and multi-associahedra of rank 3

This page was built for publication: A theorem on higher Bruhat orders