Counting Fixed-Length Permutation Patterns

zbMath1292.05010arXiv1211.7117MaRDI QIDQ5494778

Cheyne Homberger

Publication date: 30 July 2014

Full work available at URL: https://arxiv.org/abs/1211.7117

Mathematics Subject Classification ID

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

Related Items (5)

The minimum Manhattan distance and minimum jump of permutations ⋮ On the sparseness of the downsets of permutations via their number of separators ⋮ Prolific permutations and permuted packings: downsets containing many large patterns ⋮ Counting king permutations on the cylinder ⋮ On the topology of the permutation pattern poset

This page was built for publication: Counting Fixed-Length Permutation Patterns