Bijections between directed-column convex polyominoes and restricted compositions
From MaRDI portal
Publication:6549686
DOI10.1016/J.TCS.2024.114626zbMATH Open1541.05026MaRDI QIDQ6549686FDOQ6549686
Authors: Jean-Luc Baril, José L. Ramírez, Fabio A. Velandia
Publication date: 4 June 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- The on-line encyclopedia of integer sequences
- Title not available (Why is that?)
- Analytic combinatorics
- The Riordan group
- Combinatorial aspects of \(L\)-convex polyominoes
- Enumeration of L-convex polyominoes by rows and columns
- On Some Alternative Characterizations of Riordan Arrays
- A refinement of Dyck paths: A combinatorial approach
- Combinatorics of Compositions and Words
- A \(q\)-enumeration of convex polyominoes by the festoon approach
- Polygons, polyominoes and polycubes
- The average height of directed column-convex polyominoes having square, hexagonal and triangular cells
- Nondecreasing Dyck paths and \(q\)-Fibonacci numbers
- Enumerations of rational non-decreasing Dyck paths with integer slope
- Title not available (Why is that?)
- Enumerating nested and consecutive partitions
- An alternative method for \(q\)-counting directed column-convex polyominoes.
- A bijection between directed column-convex polyominoes and ordered trees of height at most three
- On column-convex and convex Carlitz polyominoes
- Smooth column convex polyominoes
This page was built for publication: Bijections between directed-column convex polyominoes and restricted compositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6549686)