Enumeration of Fuss-Schröder paths

نویسندگان

  • Suhyung An
  • JiYoon Jung
  • Sangwook Kim
چکیده

In this paper we enumerate the number of (k, r)-Fuss-Schröder paths of type λ. Y. Park and S. Kim studied small Schröder paths with type λ. Generalizing the results to small (k, r)-Fuss-Schröder paths with type λ, we give a combinatorial interpretation for the number of small (k, r)-Fuss-Schröder paths of type λ by using Chung-Feller style. We also give two sets of sparse noncrossing partitions of [2(k + 1)n+1] and [2(k+1)n+2] which are in bijection with the set of all small and large, respectively, (k, r)-Fuss-Schröder paths of type λ.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

1 6 M ay 2 00 8 Schröder Paths and Pattern Avoiding Partitions

In this paper, we introduce labelling schemes for certain Schröder paths. The two labelling schemes provide bijections between Schröder paths without up steps followed immediately by horizontal steps and τ-avoiding partitions, where τ ∈ {12312, 12321}, and it is exciting to see that some partition statistics can be translated to statistics of the corresponding Schröder paths. As a consequence, ...

متن کامل

Schröder Paths and Pattern Avoiding Partitions Sherry

In this paper, we show that both 12312-avoiding partitions and 12321-avoiding partitions of the set [n + 1] are in one-to-one correspondence with Schröder paths of semilength n without peaks at even level. As a consequence, the refined enumeration of 12312-avoiding (resp. 12321-avoiding) partitions according to the number of blocks can be reduced to the enumeration of certain Schröder paths acc...

متن کامل

Enumeration of edges in some lattices of paths

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schröder and Grand Schröder lattices. Finally, we give a general formula for the number of edges in an arbitrary Young lattice (which can be interpreted in a natural way as a lattice of paths). 1 Pa...

متن کامل

Symmetric Schröder paths and restricted involutions

Let Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns Ak. We present a bijection between symmetric Schröder paths of length 2n and involutions of length n + 1 avoiding A4. Statistics such as the number of right-to-left maxima and fixed points of the involution correspond to the number of ste...

متن کامل

2-Binary trees: Bijections and related issues

A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary trees, non-crossing trees, Schröder paths, Motzkin paths and Dyck paths. We also obtain a number of enumeration results with respect to certain st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017