Nine classes of permutations enumerated by binomial transform of Fine's sequence

DOI10.1016/j.dam.2017.04.015zbMath1365.05017OpenAlexW2616490702WikidataQ60692144 ScholiaQ60692144MaRDI QIDQ2357779

Mark Shattuck, Toufik Mansour

Publication date: 14 June 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.04.015

zbMATH Keywords

kernel methodpattern avoidanceWilf-equivalenceFine's sequence

Mathematics Subject Classification ID

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

Related Items (1)

Combinatorics of the symmetries of ascents in restricted inversion sequences

Uses Software

• OEIS

Cites Work

• OEIS
• The kernel method and systems of functional equations with several conditions
• Skew Dyck paths
• Forbidden subsequences
• Generating trees and the Catalan and Schröder numbers
• Classification of forbidden subsequences of length 4
• Simple permutations and algebraic generating functions
• Sorting classes
• Egge triples and unbalanced Wilf-equivalence
• A stack and a pop stack in series
• Restricted permutations
• Unnamed Item
• Unnamed Item

This page was built for publication: Nine classes of permutations enumerated by binomial transform of Fine's sequence