Combinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-27

  Simion, Rodica ^a  

^a GEORGE WASHINGTON UNIVERSITY   (United States)

Author keywords

Noncrossing partitions; Partition statistics; Pattern avoidance; Permutation statistics; q analogue; Restricted permutations; Signed permutations

Indexed keywords

EID: 0038284491     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1487     Document Type: Article

References (39)

1. E. Barcucci, A. Del Lungo, and E. Pergola, Permutations with one forbidden subsequence of increasing length, Extended Abstracts, Proc. 9th Conf. Formal Power Series and Algebr. Combin. (Vienna), 1997.
2. S.C. Billey, Pattern avoidance and rational smoothness of Schubert varieties, Adv. in Math. 139 (1998) 141-156.
3. M. Bóna, Permutations avoiding certain patterns: the case of length 4 and some generalizations, Discrete Math. 175 (1997) 55-67.
4. n, Adv. in Math. 126 (1997) 21-51.
5. T. Chow and J. West, Forbidden sequences and Chebyshe polynomials, Discrete Math., to appear.
6. S. Dulucq, S. Gire, and J. West, Permutations with forbidden subsequences and nonseparable planar maps, Proc. 5th Conf. Formal Power Series and Algebr. Combin. (Florence, 1993), Discrete Math. 153 (1996) 85-103.
7. P. Edelman, Chain enumeration and noncrossing partitions, Discrete Math. 31 (1980) 171-180.
8. P. Edelman, Multichains, noncrossing partitions and trees, Discrete Math. 40 (1982) 171-179.
9. P. Edelman and R. Simion, Chains in the lattice of noncrossing partitions. Discrete Math. 126 (1994), no. 1-3, 107-119.
10. D. Foata and D. Zeilberger, Denert's permutation statistic is indeed Euler-Mahonian, Stud. Appl. Math. 83 (1990) 31-59.
11. J. Galovich, personal communication, February 1999.
12. n, J. Combin. Theory Ser. A 83 (1998), 159-164.
13. P. Hersh, Deformation of chains via a local symmetric group action, Electronic J. Combin. 27 (1999).
14. B. Jacquard and G. Schaeffer, A bijective census of nonseparable planar maps. J. Combin. Theory Ser. A 83 (1998), no. 1, 1-20.
15. D. Knuth, The "Art of Computer Programming," vol. 3, Addison-Wesley, Reading, MA, 1973.
16. G. Kreweras, Sur les partitions non croisées d'un cycle, Discrete Math. 1 (1972), no. 4, 333-350.
17. C. Montenegro, The fixed point non-crossing partition lattices, manuscript, 1993.
18. A. Nica and R. Speicher, A "Fourier transform" for multiplicative functions on noncrossing partitions, J. Algebraic Combin. 6 (1997) 141-160.
19. J. Noonan and D. Zeilberger, The enumeration of permutations with a prescribed number of "forbidden" patterns, Adv. in Appl. Math. 17 (1996) 381-407.
20. V. Reiner, Non-crossing partitions for classical reflection groups. Discrete Math. 177 (1997), no. 1-3, 195-222.
21. J. Ser, "Les Calculs Formels des Séries Factorielles," Gauthiers-Villars, Paris, 1933.
22. R. Simion, F. W. Schmidt, Restricted permutations, European Journal of Combinatorics, 6 (1985), 383-406.
23. R. Simion, D. Ullman, On the structure of the lattice of noncrossing partitions, Discrete Math. 98 (1991), no. 3, 193-206.
24. R. Simion, Combinatorial statistics on noncrossing partitions, J. Combin. Theory Ser. A 66 (1994) 270-301.
25. R. Simion, Noncrossing partitions, Discrete Math., to appear.
26. R. Simion, A type-B analogue of the associahedron, in preparation.
27. N.J.A. Sloane and S. Plouffe, "The Encyclopedia of Integer Sequences," Academic Press, Inc., San Diego, CA, 1995.
28. L. Solomon, The Bruhat decomposition, Tits system and Iwahori ring for the monoid of matrices over a finite field, Geom. Dedicata 36 (1990) 15-49.
29. R. Stanley, Log-concave and unimodal sequences in algebra, combinatorics, and geometry. Graph theory and its applications: East and West (Jinan, 1986), 500-535, Ann. New York Acad. Sci., 576, New York Acad. Sci., New York, 1989.
30. R. Stanley, Parking functions and noncrossing partitions, Electronic J. Combin. 4 (1997) R20, 14pp.
31. R. Stanley, "Enumerative Combinatorics," vol. 1, second edition, Cambridge Studies in Adv. Math., 49, Cambridge Univ. Press, Cambridge, 1997.
32. R. Stanley, "Enumerative Combinatorics," vol. 2, Cambridge University Press, New York/Cambridge, 1999.
33. E. Steingrímsson, Permutations statistics of indexed permutations, European J. Combin. 15 (1994) 187-205.
34. J. Stembridge, The enumeration of fully commutative elements of Coxeter groups, J. Algebraic Combin. 7 (1998) 291-320.
35. R. Tarjan, Sorting using networks of queues and stacks, J. Assoc. Comput. Mach. 19 (1972) 341-346.
36. M. Wachs and D. White, p; q-Stirling numbers and set partition statistics, J. Combin. Theory Ser. A 56 (1991) 27-46.
37. J. West, Generating trees and forbidden subsequences, Proc. 6th Conf. Formal Power Series and Algebr. Combin. (New Brunswick, NJ, 1994), Discrete Math. 157 (1996) 363-374.
38. D. White, Interpolating set partition statistics, J. Combin. Theory Ser. A 68 (1994) 262-295.
39. D. Zeilberger, A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!/=((n + 1)!(2n + 1)!), Discrete Math. 102 (1992), no. 1, 85-93.