Increasing subsequences, matrix loci, and Viennot shadows
Combinatorics
2024-10-30 v2 Cryptography and Security
Abstract
Let be an matrix of variables and let be the polynomial ring in these variables over a field . We study the ideal 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 admits a standard monomial basis determined by Viennot's shadow line avatar of the Schensted correspondence. As a corollary, the Hilbert series of is the generating function of permutations in by the length of their longest increasing subsequence. Along the way, we describe a `shadow junta' basis of the vector space of -local permutation statistics. We also calculate the structure of as a graded -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