Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0112131

On 321-avoiding permutations in affine Weyl groups

R. M. Green
View original source ↗Read source document ↗Export metadata ↓

Abstract

We introduce the notion of 321-avoiding permutations in the affine Weyl group $W$ of type $A_{n-1}$ by considering the group as a George group (in the sense of Eriksson and Eriksson). This enables us to generalize a result of Billey, Jockusch and Stanley to show that the 321-avoiding permutations in $W$ coincide with the set of fully commutative elements; in other words, any two reduced expressions for a 321-avoiding element of $W$ (considered as a Coxeter group) may be obtained from each other by repeated applications of short braid relations. Using Shi's characterization of the Kazhdan--Lusztig cells in the group $W$, we use our main result to show that the fully commutative elements of $W$ form a union of Kazhdan--Lusztig cells. This phenomenon has been studied by the author and J. Losonczy for finite Coxeter groups, and is interesting partly because it allows certain structure constants for the Kazhdan--Lusztig basis of the associated Hecke algebra to be computed combinatorially. We also show how some of our results can be generalized to a larger group of permutations, the extended affine Weyl group associated to $GL_n({\Bbb C})$.

Explore related subjects

math.COmath.QA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. M. Green. 2001-12-12. On 321-avoiding permutations in affine Weyl groups. https://arxiv.org/abs/math/0112131

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