Inversion Sets and Quotient Root Systems
Ivan Dimitrov, Cole Gigliotti, Etan Ossip, Charles Paquette, David Wehlau
TL;DR
This work develops a type-independent framework to decompose the positive roots Δ^+ of a root system into disjoint inversion sets by introducing quotient root systems (QRS) and a generalized inflation operation. Central to the approach is the graph G(Φ) on an inversion set Φ, whose connected components Comp(Φ) carry a partial addition and a poset structure that extend root-system ideas beyond QRSs. The authors prove a canonical inflation description for all Φ, relate primitive and irreducible properties, and apply these tools to recursive decompositions, GIT problems (notably regarding the Littlewood–Richardson cone), and enumerative questions, including Catalan-like counts for non-A types. The paper also provides two concise proofs of a Francone–Ressayre-type result and develops an operadic-like viewpoint that clarifies when a decomposition can be parsed into inflations from subsystems and quotients. Overall, the framework yields a uniform, recursive method for decomposing inversion sets, establishes structural links to GIT, and yields rich combinatorial enumerations across all finite root-system types.
Abstract
The main result of this paper is a recursive description of all decompositions \[ Δ^+ = Φ_1 \sqcup Φ_2 \sqcup \dots \sqcup Φ_k \] of the positive roots $Δ^+$ of an arbitrary root system $Δ$ into a disjoint union of inversion sets. Such decompositions play a central role in geometric invariant theory (GIT) in connection with studying the Littlewood-Richardson cone and related problems. This work can be considered as a continuation of the work of Dewji, Dimitrov, McCabe, Roth, Wehlau, and Wilson in which similar questions were studied for root systems of type $\mathbb{A}$. Their methods relied on properties of permutations and are not transferable to an arbitrary root system. In order to develop a type-independent approach, we go beyond root systems and consider quotient root systems (QRSs for short). We study subsets of positive roots in an arbitrary QRS $R$. We prove that every $Φ\subseteq R^+$ can be represented in a canonical way as an inflation and develop methods to study recursively properties of such subsets. We extend the notion of an inversion to subsets of any QRS, i.e., beyond the case where a Weyl group is associated with $R$. If $Φ\subseteq R^+$ is an inversion set, we introduce a graph $\text{G}(Φ)$ and endow the set Comp$(Φ)$ of connected components of $\text{G}(Φ)$ with a partial addition. The resulting monoid-like structure (Comp$(Φ),+)$ is a further generalization of root systems beyond QRSs. We study in detail the properties of (Comp$(Φ),+)$ and their applications to studying the properties of $Φ$. In particular, we investigate the relationship between $Φ$ being primitive and $Φ$ being irreducible. Apart from describing recursively all decompositions of $Δ^+$ into the disjoint union of inversion sets, we provide applications to GIT and derive enumerative results which may be of independent interest.