Levels in bargraphs

DOI10.26493/1855-3974.600.5D2MaRDI QIDQ3465665zbMATH OpenOpenAlexWikidataFDO

Authors Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher

Publication date 22 January 2016

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.600.5d2

zbMATH Keywords

asymptoticsgenerating functionsbargraphslevels

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Recommendations

• Combinatorial parameters in bargraphs
• The height and width of bargraphs
• Bargraphs in bargraphs
• Walls in bargraphs
• Statistics on bargraphs viewed as cornerless Motzkin paths

Cited in

(32)

• Counting water cells in bargraphs of compositions and set partitions
• A bijection between bargraphs and Dyck paths
• Counting \(1\times 2\) rectangles in set partitions
• Counting corners in compositions and set partitions presented as bargraphs
• Circular bargraphs
• On the general zeroth-order Randić index of bargraphs
• Prefixes of bargraph paths
• Visibility in pattern-restricted permutations
• Combinatorial parameters on bargraphs of permutations
• Protected cells in bargraphs
• scientific article; zbMATH DE number 7471114 (Why is no real title available?)
• Counting visible levels in bargraphs and set partitions
• Chimneys in compositions and bargraphs
• Exterior corners on bargraphs of Motzkin words
• Statistics on bargraphs of inversion sequences of permutations
• Bargraphs in bargraphs
• The height and width of bargraphs
• Interior vertices in set partitions
• \(t\)-bargraphs and \(t\)-compositions
• The perimeter of 2-compositions
• Visibility in non-crossing and non-nesting partitions
• New refined enumerations of set partitions related to sorting
• Enumerations on bargraphs
• Counting lattice points on bargraphs of Catalan words
• Counting permutations where the difference between entries located \(r\) places apart can never be \(s\) (for any given positive integers \(r\) and \(s\))
• Combinatorial parameters in bargraphs
• Elements protected by records in set partitions
• Semi-perimeter and inner site-perimeter of \(k\)-ary words and bargraphs
• Statistics on bargraphs viewed as cornerless Motzkin paths
• Impulse parameter and a new equivalence between 123- and 132-avoiding permutations
• The perimeter and site-perimeter of set partitions
• Walls in bargraphs

This page was built for publication: Levels in bargraphs

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