Boolean algebra is the poset of subsets of a finite set and projective geometry is the poset of subspaces of a finite dimensional vector space over a finite field with q elements. We discuss q-analogs of two famous results (one bijective and one algebraic) on the Boolean algebra.
1. The bracketing algorithm gives an explicit symmetric chain decomposition (SCD) of the Boolean algebra. Griggs showed (using network flows) the existence of a SCD of the projective geometry. Greene and Kleitman asked for an explicit construction. Bjorner asked whether the projective geometry has a SBD (symmetric Boolean decomposition) (more general than an SCD).
The Greene-Kleitman problem was solved in a remarkable paper of Vogt and Voigt. We build on this paper and give an explicit SBD of the projective geometry. (Joint work with Jonathan Farley)
2. The Terwilliger algebra of the hypercube (= Hasse diagram of the Boolean algebra) is one of the basic objects in algebraic graph theory. It is a natural problem to find its q-analog. This was solved recently in two papers, the first by Ghosh and Srinivasan, and the second by Terwilliger.
If time permits, we shall discuss a possible connection between the two problems.
The study of perfect matchings (and, more generally, of matchings) has played a central role not only in the development of graph theory, but also in the growth of various other areas of combinatorics such as polyhedral combinatorics, enumerative combinatorics, combinatorial optimization, etc. For most problems pertaining to perfect matchings, one may restrict attention to matching covered graphs — that is, those connected graphs wherein each edge participates in some perfect matching. Ergo, for more than half a century now, several researchers have invested in developing an extensive theory, and these efforts have culminated in the recently published book "Perfect Matchings: A Theory of Matching Covered Graphs" by Lucchesi and Murty. This minicourse is inspired by, and will be based on, their monograph.
The objectives of this minicouse are twofold: firstly, to introduce the participants to the salient features of the aforementioned theory — especially, the tight cut decomposition theory (including Lovász's Uniqueness Theorem) and the ear decomposition theory (that drew inspiration from the well-known Whitney's Ear Decomposition Theorem); and secondly, to demonstrate their interplay towards solving various problems — most of which were major open problems back in the day. Time permitting, we will also discuss open problems as well as their special cases that are already solved.