Counting visible levels in bargraphs and set partitions

DOI10.2298/FIL1919229CzbMath1499.05056MaRDI QIDQ5864419

No author found.

Publication date: 7 June 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

generating functionslevelspartial differential equationsset partitionsvisible pairs

Mathematics Subject Classification ID

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

Related Items (4)

Maxima and visibility in involutions ⋮ Visibility in restricted involutions ⋮ Visibility in pattern-restricted permutations ⋮ Visibility in non-crossing and non-nesting partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating set partitions according to the number of descents of size \(d\) or more
• The height and width of bargraphs
• Analytical properties of horizontal visibility graphs in the Feigenbaum scenario
• Levels in bargraphs
• Combinatorics of Set Partitions
• Combinatorial parameters in bargraphs
• Bargraph statistics on words and set partitions
• Enumerating set partitions by the number of positions between adjacent occurrences of a letter

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