Staircase tilings and k-Catalan structures

DOI10.1016/J.DISC.2007.11.012zbMATH Open1158.05006OpenAlexW2020459909MaRDI QIDQ998328FDOQ998328

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 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)

Cites Work

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

Cited In (29)

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

Uses Software

• OEIS

   Recommendations

• Staircase tilings and lattice paths
• Generalized Path Pairs and Fuss-Catalan Triangles
• ON THE (n, k)-TH CATALAN NUMBERS
• [[:Publication:4472719|Title not available (Why is that?)]]
• Modular Catalan numbers

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)