Related papers: Matrix Identities on Weighted Partial Motzkin Path…
In this paper we present a CAT generation algorithm for Dyck paths with a fixed length n. It is the formalization of a method for the exhaustive generation of this kind of paths which can be described by means of two equivalent strategies.…
Efficient deterministic algorithms to construct representations of lattice path matroids over finite fields are presented. They are built on known constructions of hierarchical secret sharing schemes, a recent characterization of…
We present an algorithm to express Wilson lines that are defined on piecewise linear paths in function of their individual segments, reducing the number of diagrams needed to be calculated. The important step lies in the observation that…
We show that weighted path orders are special instances of a variant of semantic path orders. Exploiting this fact, we introduce a generalization of weighted path orders that goes beyond the realm of simple termination. Experimental data…
We obtain new combinatorial identities for integral values of binary Krawtchouk polynomials $K^{2m}_p(x)$, $0\le p\le 2m$, by computing the characters of the $p$-exterior representations on certain elements of order 2 of $\mathrm{SO}(2m)$.…
In the 1980s, Viennot developed a combinatorial approach to studying mixed moments of orthogonal polynomials using Motzkin paths. Recently, an alternative combinatorial model for these mixed moments based on lecture hall paths was…
In recent years, A. Grigor'yan, Y. Lin, Y. Muranov and S.T. Yau [6, 7, 8, 9] constructed a path homology theory for digraphs. Later, S. Chowdhury and F. Memoli [3] studied the persistent path homology for directed networks. In this paper,…
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if $w_{n,k,m}$ is the number of Dyck paths of semilength $n$ with $k$…
We analyze a weighted convolution of Catalan numbers $$ \sum_{k=0}^{n} \binom{2k}{k}\binom{2(n-k)}{n-k} a^k = \sum_{k=0}^{n} (k+1)(n-k+1) C_k C_{n-k} a^k, $$ emphasizing its combinatorial, analytic, and probabilistic aspects. We derive a…
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…
Rational Dyck paths are the rational generalization of classical Dyck paths. They play an important role in Catalan combinatorics, and have multiple applications in algebra and geometry. Two statistics over rational Dyck paths called run…
Two path integral representations for the $T$-matrix in nonrelativistic potential scattering are derived and proved to produce the complete Born series when expanded to all orders. They are obtained with the help of "phantom" degrees of…
There are two bijections from unit interval orders on $n$ elements to Dyck paths from $(0,0)$ to $(n,n)$. One is to consider the pairs of incomparable elements, which form the set of boxes between some Dyck path and the diagonal. Another is…
In this note, we explore links between Riordan arrays and lattice paths. We begin by describing Riordan arrays, and some of their generalizations, including rectifications and triangulations. We the consider Riordan array links to lattice…
We introduce a new model of interacting spin 1/2. It describes interaction of three nearest neighbors. The Hamiltonian can be expressed in terms of Fredkin gates. The Fredkin gate (also known as the CSWAP gate) is a computational circuit…
We show that with any finite partially ordered set one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is…
We are concerned with counting self-conjugate $(s,s+1,s+2)$-core partitions. A Motzkin path of length $n$ is a path from $(0,0)$ to $(n,0)$ which stays above the $x$-axis and consists of the up $U=(1,1)$, down $D=(1,-1)$, and flat $F=(1,0)$…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
We give some interpretations to certain integer sequences in terms of parameters on Grand-Dyck paths and coloured noncrossing partitions, and we find some new bijections relating Grand-Dyck paths and signed pattern avoiding permutations.…
This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number…