You are here

Flavors of the Fubini-Bruhat Order

Stark Ryan, University of Washington
Wednesday, June 1, 2022 - 4:00pm to 5:00pm
PDL C-38 and via Zoom Link:
Stark Ryan
Stark Ryan


Fubini words are generalized permutations, allowing for repeated letters, and they are in one-to-one correspondence with ordered set partitions. Brendan Pawlowski and Brendon Rhoades extended permutation matrices to pattern matrices for Fubini words. Under a lower triangular action, these pattern matrices produce cells in projective space, specifically \$(\mathbb P^{k−1})^n\$. The containment of the cell closures in the Zariski topology gives rise to a poset which generalizes the Bruhat order for permutations. Unlike Bruhat order, containment is not equivalent to intersection of a cell with the closure of another cell. This allows for a refinement of the poset. It is additionally possible to define a weaker order, giving rise to a subposet containing all the elements. We call these orders, in order of decreasing strength, the espresso, medium roast, and decaf Fubini-Bruhat orders. Hence, the title “Flavors of the Fubini-Bruhat Order.” The espresso and medium roast orders are not ranked in general. The decaf order is ranked by codimension of the corresponding cells. In fact, the decaf order has rank generating function given by a well-known \$q\$-analog of the Stirling numbers of the second kind. In this talk, we give increasingly smaller sets of equations describing the cell closures, which lead to several different combinatorial descriptions for the relations in all three orders. We also describe a few classes of covering relations in each of the orders.

Note: There will be no pre-seminar: the main talk starts at 4:00.

Join Zoom Meeting:
Meeting ID: 915 4733 5974