Counting visible levels in bargraphs and set partitions

DOI10.2298/FIL1919229CMaRDI QIDQ5864419zbMATH OpenFDO

Authors

Publication date 7 June 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL1919229C

zbMATH Keywords

generating functionslevelspartial differential equationsset partitionsvisible pairs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Partitions of sets (05A18)

Cites work

• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Bargraph statistics on words and set partitions
• Combinatorial parameters in bargraphs
• Combinatorics of set partitions
• Enumerating set partitions according to the number of descents of size d or more
• Enumerating set partitions by the number of positions between adjacent occurrences of a letter
• scientific article; zbMATH DE number 815575 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• scientific article; zbMATH DE number 6322907 (Why is no real title available?)
• Levels in bargraphs
• The height and width of bargraphs

Cited in

(5)

• Enumerations of bargraphs with respect to corner statistics
• Visibility in pattern-restricted permutations
• Visibility in non-crossing and non-nesting partitions
• Visibility in restricted involutions
• Maxima and visibility in involutions

This page was built for publication: Counting visible levels in bargraphs and set partitions

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