Decomposing Inversion Sets of Permutations and Applications to Faces of the Littlewood-Richardson Cone

TL;DR

This paper characterizes how permutations' inversion sets partition the full set of pairs, applies this to analyze faces of the Littlewood-Richardson cone, and extends results to other Weyl groups, offering algorithms and visualization tools.

Contribution

It provides a complete description of permutation inversion set decompositions, proves certain faces of the Littlewood-Richardson cone are simplicial, and extends the analysis to types B and C Weyl groups.

Findings

Characterization of permutation inversion set decompositions.

Proof that certain Littlewood-Richardson cone faces are simplicial.

Algorithms for generating rays of these faces.

Abstract

If $\alpha \in S_n$ is a permutation of $\{1, 2, \ldots, n\}$, the inversion set of $\alpha$ is $\Phi(\alpha) = \{(i, j) \, | \, 1 \leq i < j \leq n, \alpha(i) > \alpha(j)\}$. We describe all $r$-tuples $\alpha_1, \alpha_2, \ldots, \alpha_r \in S_n$ such that $\Delta_n^+ = \{(i, j) \, | \, 1 \leq i < j \leq n\}$ is the disjoint union of $\Phi(\alpha_1), \Phi(\alpha_2), \ldots, \Phi(\alpha_r)$. Using this description we prove that certain faces of the Littlewood-Richardson cone are simplicial and provide an algorithm for writing down their sets of generating rays. We also discuss analogous problems for the Weyl groups of root systems of types $B$, $C$ and $D$ providing solutions for types $B$ and $C$. Finally we provide some enumerative results and introduce a useful tool for visualizing inversion sets.