[Paper Review] Boolean Term Orders and the Root System B_n

Diane Maclagan|ArXiv.org|Sep 24, 1998

Advanced Combinatorial Mathematics9 references3 citations

TL;DR

This paper establishes a correspondence between boolean term orders on subsets of [n] and one-element extensions of the oriented matroid associated with the root system B_n. It introduces coherence and flip relations for term orders, proves that noncoherent orders exist (including those with flip deficiency), and enumerates such orders for small n, embedding boolean term orders within the Baues problem framework via oriented matroid theory.

ABSTRACT

A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or beta. Boolean term orders arise in several different areas of mathematics, including Gröbner basis theory for the exterior algebra, and comparative probability. The main result of this paper is that boolean term orders correspond to one element extensions of the oriented matroid M(B_n), where B_n is the root system {e_i:1 \leq i \leq n \} \cup {e_i \pm e_j :1 \leq i < j \leq n}. This establishes boolean term orders in the frame work of the Baues problem. We also define a notion of coherence for a boolean term order, and a flip relation between different term orders. Other results include examples of noncoherent term orders, including an example exhibiting flip deficiency, and enumeration of boolean term orders for small values of n.

Motivation & Objective

• To establish a structural correspondence between boolean term orders and one-element extensions of the oriented matroid M(B_n).
• To formalize coherence and flip relations for boolean term orders, enabling classification and comparison of different orders.
• To demonstrate the existence of noncoherent term orders, including those with flip deficiency, using explicit constructions.
• To enumerate boolean term orders for small values of n, providing foundational data for further study.
• To embed the theory of boolean term orders within the broader context of the Baues problem in combinatorial topology.

Proposed method

• Uses the root system B_n = {±e_i} ∪ {±e_i ± e_j | 1 ≤ i < j ≤ n} as the geometric foundation for defining oriented matroid structures.
• Applies oriented matroid theory to characterize one-element extensions of M(B_n), which are shown to classify boolean term orders.
• Introduces a notion of coherence for boolean term orders based on realizability via signed subsets and consistent sign vectors.
• Defines a flip relation between term orders as a minimal transformation preserving the term order axioms.
• Employs combinatorial enumeration techniques to count boolean term orders for small n, with results verified via structural constraints.
• Utilizes the Baues problem framework to interpret the space of boolean term orders as a combinatorial stratification of a geometric object.

Experimental results

Research questions

• RQ1 How are boolean term orders on [n] related to the oriented matroid M(B_n)?
• RQ2 What conditions determine whether a boolean term order is coherent, and how can coherence be characterized combinatorially?
• RQ3 Can noncoherent boolean term orders exist, and if so, can they exhibit flip deficiency?
• RQ4 What is the number of boolean term orders for small values of n, and how do they grow with n?
• RQ5 How does the space of boolean term orders relate to the Baues problem and the structure of the B_n root system?

Key findings

• Boolean term orders are in one-to-one correspondence with one-element extensions of the oriented matroid M(B_n).
• Noncoherent boolean term orders exist, and the paper provides a concrete example demonstrating flip deficiency.
• The number of boolean term orders for n = 1, 2, 3, 4 is explicitly enumerated, with counts increasing rapidly with n.
• Coherence of a boolean term order is characterized by the existence of a consistent sign vector realization in the oriented matroid framework.
• The flip relation defines a minimal transformation between term orders, and the existence of noncoherent orders implies that not all such transformations preserve coherence.
• The framework successfully embeds boolean term orders into the Baues problem, providing a new geometric-combinatorial interpretation.