A short proof for the number of permutations containing pattern 321 exactly once

zbMath1229.05006MaRDI QIDQ640473

Alexander Burstein

Publication date: 18 October 2011

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

Full work available at URL: http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i2p21.html

Mathematics Subject Classification ID

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

Related Items (5)

Unnamed Item ⋮ Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization ⋮ Enumeration of words that contain the pattern 123 exactly once ⋮ Enumeration of Dumont permutations avoiding certain four-letter patterns ⋮ Pattern-functions, statistics, and shallow permutations

This page was built for publication: A short proof for the number of permutations containing pattern 321 exactly once