---
title: Poset of Parabolic Cosets
url: https://www.emergentmind.com/topics/poset-of-parabolic-cosets
type: topic
---

# Poset of Parabolic Cosets

The poset of parabolic cosets is an order-theoretic structure attached to parabolic subgroups in Coxeter-type and Artin-type settings. In the finite Coxeter case, if \(W\) is a finite Coxeter group with intersection lattice \(L\) of reflecting hyperplanes, the basic object is
\[
P=\biguplus_{X\in L} W/W_X=\{\,wW_X : w\in W,\ X\in L\,\},
\]
ordered by inclusion of subsets, where
\[
W_X=\{\,w\in W : X\subseteq \mathrm{Fix}(w)\,\}.
\]
This poset sits at the intersection of Coxeter complexes, Bruhat order, Schubert geometry, and representation theory. Closely related, but distinct, order structures arise from parabolic double cosets, from intersections of Bruhat intervals with parabolic cosets, and from inclusion posets of parabolic subgroups and cosets in Artin groups [2509.11905][1612.00736][2204.11959].

## 1. Definitions and competing order conventions

For a finite Coxeter group \(W\) of rank \(n\), the parabolic coset poset \(P\) is defined by inclusion of cosets \(wW_X\), with \(X\) ranging over the intersection lattice \(L\) of the reflecting arrangement. The group \(W\) acts on \(P\) by left multiplication. The interval \([\{w\},W]\) in \(P\) is isomorphic to \(L\), the order ideal below any element \(wW_X\) is itself the parabolic coset poset for \(W_X\), \(P\) has a unique maximum \(W\), and its minimal elements are the singletons \(\{w\}\) [2509.11905].

A classical precursor is the Coxeter complex: for a Coxeter system \((W,S)\), the set of ordinary one-sided cosets \(wW_I\), with \(I\subseteq S\), forms the Coxeter complex of \(W\). This one-sided theory is substantially older and better understood than the double-coset theory [1612.00736].

A recurring source of ambiguity is that the literature studies several related posets under nearby names.

| Setting | Elements | Order |
|---|---|---|
| Finite Coxeter parabolic coset poset | \(wW_X\) | Inclusion |
| Finite Coxeter parabolic double-coset system | \(W_I w W_J\) | Reverse containment |
| Symmetric-group contingency-table model | Tables for \(S_\lambda\backslash S_n/S_\mu\) | Majorization or related containment/intersection orders |

The double-coset analogue is not merely a rephrasing of the one-sided poset. For finite Coxeter groups, the set \(\Delta(W)\) of all parabolic double cosets \(W_I w W_J\) is equipped with the partial order
\[
Y\leq X \iff X\subseteq Y,
\]
that is, reverse containment [1907.11801]. In the symmetric group, parabolic double cosets are also modeled by contingency tables, and the resulting collection carries a majorization order with explicit probabilistic meaning [2102.04576].

## 2. Topology and representation theory of the finite Coxeter poset

The most developed global theory concerns the finite Coxeter poset \(P\). It is Cohen–Macaulay, and for the proper part \(\bar P=P-\{W\}\), the unique nonzero reduced homology group occurs in degree \(n-1\). If \(\tilde H_{n-1}(\bar P)\) carries character \(\xi\), then
\[
\xi = (-1)^{n}\sum_{X\in L}\mu(X)\cdot {}_X,
\]
where \(\mu\) is the Möbius function of the intersection lattice and \({}_X=\mathrm{Ind}_{W_X}^W(1)\) is the permutation character of \(W\) acting on \(W/W_X\) [2509.11905].

This formula has a conjugacy-class version. If \(\Theta\subset L\) is a set of representatives for the \(W\)-orbits in \(L\), then
\[
\xi = (-1)^{n}\sum_{X\in \Theta}\mu(X)\cdot [W:N(W_X)]\cdot {}_X.
\]
The same work shows that after tensoring with the sign character \(\varepsilon\), the homology character becomes positive in the natural basis of the parabolic Burnside ring:
\[
\xi\otimes \varepsilon.
\]
That positivity is tied to the positive chamber complex \(C\), defined by taking Weyl chambers lying on the positive side of a generic hyperplane. In this interpretation, the coefficients of \(\xi\otimes\varepsilon\) encode the colored \(h\)-vector of \(C\), while the untwisted expression reflects \(f\)-vector data [2509.11905].

The representation-theoretic description also admits a chamber-combinatorial form. One has
\[
\xi\otimes \varepsilon
 = \sum_{\text{facets } f\in C} {}_{\tau(f)}
 = \sum_{\substack{w\in W\\ w(F)\subset H^+}} {}_{\mathrm{Asc}(w)},
\]
with notation as in the source. This places the poset of parabolic cosets in direct contact with ascent sets, shellings, and chamber enumeration [2509.11905].

## 3. Parabolic cosets inside Bruhat order

