Staircase tilings and \(k\)-Catalan structures

DOI10.1016/j.disc.2007.11.012zbMath1158.05006MaRDI QIDQ998328

Silvia Heubach, Toufik Mansour, Nelson Y. Li

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.012

zbMATH Keywords

\(k\)-ary tree; \(k\)-ary number; \(k\)-Catalan number; set-valued Young tableau; staircase tiling

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05E10: Combinatorial aspects of representation theory

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Unnamed Item, Unnamed Item, Factorizations related to the reciprocal Pascal matrix, Set-Valued Tableaux & Generalized Catalan Numbers, Set-Valued Young Tableaux and Product-Coproduct Prographs, Unnamed Item, Unnamed Item, Colored Motzkin Paths of Higher Order, Generalized Path Pairs and Fuss-Catalan Triangles, Unnamed Item, On the enumeration of non-crossing pairings of well-balanced binary strings, Protected points in \(k\)-ary trees, Critical behavior of colored tensor models in the large \(N\) limit, Lattice paths and generalized cluster complexes, A family of Bell transformations, Bijections on \(r\)-Shi and \(r\)-Catalan arrangements, Enumerations of rational non-decreasing Dyck paths with integer slope, The dual of number sequences, Riordan polynomials, and Sheffer polynomials, Raney numbers, threshold sequences and Motzkin-like paths, The \(m\)-Schröder paths and \(m\)-Schröder numbers, Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order, Some properties of the Fuss-Catalan numbers, Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs, Counting humps and peaks in generalized Motzkin paths, Modular Fuss-Catalan numbers, Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ideals and quotients of \(B\)-quasisymmetric polynomials
• On the number of \(t\)-ary trees with a given path length
• Generating t-ary trees in A-order
• Catalan numbers, their generalization, and their uses
• Dyck path enumeration
• Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
• Enumeration of noncrossing trees on a circle
• Enumeration of \(K\)-trees and applications
• Bijections for ternary trees and non-crossing trees
• Diagonally convex directed polyominoes and even trees: A bijection and related issues
• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• The statistic ``number of udu's in Dyck paths
• On Level Numbers of t-Ary Trees
• Lexicographic Enumeration of k-ary Trees
• Ranking and Listing Algorithms for k-Ary Trees
• Generating t-Ary Trees Lexicographically
• Generation oft-ary trees with Ballot-sequences^*
• An application of $m$-ary trees to the design of data structures for geometric searching problems
• On a refinement of the generalized Catalan numbers for Weyl groups
• GENERALIZED CATALAN NUMBERS, WEYL GROUPS AND ARRANGEMENTS OF HYPERPLANES
• Euler Coefficients and Restricted Dyck Paths
• On the Number of Subtrees of a Symmetricn-Ary Tree
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order