On Enumerating Higher Bruhat Orders Through Deletion and Contraction

TL;DR

This paper advances the enumeration of higher Bruhat orders by improving bounds, proving formulas, establishing bijections with plane partitions, and introducing deletion, contraction, duals, and weaving functions to deepen understanding of their structure.

Contribution

It introduces deletion and contraction operations for higher Bruhat orders, proves Ziegler's enumeration formula for a specific case, and links these orders to plane partitions and encoding methods.

Findings

Improved exponential bounds on the size of higher Bruhat orders.

Proved Ziegler's formula for |(n,n-3)|.

Established a bijection with totally symmetric plane partitions.

Abstract

The higher Bruhat orders $\mathcal{B}(n,k)$ were introduced by Manin-Schechtman to study discriminantal hyperplane arrangements and subsequently studied by Ziegler, who connected $\mathcal{B}(n,k)$ to oriented matroids. In this paper, we consider the enumeration of $\mathcal{B}(n,k)$ and improve upon Balko's asymptotic lower and upper bounds on $|\mathcal{B}(n,k)|$ by a factor exponential in $k$. A proof of Ziegler's formula for $|\mathcal{B}(n,n-3)|$ is given and a bijection between a certain subset of $\mathcal{B}(n,n-4)$ and totally symmetric plane partitions is proved. Central to our proofs are deletion and contraction operations for the higher Bruhat orders, defined in analogy with matroids. Dual higher Bruhat orders are also introduced, and we construct isomorphisms relating the higher Bruhat orders and their duals. Additionally, weaving functions are introduced to generalize Felsner's encoding of elements in $\mathcal{B}(n,2)$ to all higher Bruhat orders $\mathcal{B}(n,k)$.