On pattern-avoiding Fishburn permutations

DOI10.1007/S00026-019-00463-6MaRDI QIDQ2299131zbMATH OpenOpenAlexWikidataFDO

Authors Juan B. Gil, Michael D. Weiner

Publication date 20 February 2020

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.01682

zbMATH Keywords

bivincular patternFishburn numberpattern avoiding permutation

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: The class of permutations that avoid the bivincular pattern (231, {1},{1}) is known to be enumerated by the Fishburn numbers. In this paper, we call them Fishburn permutations and study their pattern avoidance. For classical patterns of size 3, we give a complete enumerative picture for regular and indecomposable Fishburn permutations. For patterns of size 4, we focus on a Wilf equivalence class of Fishburn permutations that are enumerated by the Catalan numbers. In addition, we also discuss a class enumerated by the binomial transform of the Catalan numbers and give conjectures for other equivalence classes of pattern-avoiding Fishburn permutations.

Recommendations

• On bijections for pattern-avoiding permutations
• On pattern avoiding indecomposable permutations
• On pattern avoiding alternating permutations
• Enumerating pattern avoidance for affine permutations
• On the sub-permutations of pattern avoiding permutations
• Pattern avoidance of generalized permutations
• Pattern avoidance in partial permutations
• Pattern avoidance in partial permutations (extended abstract)
• Pattern avoidance in poset permutations
• Pattern-avoiding permutation powers

Cites work

• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Congruences for the Fishburn numbers
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• On pattern avoiding indecomposable permutations
• Ordered trees and the inorder traversal
• Patterns in permutations and words.
• Permutations with restricted patterns and Dyck paths

Cited in

(10)

• Fishburn diagrams, Fishburn numbers and their refined generating functions
• Transport of patterns by Burge transpose
• Weak ascent sequences and related combinatorial structures
• Fighting fish and two-stack sortable permutations
• Catalan pairs and Fishburn triples
• On enumeration of pattern-avoiding Fishburn permutations
• Enumerating pattern-avoiding Fishburn permutations subject to seven statistics
• Modified ascent sequences and Bell numbers
• Pattern-avoiding modified ascent sequences
• Another look at bijections for pattern-avoiding permutations

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: On pattern-avoiding Fishburn permutations

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