نتایج جستجو برای: dyck graphs

تعداد نتایج: 98035  

Journal: :Journal of Combinatorial Theory, Series A 2010

Journal: :Stochastic Models 2022

We consider a model for queue in which only fixed number N of customers can join. Each customer joins the independently at an exponentially distributed time. Assuming further that service times are independent and follow exponential distribution, this system be described as two-dimensional Markov chain on finite triangular region S square lattice. interpret resulting random walk Dyck path is we...

Journal: :Journal of Statistical Mechanics: Theory and Experiment 2004

Journal: :Israel Journal of Mathematics 2008

Journal: :The Electronic Journal of Combinatorics 2005

Journal: :Discrete Mathematics 2004
Petter Brändén

The Narayana numbers are N(n, k) = 1 n ( n k )( n k+1 ) . There are several natural statistics on Dyck paths with a distribution given by N(n, k). We show the equidistribution of Narayana statistics by computing the flag h-vector of J(2×n) in different ways. In the process we discover new Narayana statistics and provide co-statistics for which the Narayana statistics in question have a distribu...

2017

A Mahonian d-function is a Mahonian statistic that can be expressed as a linear combination of vincular pattern statistics of length at most d. Babson and Steingŕımsson classified all Mahonian 3-functions up to trivial bijections and identified many of them with well-known Mahonian statistics in the literature. We prove a host of Mahonian 3-function equidistributions over pattern avoiding sets ...

2011
KARIN BAUR VOLODYMYR MAZORCHUK

We study certain types of ideals in the standard Borel subalgebra of an untwisted affine Lie algebra. We classify these ideals in terms of the root combinatorics and give an explicit formula for the number of such ideals in type A. The formula involves various aspects of combinatorics of Dyck paths and leads to a new interesting integral sequence.

Journal: :Electr. J. Comb. 2011
Hoda Bidkhori Seth Sullivant

We show that the Eulerian-Catalan numbers enumerate Dyck permutations. We provide two proofs for this fact, the first using the geometry of alcoved polytopes and the second a direct combinatorial proof via an Eulerian-Catalan analogue of the Chung-Feller theorem.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید