Combinatorial parameters in bargraphs

DOI10.2989/16073606.2015.1121932zbMath1423.05011OpenAlexW2512706792MaRDI QIDQ5236018

Arnold Knopfmacher, Aubrey Blecher, Charlotte Brennan

Publication date: 15 October 2019

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2015.1121932

zbMATH Keywords

compositionsgenerating functionsbargraphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (34)

A bijection between bargraphs and Dyck paths ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A decomposition of column-convex polyominoes and two vertex statistics ⋮ New refined enumerations of set partitions related to sorting ⋮ Counting corners in compositions and set partitions presented as bargraphs ⋮ Impulse parameter and a new equivalence between 123- and 132-avoiding permutations ⋮ Unnamed Item ⋮ Chimneys in compositions and bargraphs ⋮ The perimeter and site-perimeter of set partitions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The Perimeter of 2-Compositions ⋮ Semi-perimeter and inner site-perimeter of k-ary words and bargraphs ⋮ Counting water cells in bargraphs of compositions and set partitions ⋮ Elements protected by records in set partitions ⋮ Statistics on bargraphs viewed as cornerless Motzkin paths ⋮ Unnamed Item ⋮ Circular bargraphs ⋮ Bargraphs in bargraphs ⋮ Statistics on bargraphs of inversion sequences of permutations ⋮ Interior vertices in set partitions ⋮ Combinatorial parameters on bargraphs of permutations ⋮ The inner site-perimeter of compositions ⋮ Counting 1 × 2 rectangles in set partitions ⋮ t-bargraphs and t-compositions ⋮ Counting lattice points on bargraphs of Catalan words ⋮ Enumerations of bargraphs with respect to corner statistics ⋮ Visibility in pattern-restricted permutations ⋮ Visibility in non-crossing and non-nesting partitions ⋮ Counting visible levels in bargraphs and set partitions

Cites Work

• The height and width of bargraphs
• A history and a survey of lattice path enumeration
• Dyck path enumeration
• \(Q\)-grammars and wall polyominoes
• Exchange symmetries in Motzkin path and bargraph models of copolymer adsorption
• The site-perimeter of bargraphs
• Critical exponents from nonlinear functional equations for partially directed cluster models
• Levels in bargraphs
• Exactly Solved Models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial parameters in bargraphs