Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees
نویسنده
چکیده
In this paper we compute the number of reduced decompositions of certain permutations ∈ Sn as a product of transpositions (1; 2), (1; 3), : : :, (1; n). We present several combinatorial correspondences between these decompositions and combinatorial objects such as Catalan paths and k-ary trees. c © 1999 Elsevier Science B.V. All rights reserved
منابع مشابه
A Refinement of the Formula for k-ary Trees and the Gould-Vandermonde's Convolution
In this paper, we present an involution on some kind of colored k-ary trees which provides a combinatorial proof of a combinatorial sum involving the generalized Catalan numbers Ck,γ(n) = γ kn+γ ( kn+γ n ) . From the combinatorial sum, we refine the formula for k-ary trees and obtain an implicit formula for the generating function of the generalized Catalan numbers which obviously implies a Van...
متن کاملGeneralized Catalan numbers and the enumeration of planar embeddings
The Raney numbers Rp,r(k) are a two-parameter generalization of the Catalan numbers that were introduced by Raney in his investigation of functional composition patterns. We give a new combinatorial interpretation for the Raney numbers in terms of planar embeddings of certain collections of trees, a construction that recovers the usual interpretation of the p-Catalan numbers in terms of p-ary t...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملStaircase tilings and k-Catalan structures
Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that is enumerated by the k-Catalan numbers, staircase tilings. We give a bijection between staircase tilings and k-good paths, and between k-good paths and k-ary trees. In addition, we enumerate k-ary paths according to D...
متن کاملDyck paths and restricted permutations
This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and Sn(321) and Sn(231), respectively. We also discuss permutations in Sn avoiding two patterns, one of length 3 and the other of length k. These permutations produce a kind of discrete continuity between the Motzkin and the Catalan n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 204 شماره
صفحات -
تاریخ انتشار 1999