A second line of work studies not the global poset \(P\), but the induced order structure obtained by slicing Bruhat intervals by parabolic cosets. For a Coxeter group \(W\), a subset \(J\subseteq S\), and \(w\in W\), one has the decomposition
\[
[e,w]=\bigsqcup_{x\in W^J}\big([e,w]\cap xW_J\big).
\]
If \(x\in W^J\) and \(x\leq w\), then \([e,w]\cap xW_J\) has a unique maximal element in Bruhat order [2204.11959].

This uniqueness extends much further. In an arbitrary Coxeter group, if \([x,y]\cap uW_J\) is nonempty, then it is itself a Bruhat interval with a unique minimal element and a unique maximal element. More precisely, there exist unique \(a,b\in uW_J\) such that
\[
[x,y]\cap uW_J=[a,b]\cap uW_J=[a,b]_{uW_J}.
\]
Thus the induced poset on a parabolic coset inside a Bruhat interval is never fragmented: it is always interval-like [2205.07733].

The unique-maximal-element property has concrete enumerative and geometric consequences. For the Poincaré polynomial
\[
P_w(t)=\sum_{u\leq w} t^{\ell(u)},
\]
one obtains
\[
P_w(t)=\sum_{x\in [e,w]\cap W^J} t^{\ell(x)}\cdot P_{m_J(w,x)}(t),
\]
where \(m_J(w,x)\) is defined from the unique maximal element of \([e,w]\cap xW_J\). In geometric terms, the fibers of standard parabolic projection maps on Schubert varieties are themselves Schubert varieties, and in the BP decomposition case all fibers are isomorphic [2204.11959].

A plausible implication is that the interval structure of parabolic slices provides a local regularity principle complementing the global Cohen–Macaulay theory of the full parabolic coset poset.

## 4. Parabolic double cosets and reverse-containment posets

For a Coxeter system \((W,S)\), a parabolic double coset is a subset of the form
\[
W_I w W_J
\qquad (I,J\subseteq S).
\]
Every such double coset contains a unique minimal-length representative, but the same double coset may admit many different presentations \((I,w,J)\). To remove that ambiguity, the theory of lex-minimal presentation selects the unique presentation for which \(w\) is minimal in the coset and \((|I|,|J|)\) is lexicographically minimal [1612.00736].

The reverse-containment poset \(\Delta(W)\) of parabolic double cosets provides a two-sided analogue of the Coxeter complex. It decomposes as
\[
\Delta(W)=\bigsqcup_{w\in W}\Delta(w),
\]
where \(\Delta(w)\) consists of those double cosets whose maximal element is \(w\). Each \(\Delta(w)\) is a connected component in the Hasse diagram, maximal elements of \(\Delta(W)\) correspond bijectively to elements of \(W\), and each double coset \(X\) contains unique minimal and maximal elements \(x_0=\min X\) and \(x_1=\max X\) in Bruhat order. Moreover,
\[
X=[x_0,x_1]_{LR},
\]
so each double coset is a two-sided weak-order interval [1907.11801].

The order structure is refined by a local dimension function on each component:
\[
\dim_{\Delta(w)}(X)=d(w)-d(X)-1,
\]
where \(d(X)\) is the number of weak coatoms of \(X\). The minimal element of \(\Delta(w)\) is \(W_{D_L(w)}\,w\,W_{D_R(w)}\), and the singleton \(\{w\}\) is the maximal element. In addition, every parabolic double coset is regular in the Bruhat graph [1907.11801].

Enumeration is closely tied to this structural theory. Lex-minimal presentations are used in a finite automaton approach to count parabolic double cosets, and for \(S_n\) the counting problem is expressed through the marine model and the \(w\)-ocean [1612.00736]. This suggests that order-theoretic rigidity and algorithmic enumerability are unusually tightly linked in the double-coset setting.

## 5. The symmetric group: contingency tables, weak orders, and majorization

In the symmetric group, parabolic subgroups are Young subgroups
\[
S_\lambda \cong S_{\lambda_1}\times\cdots\times S_{\lambda_I}
\]
for a partition \(\lambda\vdash n\). For two partitions \(\lambda\) and \(\mu\), the double cosets
\[
S_\lambda\backslash S_n / S_\mu
\]
are in bijection with \(I\times J\) contingency tables \(T=(T_{ij})\) of nonnegative integers with prescribed row sums \(\lambda_i\) and column sums \(\mu_j\). The size of the double coset corresponding to \(T\) is
\[
|S_\lambda T S_\mu|
 = \prod_{i,j}\frac{\lambda_i!\mu_j!}{T_{ij}!},
\]
and the induced probability distribution from the uniform measure on \(S_n\) is the Fisher–Yates distribution
\[
P_{\lambda,\mu}(T)=\frac{1}{n!}\prod_{i,j}\frac{\lambda_i!\mu_j!}{T_{ij}!}.
\]
Under the majorization order on tables with fixed margins, more balanced tables are more probable [2102.04576].

