Papers
Topics
Authors
Recent
Search
2000 character limit reached

Viennot shadows and graded module structure in colored permutation groups

Published 15 Jan 2024 in math.CO | (2401.07850v3)

Abstract: Let $\mathbf{x}{n \times n}$ be a matrix of $n \times n$ variables, and let $\mathbb{C}[\mathbf{x}{n \times n}]$ be the polynomial ring on these variables. Let $\mathfrak{S}{n,r}$ be the group of colored permutations, consisting of $n \times n$ complex matrices with exactly one nonzero entry in each row and column, where each nonzero entry is an $r$-th root of unity. We associate an ideal $I{\mathfrak{S}{n,r}} \subseteq \mathbb{C}[\mathbf{x}{n \times n}]$ with the group $\mathfrak{S}{n,r}$, and use orbit harmonics to give an ideal-theoretic extension of the Viennot shadow line construction to $\mathfrak{S}{n,r}$. This extension gives a standard monomial basis of $\mathbb{C}[\mathbf{x}{n \times n}]/I{\mathfrak{S}{n,r}}$, and introduces an analogous definition of ``longest increasing subsequence'' to the group $\mathfrak{S}{n,r}$. We examine the extension of Chen's conjecture to this analogy. We also study the structure of $\mathbb{C}[\mathbf{x}{n \times n}]/I{\mathfrak{S}{n,r}}$ as a graded $\mathfrak{S}{n,r} \times \mathfrak{S}{n,r}$ module, which subsequently induces a graded $\mathfrak{S}{n,r} \times \mathfrak{S}{n,r}$ module structure on the $\mathbb{C}$-algebra $\mathbb{C}[\mathfrak{S}{n,r}]$.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.