Staircase tilings and \(k\)-Catalan structures
type: Item
instance of: scholarly article
title: Staircase tilings and \(k\)-Catalan structures
zbMATH Open document ID: 1158.05006
author: Silvia Heubach
author: Nelson Y. Li
author: Toufik Mansour
published in: Discrete Mathematics
publication date: 2009-01-28T00:00:00Z
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05E10
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5499737
zbMATH Keywords: \(k\)-ary tree
zbMATH Keywords: \(k\)-ary number
zbMATH Keywords: \(k\)-Catalan number
zbMATH Keywords: set-valued Young tableau
zbMATH Keywords: staircase tiling
describes a project that uses: OEIS
MaRDI profile type: Publication
full work available at URL: j.disc.2007.11.012
OpenAlex ID: W2020459909
cites work: Generation oft-ary trees with Ballot-sequences*
cites work: GENERALIZED CATALAN NUMBERS, WEYL GROUPS AND ARRANGEMENTS OF HYPERPLANES
cites work: On a refinement of the generalized Catalan numbers for Weyl groups
cites work: Ideals and quotients of \(B\)-quasisymmetric polynomials
cites work: A Littlewood-Richardson rule for the \(K\)-theory of Grassmannians.
cites work: A general bijective algorithm for increasing trees
cites work: Dyck path enumeration
cites work: Diagonally convex directed polyominoes and even trees: A bijection and related issues
cites work: Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
cites work: Lexicographic Enumeration of k-ary Trees
cites work: Q3669422
cites work: Q3429499
cites work: Catalan numbers, their generalization, and their uses
cites work: Q4472686
cites work: Enumeration of \(K\)-trees and applications
cites work: Q5585020
cites work: On the Number of Subtrees of a Symmetricn-Ary Tree
cites work: Euler Coefficients and Restricted Dyck Paths
cites work: Q3903764
cites work: On Level Numbers of t-Ary Trees
cites work: Enumeration of noncrossing trees on a circle
cites work: Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and \(k\)-ary trees
cites work: Bijections for ternary trees and non-crossing trees
cites work: Generating t-ary trees in A-order
cites work: Generating t-Ary Trees Lexicographically
cites work: On the number of \(t\)-ary trees with a given path length
cites work: Q4346817
cites work: The On-Line Encyclopedia of Integer Sequences
cites work: Q4344108
cites work: Q4236280
cites work: The statistic ``number of udu's'' in Dyck paths
cites work: Q3767362
cites work: An application of $m$-ary trees to the design of data structures for geometric searching problems
cites work: Ranking and Listing Algorithms for k-Ary Trees
cites work: Q3775582
cites work: Q3995745
cites work: Q4472722
DOI: 10.1016/J.DISC.2007.11.012
description: scientific article; zbMATH DE number 5499737