Classical sequences revisited with permutations avoiding dotted pattern

MaRDI QIDQ640434zbMATH OpenFDO

Authors Jean-Luc Baril

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/v18i1p178.html

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

zbMATH Keywords

dotted patternpattern avoiding permutation class

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

Summary: Inspired by the definition of the barred pattern-avoiding permutation, we introduce the new concept of dotted pattern for permutations. We investigate permutation classes avoiding dotted patterns of length at most 3, possibly along with other classical patterns. We deduce some enumerating results which allow us to exhibit new families of permutations counted by the classical sequences: \(2^n\), Catalan, Motzkin, Pell, Fibonacci, Fine, Riordan, Padovan, Eulerian.

Recommendations

• From Fibonacci to Catalan permutations
• Enumerations of permutations simultaneously avoiding a vincular and a covincular pattern of length 3
• Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
• Enumeration schemes for permutations avoiding barred patterns
• scientific article; zbMATH DE number 5072523

Cited in

(5)

• Classical length-5 pattern-avoiding permutations
• Distributions of mesh patterns of short lengths
• Pattern avoidance of generalized permutations
• Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
• Combinatorial generation via permutation languages. I: Fundamentals

This page was built for publication: Classical sequences revisited with permutations avoiding dotted pattern

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