Counting corners in compositions and set partitions presented as bargraphs
From MaRDI portal
Publication:4576744
DOI10.1080/10236198.2018.1444760zbMath1390.05014OpenAlexW2789369684MaRDI QIDQ4576744
Armend Sh. Shabani, Toufik Mansour, Mark Shattuck
Publication date: 10 July 2018
Published in: Journal of Difference Equations and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10236198.2018.1444760
Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Permutations, words, matrices (05A05)
Related Items
Unnamed Item ⋮ Unnamed Item ⋮ A decomposition of column-convex polyominoes and two vertex statistics ⋮ Unnamed Item ⋮ The perimeter and site-perimeter of set partitions ⋮ Unnamed Item ⋮ The Perimeter of 2-Compositions ⋮ Semi-perimeter and inner site-perimeter of k-ary words and bargraphs ⋮ Unnamed Item ⋮ Circular bargraphs ⋮ Bargraphs in bargraphs ⋮ Interior vertices in set partitions ⋮ Counting set partitions by the number of movable letters ⋮ Counting 1 × 2 rectangles in set partitions ⋮ t-bargraphs and t-compositions ⋮ Enumerations of bargraphs with respect to corner statistics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Statistics on bargraphs viewed as cornerless Motzkin paths
- Generalized Stirling and Lah numbers
- Exact solution of the discrete \((1+1)\)-dimensional SOS model with field and surface interactions
- \(Q\)-grammars and wall polyominoes
- Counting subwords in a partition of a set
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Counting corners in partitions
- Levels in bargraphs
- A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
- Combinatorics of Set Partitions
- Combinatorics of Compositions and Words
- Combinatorial parameters in bargraphs