English

Line configurations and r-Stirling partitions

Combinatorics 2019-07-04 v2

Abstract

A set partition of [n]:={1,2,,n}[n] := \{1, 2, \dots, n \} is called {\em rr-Stirling} if the numbers 1,2,,r1, 2, \dots, r belong to distinct blocks. Haglund, Rhoades, and Shimozono constructed graded ring Rn,kR_{n,k} depending on two positive integers knk \leq n whose algebraic properties are governed by the combinatorics of ordered set partitions of [n][n] with kk blocks. We introduce a variant Rn,k(r)R_{n,k}^{(r)} of this quotient for ordered rr-Stirling partitions which depends on three integers rknr \leq k \leq n. We describe the standard monomial basis of Rn,k(r)R_{n,k}^{(r)} and use the combinatorial notion of the {\em 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)X_{n,k}^{(r)} of line arrangements whose cohomology is presented as the integral form of Rn,k(r)R_{n,k}^{(r)}, generalizing results of Pawlowski and Rhoades.

Keywords

Cite

@article{arxiv.1804.07879,
  title  = {Line configurations and r-Stirling partitions},
  author = {Brendon Rhoades and Andrew Timothy Wilson},
  journal= {arXiv preprint arXiv:1804.07879},
  year   = {2019}
}

Comments

21 pages, 1 figure

R2 v1 2026-06-23T01:30:46.633Z