This contingency-table realization equips the set of parabolic double cosets with a concrete poset model. One formulation emphasizes majorization; another emphasizes containment/intersection of cosets and its relationship with maximal contingency tables and weak orders. In particular, Browning identifies \(p_n\), the number of distinct parabolic double cosets in \(S_n\), with the number of maximal two-way contingency tables with sum \(n\), derives an explicit formula for \(p_n\), proves that the formula yields a polynomial-time algorithm, computes \(p_n\) for \(n\leq 5000\), and establishes the asymptotic
\[
p_n \sim K\cdot \frac{n!}{(\log 2)^{2n}},
\qquad
K=\frac{e^{-(\log 2)^2/2}}{4(\log 2)^2}
\approx 0.409223
\]
[2010.13256].

The weak-order viewpoint is also explicit. The same work relates parabolic double cosets to pairs of weak orders with no consecutive embeddings and writes
\[
p_n=\frac{1}{n!}\sum_{k=0}^n
\left[\begin{array}{c} n \\ k \end{array}\right] q_k,
\]
where \(\{q_n\}\) counts such pairs of weak orders [2010.13256]. Together, these results make the symmetric group the setting in which the combinatorics of the parabolic double-coset poset is most explicitly modeled.

## 6. Artin groups, braid groups, and adjacent generalizations

In large-type Artin groups, the order theory of parabolic subgroups has a geometric realization. The Artin complex \(X_S\) is a simplicial complex whose vertices and simplices correspond to proper parabolic subgroups, and its first barycentric subdivision is the geometric realization of the poset of parabolic subgroups ordered by inclusion. If \(A_S\) is of large type and \(|S|\geq 3\), then \(X_S\) is systolic. In the same setting, the intersection of any collection of parabolic subgroups is again parabolic, the set of all parabolic subgroups forms a lattice under inclusion, and every subset of \(A_S\) is contained in a unique minimal parabolic subgroup [2012.02693].

A complementary approach uses retractions to standard parabolic subgroups in Artin groups. For \(I\subseteq S\), one has left and right retractions \(\bpi_I\) and \(\bpi_I^r\), and every \(x\in B\) admits a unique decomposition
\[
x=\bpi_I(x)\cdot {}_I(x),
\]
where \({}_I(x)\) is \(I\)-reduced. The map \(x\mapsto {}_I(x)\) gives a transversal of \(B_I\)-right cosets, the collection of right parabolic cosets \(B_Ix\) carries a poset structure by inclusion, and the retractions satisfy
\[
\bpi_I\circ \bpi_J=\bpi_{I\cap J}.
\]
Under suitable assumptions, there is also a unique double-coset representative with both left and right retractions trivial [2407.07459].

For braid groups, the situation is more limited from the poset-theoretic standpoint. The double coset problem is unsolvable for subgroups of \(B_n\) when \(n\geq 5\), but for parabolic subgroups with connected associated Coxeter graph it is solvable, and the result was later generalized to all parabolic subgroups of braid groups. The proof reduces the problem to simultaneous conjugacy, uses explicit shift elements \(T_{p,q}\), and relies on the double-centralizer formula
\[
C_{B_n}(C_{B_n}(H))=\langle \Delta_n^2\rangle\cdot H
\]
for connected parabolic subgroups \(H\). However, this work does not explicitly discuss the poset or lattice structure of the set of parabolic double cosets in \(B_n\) [1402.5541].

Outside the group setting, the contrast becomes sharper. For a finite loop \(Q\) with subloop \(S\), the collections
\[
\mathcal C_\lambda(Q,S)=\left\{\bigcap_{x\in X}xS:\emptyset\neq X\subseteq Q\right\},
\qquad
\mathcal C_\rho(Q,S)=\left\{\bigcap_{x\in X}Sx:\emptyset\neq X\subseteq Q\right\}
\]
are meet-semilattices under inclusion. In loops with the antiautomorphic inverse property, the map \(xS\mapsto Sx^{-1}\) induces an isomorphism
\[
\mathcal C_\lambda(Q,S)\cong \mathcal C_\rho(Q,S).
\]
This does not define parabolic cosets in the Coxeter sense, but it isolates a general phenomenon: once coset intersections become nontrivial, the resulting posets can encode substantial geometry and combinatorics [1108.3656].

The modern literature therefore uses the expression “poset of parabolic cosets” in several closely related but non-identical senses. In finite Coxeter groups it denotes a well-structured inclusion poset with strong topological and representation-theoretic invariants; in Bruhat theory it describes interval-like slices by parabolic cosets; in double-coset theory it leads to reverse-containment complexes and contingency-table models; and in Artin groups it interacts with retractions, lattice structures, and systolic geometry.

Source: https://www.emergentmind.com/topics/poset-of-parabolic-cosets