Papers
Topics
Authors
Recent
Search
2000 character limit reached

On some actions of the 0-Hecke monoids of affine symmetric groups

Published 23 Sep 2017 in math.CO and math.RT | (1709.07996v3)

Abstract: There are left and right actions of the 0-Hecke monoid of the affine symmetric group $\tilde{S}_n$ on involutions whose cycles are labeled periodically by nonnegative integers. Using these actions we construct two bijections, which are length-preserving in an appropriate sense, from the set of involutions in $\tilde{S}_n$ to the set of $\mathbb{N}$-weighted matchings in the $n$-element cycle graph. As an application, we compute a formula for the bivariate generating function counting the involutions in $\tilde S_n$ by length and absolute length. The 0-Hecke monoid of $\tilde{S}_n$ also acts on involutions (without any cycle labelling) by Demazure conjugation. The atoms of an involution $z \in \tilde{S}_n$ are the minimal length permutations $w$ which transform the identity to $z$ under this action. We prove that the set of atoms for an involution in $\tilde{S}_n$ is naturally a bounded, graded poset, and give a formula for the set's minimum and maximum elements. Using these properties, we classify the covering relations in the Bruhat order restricted to involutions in $\tilde{S}_n$.

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.