Permutations, cycles and the pattern 2--13

MaRDI QIDQ870037zbMATH OpenFDO

Authors Robert Parviainen

Publication date 12 March 2007

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0607793, https://eudml.org/doc/127561, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r111.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: We count the number of occurrences of restricted patterns of length 3 in permutations with respect to length and the number of cycles. The main tool is a bijection between permutations in standard cycle form and weighted Motzkin paths.

Recommendations

• Pattern-restricted permutations composed of 3-cycles
• Restricted 1-3-2 permutations and generalized patterns
• Permutations with restricted patterns and Dyck paths
• Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
• Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13

Cited in

(3)

• Lattice path enumeration of permutations with \(k\) occurrences of the pattern 2--13
• Pattern popularity in multiply restricted permutations
• Total occurrence statistics on restricted permutations

This page was built for publication: Permutations, cycles and the pattern 2--13

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870037)