Increasing subsequences, matrix loci, and Viennot shadows

Abstract

Let xn × n be an n × n matrix of variables and let F[xn × n] be the polynomial ring in these variables over a field F. We study the ideal In ⊂eq F[xn × n] generated by all row and column variable sums and all products of two variables drawn from the same row or column. We show that the quotient F[xn × n]/In admits a standard monomial basis determined by Viennot's shadow line avatar of the Schensted correspondence. As a corollary, the Hilbert series of F[xn × n]/In is the generating function of permutations in Sn by the length of their longest increasing subsequence. Along the way, we describe a `shadow junta' basis of the vector space of k-local permutation statistics. We also calculate the structure of F[xn × n]/In as a graded Sn × Sn-module.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…