Line configurations and r-Stirling partitions
Abstract
A set partition of [n] := \1, 2, …, n \ is called r-Stirling if the numbers 1, 2, …, r belong to distinct blocks. Haglund, Rhoades, and Shimozono constructed graded ring Rn,k depending on two positive integers k ≤ n whose algebraic properties are governed by the combinatorics of ordered set partitions of [n] with k blocks. We introduce a variant Rn,k(r) of this quotient for ordered r-Stirling partitions which depends on three integers r ≤ k ≤ n. We describe the standard monomial basis of Rn,k(r) and use the combinatorial notion of the coinversion code of an ordered set partition to reprove and generalize some results of Haglund et.\ al.\ in a more direct way. Furthermore, we introduce a variety Xn,k(r) of line arrangements whose cohomology is presented as the integral form of Rn,k(r), generalizing results of Pawlowski and Rhoades.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.