中文
相关论文

相关论文: Rank complement of rational Dyck paths and conjuga…

200 篇论文

For $m,n$ coprime we introduce a new statistic skip on $(m,n)$-rational Dyck paths and give a fast way to compute dinv and skip statistics. We also introduce $(m,n)$-rank words, which are in one-to-one correspondence with $(m,n)$-Dyck…

组合数学 · 数学 2016-11-16 Ryan Kaliszewski , Huilan Li

For integers $n, m$ with $n \geq 1$ and $0 \leq m \leq n$, an $(n,m)$-Dyck path is a lattice path in the integer lattice $\mathbb{Z} \times \mathbb{Z}$ using up steps $(0,1)$ and down steps $(1,0)$ that goes from the origin $(0,0)$ to the…

组合数学 · 数学 2018-01-30 Rosena R. X. Du , Kuo Yu

The notion of $(a,b)$-cores is closely related to rational $(a,b)$ Dyck paths due to Anderson's bijection, and thus the number of $(a,a+1)$-cores is given by the Catalan number $C_a$. Recent research shows that $(a,a+1)$ cores with distinct…

组合数学 · 数学 2017-05-30 Kirill Paramonov

The set of Dyck paths of length $2n$ inherits a lattice structure from a bijection with the set of noncrossing partitions with the usual partial order. In this paper, we study the joint distribution of two statistics for Dyck paths:…

组合数学 · 数学 2012-06-14 Saul A. Blanco , T. Kyle Petersen

We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area,skip,dinv) are given, we have an algorithm to construct…

组合数学 · 数学 2015-10-14 Ryan Kaliszewski , Huilan Li

We study the relationship between rational slope Dyck paths and invariant subsets of $\mathbb Z,$ extending the work of the first two authors in the relatively prime case. We also find a bijection between $(dn,dm)$--Dyck paths and…

组合数学 · 数学 2017-09-28 Eugene Gorsky , Mikhail Mazin , Monica Vazirani

Motivated by the relation holding for the m-generalized Catalan numbers of type A and C, the connection between dominant regions of the m-Shi arrangement of type A and C is investigated. In the same line of thought, a bijection between mn+1…

组合数学 · 数学 2016-10-14 Myrto Kallipoliti , Eleni Tzanaki

Recently Mansour and Shattuck studied $(k,a)$-paths and gave formulas that relate the total number of humps (peaks) in all $(k,a)$-paths to the number of super $(k,a)$-paths. These results generalize earlier results of Regev on Dyck paths…

组合数学 · 数学 2015-05-25 Rosena R. X. Du , Yingying Nie , Xuezhi Sun

In this paper we consider combinatorial numbers $C_{m, k}$ for $m\ge 1$ and $k\ge 0$ which unifies the entries of the Catalan triangles $ B_{n, k}$ and $ A_{n, k}$ for appropriate values of parameters $m$ and $k$, i.e., $B_{n,…

数论 · 数学 2016-02-16 Pedro J. Miana , Hideyuki Ohtsuka , Natalia Romero

We study combinatorial properties of a rational Dyck path by decomposing it into a tuple of Dyck paths. The combinatorial models such as $b$-Stirling permutations, $(b+1)$-ary trees, parenthesis presentations, and binary trees play central…

组合数学 · 数学 2021-04-06 Keiichi Shigechi

The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from $(0,0)$ to $(n,n)$ which is below the diagonal line $y=x$. One way to generalize the definition of Dyck path is…

组合数学 · 数学 2013-04-23 Yukiko Fukukawa

We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…

组合数学 · 数学 2024-03-11 Manosij Ghosh Dastidar , Michael Wallner

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

组合数学 · 数学 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four…

组合数学 · 数学 2008-12-16 Jun Ma , Yeong-Nan Yeh

Hooks are prominent in representation theory (of symmetric groups) and they play a role in number theory (via cranks associated to Ramanujan's congruences). A partition of a positive integer $n$ has a Young diagram representation. To each…

组合数学 · 数学 2015-07-14 Tewodros Amdeberhan , Emily Leven

In this paper, we propose an $(s+d,d)$-abacus for $(s,s+d,\dots,s+pd)$-core partitions and establish a bijection between the $(s,s+d,\dots,s+pd)$-core partitions and the rational Motzkin paths of type $(s+d,-d)$. This result not only gives…

组合数学 · 数学 2020-02-05 Hyunsoo Cho , JiSun Huh , Jaebum Sohn

We continue the study of the rational-slope generalized $q,t$-Catalan numbers $c_{m,n}(q,t)$. We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property…

代数几何 · 数学 2013-12-24 Evgeny Gorsky , Mikhail Mazin

We study four bijections, which are promotion, evacuation, rowmotion, and rowvacuation, on generalized Dyck paths in rational Catalan combinatorics. We define the maps on generalized Dyck paths, which have their origins in maps on Dyck…

组合数学 · 数学 2026-04-01 Keiichi Shigechi

Motivated by independent results of Bizley and Duchon, we study rational Dyck paths and their subset of factor-free elements. On the one hand, we give a bijection between rational Dyck paths and regular Dyck paths with ascents colored by…

组合数学 · 数学 2018-06-26 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

We establish combinatorial interpretations of several identities for the Catalan and Fine numbers and, along the way, we present some new bijections of independent interest. Briefly, we show that C_{n} = 1/(n+1) Sum_{k} (n+1)choose(2k+1)…

组合数学 · 数学 2007-05-23 David Callan
‹ 上一页 1 2 3 10 下一页 ›