English

Increasing subsequences, matrix loci, and Viennot shadows

Combinatorics 2024-10-30 v2 Cryptography and Security

Abstract

Let xn×n\mathbf{x}_{n \times n} be an n×nn \times n matrix of variables and let F[xn×n]\mathbb{F}[\mathbf{x}_{n \times n}] be the polynomial ring in these variables over a field F\mathbb{F}. We study the ideal InF[xn×n]I_n \subseteq \mathbb{F}[\mathbf{x}_{n \times 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\mathbb{F}[\mathbf{x}_{n \times n}]/I_n 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\mathbb{F}[\mathbf{x}_{n \times n}]/I_n is the generating function of permutations in Sn\mathfrak{S}_n by the length of their longest increasing subsequence. Along the way, we describe a `shadow junta' basis of the vector space of kk-local permutation statistics. We also calculate the structure of F[xn×n]/In\mathbb{F}[\mathbf{x}_{n \times n}]/I_n as a graded Sn×Sn\mathfrak{S}_n \times \mathfrak{S}_n-module.

Keywords

Cite

@article{arxiv.2306.08718,
  title  = {Increasing subsequences, matrix loci, and Viennot shadows},
  author = {Brendon Rhoades},
  journal= {arXiv preprint arXiv:2306.08718},
  year   = {2024}
}

Comments

21 pages

R2 v1 2026-06-28T11:05:22.443Z