Salvato in:
Dettagli Bibliografici
Autori principali: Dimitrov, Ivan, Gigliotti, Cole, Ossip, Etan, Paquette, Charles, Wehlau, David
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:https://arxiv.org/abs/2310.16767
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
Sommario:
  • 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.