Enumeration schemes for permutations avoiding barred patterns

MaRDI QIDQ2380461zbMATH OpenFDO

Authors Lara Pudwell

Publication date 26 March 2010

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

Full work available at URL https://eudml.org/doc/226050, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r29.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)

Review text

Summary: We give the first comprehensive collection of enumeration results for permutations that avoid barred patterns of length \(\leq 4\). We then use the method of prefix enumeration schemes to find recurrences counting permutations that avoid a barred pattern of length \(> 4\) or a set of barred patterns.

Recommendations

• Enumeration schemes for words avoiding permutations
• Enumeration schemes for vincular patterns
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Refining enumeration schemes to count according to the inversion number
• Enumerating permutations avoiding more than three Babson - Steingr\'\i msson patterns

Cited in

(15)

• Semi-Baxter and strong-Baxter permutations
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• Refining enumeration schemes to count according to the inversion number
• scientific article; zbMATH DE number 5072523 (Why is no real title available?)
• Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
• Refining enumeration schemes to count according to permutation statistics
• Enumeration schemes for vincular patterns
• scientific article; zbMATH DE number 637369 (Why is no real title available?)
• Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
• Combinatorial parameters on bargraphs of permutations
• Combinatorial generation via permutation languages. I: Fundamentals
• The number of {1243, 2134}-avoiding permutations
• Vincular pattern avoidance on cyclic permutations
• Classical sequences revisited with permutations avoiding dotted pattern
• The enumeration of permutations with a prescribed number of ``forbidden patterns

Describes a project that uses

Uses Software

• InsEnc
• OEIS

This page was built for publication: Enumeration schemes for permutations avoiding barred patterns

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