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

zbMATH Open1229.05006MaRDI QIDQ640473FDOQ640473

Authors: 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

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

Recommendations

• scientific article
• scientific article; zbMATH DE number 2192121
• Enumeration of words that contain the pattern 123 exactly once
• Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations
• Enumeration of permutations containing a prescribed number of occurrences of a pattern of length three

Mathematics Subject Classification ID

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

Cited In (5)

• Pattern-functions, statistics, and shallow permutations
• Enumeration of Dumont permutations avoiding certain four-letter patterns
• Permutations with exactly one copy of a monotone pattern of length \(k\), and a generalization
• Title not available (Why is that?)
• Enumeration of words that contain the pattern 123 exactly once

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

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