Ju n 20 01 EXPLICIT ENUMERATION OF 321 , HEXAGON – AVOIDING PERMUTATIONS
نویسنده
چکیده
The 321,hexagon–avoiding (321–hex) permutations were introduced and studied by Billey and Warrington in [4] as a class of elements of Sn whose Kazhdan– Lusztig and Poincaré polynomials and the singular loci of whose Schubert varieties have certain fairly simple and explicit descriptions. This paper provides a 7–term linear recurrence relation leading to an explicit enumeration of the 321–hex permutations. A complete description of the corresponding generating tree is obtained as a by–product of enumeration techniques used in the paper, including Schensted’s 321– subsequences decomposition, a 5–parameter generating function and the symmetries of the octagonal patterns avoided by the 321–hex permutations.
منابع مشابه
1 1 Ju n 20 01 EXPLICIT ENUMERATION OF 321 , HEXAGON – AVOIDING PERMUTATIONS
The 321,hexagon–avoiding (321–hex) permutations were introduced and studied by Billey and Warrington in [4] as a class of elements of Sn whose Kazhdan– Lusztig and Poincaré polynomials and the singular loci of whose Schubert varieties have certain fairly simple and explicit descriptions. This paper provides a 7–term linear recurrence relation leading to an explicit enumeration of the 321–hex pe...
متن کامل321-Polygon-Avoiding Permutations and Chebyshev Polynomials
A 321-k-gon-avoiding permutation π avoids 321 and the following four patterns: k(k + 2)(k + 3) · · · (2k − 1)1(2k)23 · · · (k − 1)(k + 1), k(k + 2)(k + 3) · · · (2k − 1)(2k)12 · · · (k − 1)(k + 1), (k + 1)(k + 2)(k + 3) · · · (2k − 1)1(2k)23 · · · k, (k + 1)(k + 2)(k + 3) · · · (2k − 1)(2k)123 · · · k. The 321-4-gon-avoiding permutations were introduced and studied by Billey and Warrington [BW]...
متن کاملKazhdan-Lusztig Polynomials for 321-Hexagon-Avoiding Permutations
In (Deodhar, Geom. Dedicata, 36(1) (1990), 95–119), Deodhar proposes a combinatorial framework for determining the Kazhdan-Lusztig polynomials Px,w in the case where W is any Coxeter group. We explicitly describe the combinatorics in the case where W = Sn (the symmetric group on n letters) and the permutation w is 321-hexagon-avoiding. Our formula can be expressed in terms of a simple statistic...
متن کاملThe Enumeration of Maximally Clustered Permutations
The maximally clustered permutations are characterized by avoiding the classical permutation patterns {3421, 4312, 4321}. This class contains the freely braided permutations and the fully commutative permutations. In this work, we show that the generating functions for certain fully commutative pattern classes can be transformed to give generating functions for the corresponding freely braided ...
متن کاملGenerating and Enumerating 321-Avoiding and Skew-Merged Simple Permutations
The simple permutations in two permutation classes — the 321-avoiding permutations and the skew-merged permutations — are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards from the enumeration of the class, but the simple permutations had not been enumerated explicitly. In particular, the enumeration of the simple skew-merged permut...
متن کامل