Staircase tilings and k-Catalan structures

DOI10.1016/J.DISC.2007.11.012MaRDI QIDQ998328zbMATHOpenAlexFDO

Authors Silvia Heubach, Nelson Y. Li, Toufik Mansour

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 numberset-valued Young tableaustaircase tiling

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of representation theory (05E10)

Recommendations

• Staircase tilings and lattice paths
• Generalized Path Pairs and Fuss-Catalan Triangles
• ON THE (n, k)-TH CATALAN NUMBERS
• scientific article; zbMATH DE number 2077675
• Modular Catalan numbers

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• scientific article; zbMATH DE number 4025461 (Why is no real title available?)
• scientific article; zbMATH DE number 4035870 (Why is no real title available?)
• scientific article; zbMATH DE number 3712896 (Why is no real title available?)
• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1043915 (Why is no real title available?)
• scientific article; zbMATH DE number 2077645 (Why is no real title available?)
• scientific article; zbMATH DE number 2077678 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
• A general bijective algorithm for increasing trees
• An application of $m$-ary trees to the design of data structures for geometric searching problems
• Bijections for ternary trees and non-crossing trees
• Catalan numbers, their generalization, and their uses
• Diagonally convex directed polyominoes and even trees: A bijection and related issues
• Dyck path enumeration
• Enumeration of \(K\)-trees and applications
• Enumeration of noncrossing trees on a circle
• Euler Coefficients and Restricted Dyck Paths
• GENERALIZED CATALAN NUMBERS, WEYL GROUPS AND ARRANGEMENTS OF HYPERPLANES
• Generating t-Ary Trees Lexicographically
• Generating t-ary trees in A-order
• Generation oft-ary trees with Ballot-sequences^*
• Ideals and quotients of \(B\)-quasisymmetric polynomials
• Lexicographic Enumeration of k-ary Trees
• On Level Numbers of t-Ary Trees
• On a refinement of the generalized Catalan numbers for Weyl groups
• On the Number of Subtrees of a Symmetricn-Ary Tree
• On the number of \(t\)-ary trees with a given path length
• Ranking and Listing Algorithms for k-Ary Trees
• Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• Staircase tilings and lattice paths
• The On-Line Encyclopedia of Integer Sequences
• The statistic ``number of udu's in Dyck paths

Cited in

(30)

• Enumerations of humps and peaks in \((k, a)\)-paths and \((n, m)\)-Dyck paths via bijective proofs
• Some properties of the Fuss-Catalan numbers
• The \(m\)-Schröder paths and \(m\)-Schröder numbers
• Lattice paths and generalized cluster complexes
• Bijections on \(r\)-Shi and \(r\)-Catalan arrangements
• Factorizations related to the reciprocal Pascal matrix
• Generation, ranking and unranking of ordered trees with degree bounds
• Enumeration of generalized Dyck paths based on the height of down-steps modulo \(k\)
• scientific article; zbMATH DE number 7732138 (Why is no real title available?)
• Modular Fuss-Catalan numbers
• Enumerations of rational non-decreasing Dyck paths with integer slope
• scientific article; zbMATH DE number 6989305 (Why is no real title available?)
• Fibonacci and Catalan paths in a wall
• A family of Bell transformations
• On the enumeration of non-crossing pairings of well-balanced binary strings
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Critical behavior of colored tensor models in the large \(N\) limit
• Enumeration of the Motzkin paths above a line of rational slope
• Protected points in \(k\)-ary trees
• The dual of number sequences, Riordan polynomials, and Sheffer polynomials
• Generalized Path Pairs and Fuss-Catalan Triangles
• Counting humps and peaks in generalized Motzkin paths
• scientific article; zbMATH DE number 7471114 (Why is no real title available?)
• Set-valued tableaux and generalized Catalan numbers
• Set-Valued Young Tableaux and Product-Coproduct Prographs
• Colored Motzkin paths of higher order
• Jeu de taquin of set-valued Young tableaux
• Staircase tilings and lattice paths
• Raney numbers, threshold sequences and Motzkin-like paths
• Refined enumeration of \(k\)-plane trees and \(k\)-noncrossing trees

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Staircase tilings and \(k\)-Catalan structures

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