English
Related papers

Related papers: On Weighted and Bounded Multidimensional Catalan N…

200 papers

This paper concentrates on the set $\mathcal{V}_n$ of weighted Dyck paths of length $2n$ with special restrictions on the level of valleys. We first give its explicit formula of the counting generating function in terms of certain weight…

Combinatorics · Mathematics 2021-12-28 Yidong Sun , Qianqian Liu , Yanxin Liu

We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…

Combinatorics · Mathematics 2015-09-28 Jose Eduardo Blazek

Parametric path problems arise independently in diverse domains, ranging from transportation to finance, where they are studied under various assumptions. We formulate a general path problem with relaxed assumptions, and describe how this…

Data Structures and Algorithms · Computer Science 2021-06-08 Prerona Chatterjee , Kshitij Gajjar , Jaikumar Radhakrishnan , Girish Varma

In this paper, we exhibit explicitly a sequence of $2\times2$ matrix valued orthogonal polynomials with respect to a weight $W_{p,n}$, for any pair of real numbers $p$ and $n$ such that $0<p<n$. The entries of these polynomiales are…

Representation Theory · Mathematics 2016-04-22 Inés Pacharoni , Ignacio Zurrián

Generalizing previous results, we introduce and study a new statistic on words, that we call rectangle capacity. For two fixed positive integers $r$ and $s$, this statistic counts the number of occurrences of a rectangle of size $r\times s$…

Combinatorics · Mathematics 2024-05-14 Sela Fried , Toufik Mansour

We present determinantal representations of the Catalan numbers, k-Fuss-Catalan numbers, and its generalized number. The entries of the normalized Hessenberg matrices are the binomial coefficients that related with the enumeration of…

Combinatorics · Mathematics 2018-10-23 Jishe Feng

The article contains some important classes of multisets. Combinatorial proofs of problems on the number of m-submultisets and m-permutations of multiset elements are considered and effective algorithms for their calculation are given. In…

General Mathematics · Mathematics 2020-09-04 Oleksandr Makhnei , Roman Zatorskii

We provide an explicit formulation for the solution to the Catalan's triangle system using Catalan's trapezoids and a specified boundary condition. Additionally, we study this system with various boundary conditions obtained by utilizing…

Combinatorics · Mathematics 2024-03-01 Yungang Lu

In this (partly expository) paper we give a short overview about the close relationship between the sequence of Catalan numbers and Hankel determinants from the point of view of orthogonal polynomials and show that an analogous situation…

Combinatorics · Mathematics 2021-05-04 Johann Cigler

Let $X$ be an analytic space of pure dimension. We introduce a formalism to generate intrinsic weighted Koppelman formulas on $X$ that provide solutions to the $\dbar$-equation. We obtain new existence results for the $\dbar$-equation, as…

Complex Variables · Mathematics 2011-02-21 Mats Andersson , Håkan Samuelsson

We present some old and new results in the enumeration of random walks in one dimension, mostly developed in works of enumerative combinatorics. The relation between the trace of the $n$-th power of a tridiagonal matrix and the enumeration…

Statistical Mechanics · Physics 2009-10-31 G. M. Cicuta , M. Contedini , L. Molinari

We study the statistics area, bounce and dinv on the set of parallelogram polyominoes having a rectangular m times n bounding box. We show that the bi-statistics (area, bounce) and (area, dinv) give rise to the same q,t-analogue of Narayana…

Combinatorics · Mathematics 2013-01-22 Jean-Christophe Aval , Michele D'Adderio , Mark Dukes , Angela Hicks , Yvan Le Borgne

In this note, we show how to define certain Riordan arrays, that we call the Fuss-Catalan-Riordan arrays, by means of a special family of $d$-orthogonal polynomials. We relate the Fuss-Catalan Riordan arrays to the Fuss Catalan numbers, and…

Combinatorics · Mathematics 2025-05-23 Paul Barry

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)…

Combinatorics · Mathematics 2007-05-23 David Callan

Recent work of the author connected several parking function enumeration problems to enumerations of Catalan paths with respect to certain weight functions that are expressed in terms of the ascent lengths. Motivated by this, we generalise…

Combinatorics · Mathematics 2025-09-17 Jun Yan

We establish new upper bounds for the numerical radius of bounded linear operators on a complex Hilbert space by introducing weighted geometric means of the modulus of an operator and its adjoint. This approach yields a family of…

Functional Analysis · Mathematics 2026-02-05 Shankhadeep Mondal , Ram Narayan Mohapatra , Kasun Tharuka Dewage

The aim of this paper is the introduction of a new method for the numerical computation of the rank of a three-way array. We show that the rank of a three-way array over R is intimately related to the real solution set of a system of…

Computation · Statistics 2009-06-02 Vartan Choulakian

The classic Dyck triangle, the Catalan triangle, and the Catalan convolution matrix are plane projections of the multidimensional Dyck triangle. In the Dyck path, each node is uniquely determined by two of four interrelated parameters: (i)…

Combinatorics · Mathematics 2020-10-02 Gennady Eremin

In this paper we determine the parity of some sequences which are related to Catalan numbers. Also we introduce a combinatorical object called, \Catalan tree", and discuss its properties.

Combinatorics · Mathematics 2011-06-28 Volkan Yildiz

We say that a diagonal in an array is {\em $\lambda$-balanced} if each entry occurs $\lambda$ times. Let $L$ be a frequency square of type $F(n;\lambda^m)$; that is, an $n\times n$ array in which each entry from $\{1,2,\dots ,m\}$ occurs…

Combinatorics · Mathematics 2018-02-06 Nicholas Cavenagh , Adam Mammoliti