Enumeration schemes for permutations avoiding barred patterns

zbMATH Open1215.05006MaRDI QIDQ2380461FDOQ2380461

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

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

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited In (13)

• Semi-Baxter and strong-Baxter: two relatives of the Baxter sequence
• Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
• Enumeration schemes for vincular patterns
• Classical sequences revisited with permutations avoiding dotted pattern
• Refining enumeration schemes to count according to permutation statistics
• The number of {1243, 2134}-avoiding permutations
• Semi-Baxter and strong-Baxter permutations
• Combinatorial parameters on bargraphs of permutations
• Vincular pattern avoidance on cyclic permutations
• Combinatorial generation via permutation languages. I: Fundamentals
• 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
• Title not available (Why is that?)

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)