Boolean Term Orders and the Root System Bn
Abstract
A boolean term order is a total order on subsets of [n]=1,...,n such that < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha gamma < beta gamma for all gamma which do not intersect alpha or beta. Boolean term orders arise in several different areas of mathematics, including Gr\"obner 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(Bn), where Bn is the root system ei:1 ≤ i ≤ n \ ei ej :1 ≤ i < j ≤ 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.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.