Book contents
- Frontmatter
- Contents
- Preface
- Some general results in combinatorial enumeration
- A survey of simple permutations
- Permuting machines and permutation patterns
- On three different notions of monotone subsequences
- A survey on partially ordered patterns
- Generalized permutation patterns – a short survey
- An introduction to structural methods in permutation patterns
- Combinatorial properties of permutation tableaux
- Enumeration schemes for words avoiding permutations
- The lexicographic first occurrence of a I-II-III-pattern
- Enumeration of partitions by rises, levels and descents
- Restricted patience sorting and barred pattern avoidance
- Permutations with k-regular descent patterns
- Packing rates of measures and a conjecture for the packing density of 2413
- On the permutational power of token passing networks
- Problems and conjectures
- References
Permutations with k-regular descent patterns
Published online by Cambridge University Press: 05 October 2010
Book contents
- Frontmatter
- Contents
- Preface
- Some general results in combinatorial enumeration
- A survey of simple permutations
- Permuting machines and permutation patterns
- On three different notions of monotone subsequences
- A survey on partially ordered patterns
- Generalized permutation patterns – a short survey
- An introduction to structural methods in permutation patterns
- Combinatorial properties of permutation tableaux
- Enumeration schemes for words avoiding permutations
- The lexicographic first occurrence of a I-II-III-pattern
- Enumeration of partitions by rises, levels and descents
- Restricted patience sorting and barred pattern avoidance
- Permutations with k-regular descent patterns
- Packing rates of measures and a conjecture for the packing density of 2413
- On the permutational power of token passing networks
- Problems and conjectures
- References
- Type
- Chapter
- Information
- Permutation Patterns , pp. 259 - 286Publisher: Cambridge University PressPrint publication year: 2010
References
[1] . Développements de sec x et de tang x. C. R. Math. Acad. Sci. Paris, 88:965–967, 1879.Google Scholar
[3] and . Congruences for the q-secant numbers. European J. Combin., 1(4):283–287, 1980.Google Scholar
[4] and . Divisibility properties of the q-tangent numbers. Proc. Amer. Math. Soc., 68(3):380–384, 1978.Google Scholar
[5] . Permutation enumeration symmetric functions, and unimodality. Pacific J. Math., 157(1):1–28, 1993.Google Scholar
[8] and . Brick tabloids and the connection matrices between bases of symmetric functions. Discrete Appl. Math., 34(1-3):107–120, 1991.Google Scholar
[10] . Further divisibility properties of the q-tangent numbers. Proc. Amer. Math. Soc., 81(1):143–148, 1981.Google Scholar
[11] . Some congruences for generalized Euler numbers. Canad. J. Math., 35(4):687–709, 1983.Google Scholar
[12] and . Some arithmetic properties of the q-Euler numbers and q-Salié numbers. European J. Combin., 27(6):884–895, 2006.Google Scholar
[13] and . Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions. Adv. in Appl. Math., 36(1):30–66, 2006.Google Scholar
[14] and . Some properties of generalized Euler numbers. Canad. J. Math., 33(3):606–617, 1981.Google Scholar
[15] . Symmetric functions and Hall polynomials. Oxford Mathematical Monographs. The Clarendon Press Oxford University Press, New York, second edition, 1995.Google Scholar
[16] . Building generating functions brick by brick. PhD thesis, University of California, San Diego, 2004.
[17] and . Generating functions for statistics on Ck ≀ Sn. Sém. Lothar. Combin., 54A:Art. B54At, 40 pp., 2005/07.Google Scholar
[18] and . Permutations and words counted by consecutive patterns. Adv. in Appl. Math., 37(4):443–480, 2006.Google Scholar
[19] . Combinatorics of geometrically distributed random variables: new q-tangent and q-secant numbers. Int. J. Math. Math. Sci., 24(12):825–838, 2000.Google Scholar
[21] and . Generating functions for permutations which contain a given descent set. Electron. J. Combin., 17(1):Research Paper 27, 33 pp., 2010.Google Scholar
[22] and . Arithmetic properties of generalized Euler numbers. Southeast Asian Bull. Math., 21(1):73–78, 1997.Google Scholar
[23] . Binomial posets, Möbius inversion, and permutation enumeration. J. Combinatorial Theory Ser. A, 20(3):336–356, 1976.Google Scholar
[24] . Enumerative combinatorics. Vol. 1, volume 49 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, 1997.Google Scholar
[25] . The permutation enumeration of wreath products Ck ≀ Sn of cyclic and symmetric groups. Adv. in Appl. Math., 30(1-2):343–368, 2003.Google Scholar
- 3
- Cited by