Fishburn trees

DOI10.1016/J.AAM.2023.102592MaRDI QIDQ6094855zbMATH OpenFDO

Authors Giulio Cerbai, Anders Claesson

Publication date 14 September 2023

Published in Advances in Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\((2+2)\)-free posetsascent sequencesbijective combinatoricsFishburn matricesFishburn numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Abstract: The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call Fishburn trees. We give bijections between Fishburn trees and other well-known combinatorial structures that are counted by the Fishburn numbers, and by composing these new maps we obtain simplified versions of some of the known maps. Finally, we apply this new machinery to the so called flip and sum problems on modified ascent sequences.

Recommendations

• Fishburn diagrams, Fishburn numbers and their refined generating functions
• Bijections on rooted trees with fixed size of maximal decreasing subtrees
• Runs in labelled trees and mappings
• Fighting fish: enumerative properties
• A simple bijection between a subclass of 2-binary trees and ternary trees

Cites work

• $n!$ matchings, $n!$ posets
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• A new decomposition of ascent sequences and Euler-Stirling statistics
• An operator on ascent sequences
• Ascent sequences and upper triangular matrices containing non-negative integers
• Catalan pairs and Fishburn triples
• Cayley permutations
• Composition matrices, \((2+2)\)-free posets and their specializations
• Cyclic sieving, skew Macdonald polynomials and Schur positivity
• Enumerating \((2 + 2)\)-free posets by indistinguishable elements
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Equidistributed statistics on Fishburn matrices and permutations
• Equidistributed statistics on matchings and permutations
• Fishburn diagrams, Fishburn numbers and their refined generating functions
• Four correspondences between graphs and generalized Young tableaux
• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• Intransitive indifference with unequal indifference intervals
• On a conjecture about enumerating \((2+2)\)-free posets
• Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
• Sorting Cayley permutations with pattern-avoiding machines
• Transport of patterns by Burge transpose

Cited in

(12)

• McKay trees
• Enumerating pattern-avoiding Fishburn permutations subject to seven statistics
• Difference ascent sequences
• Modified ascent sequences and Bell numbers
• Pattern-avoiding Cayley permutations via combinatorial species
• Modified ascent sequences avoiding a pattern of length 4
• Pattern-avoiding modified ascent sequences
• Modified difference ascent sequences and Fishburn structures
• Self-modified difference ascent sequences
• Pattern avoidance in revised ascent sequences
• On naturally labelled posets and permutations avoiding 12--34
• Revised ascent sequences avoiding a pattern of length 4

This page was built for publication: Fishburn trees

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