Nine classes of permutations enumerated by binomial transform of Fine's sequence
From MaRDI portal
Publication:2357779
DOI10.1016/J.DAM.2017.04.015zbMATH Open1365.05017OpenAlexW2616490702WikidataQ60692144 ScholiaQ60692144MaRDI QIDQ2357779FDOQ2357779
Authors: Toufik Mansour, Mark Shattuck 
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
Recommendations
- Finite transition matrices for permutations avoiding pairs of length four patterns
- Enumeration of permutations avoiding a triple of 4-letter patterns is almost all done
- Enumeration of small Wilf classes avoiding 1342 and two other 4-letter patterns
- Enumeration of small Wilf classes avoiding 1324 and two other 4-letter patterns
- Two permutation classes enumerated by the central binomial coefficients
Cites Work
- OEIS
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Restricted permutations
- Generating trees and the Catalan and Schröder numbers
- Forbidden subsequences
- Classification of forbidden subsequences of length 4
- Simple permutations and algebraic generating functions
- The kernel method and systems of functional equations with several conditions
- Skew Dyck paths
- Sorting classes
- Egge triples and unbalanced Wilf equivalence
- A stack and pop stack in series
Cited In (3)
Uses Software
This page was built for publication: Nine classes of permutations enumerated by binomial transform of Fine's sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2357779)
