惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

U
Unit 42
F
Fortinet All Blogs
Martin Fowler
Martin Fowler
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
IT之家
IT之家
Blog — PlanetScale
Blog — PlanetScale
罗磊的独立博客
V
V2EX
Vercel News
Vercel News
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
T
Tailwind CSS Blog
I
InfoQ
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
S
SegmentFault 最新的问题
H
Help Net Security
腾讯CDC
D
Docker
P
Proofpoint News Feed
GbyAI
GbyAI
博客园 - 三生石上(FineUI控件)
aimingoo的专栏
aimingoo的专栏

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Inversion Sets and Quotient Root Systems
Ivan Dimitrov, Cole Gigliotti, Etan Ossip, Charles Paquette, Dav · 2023-10-26 · via math.CO updates on arXiv.org

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.