中文
相关论文

相关论文: Matrix Identities on Weighted Partial Motzkin Path…

200 篇论文

We study the higher-order Euler polynomials and give the corresponding monic orthogonal polynomials, which are Meixner-Pollaczek polynomials with certain arguments and constant factors. Moreover, through a general connection between moments…

组合数学 · 数学 2018-08-14 Lin Jiu , Diane Yahui Shi

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

A few years ago Foda, Quano, Kirillov and Warnaar proposed and proved various finite analogs of the celebrated Andrews-Gordon identities. In this paper we use these polynomial identities along with the combinatorial techniques introduced in…

组合数学 · 数学 2007-05-23 Alexander Berkovich , Peter Paule

In this article we obtain a general polynomial identity in $k$ variables, where $k\geq 2$ is an arbitrary positive integer. We use this identity to give a closed-form expression for the entries of the powers of a $k \times k$ matrix.…

组合数学 · 数学 2019-01-01 James Mc Laughlin , B. Sury

The number of down-steps between pairs of up-steps in $k_t$-Dyck paths, a generalization of Dyck paths consisting of steps $\{(1, k), (1, -1)\}$ such that the path stays (weakly) above the line $y=-t$, is studied. Results are proved…

组合数学 · 数学 2023-06-22 Andrei Asinowski , Benjamin Hackl , Sarah J. Selkirk

We study the two statistics, the inversion number and the major index, on Catalan combinatorial objects such as $r$-Dyck paths, $r$-Stirling permutations, non-crossing partitions, Dyck tilings, and symmetric Dyck paths. We show that they…

组合数学 · 数学 2024-07-25 Keiichi Shigechi

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

组合数学 · 数学 2007-05-23 Andrei Asinowski , Toufik Mansour

An interpretation of Krawtchouk matrices in terms of discrete version of the Feynman path integral is given. Also, an algebraic characterization in terms of the algebra of split quaternions is provided. The resulting properties include an…

群论 · 数学 2016-04-04 Jerzy Kocik

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

组合数学 · 数学 2014-04-21 Christine Bessenrodt , Richard P. Stanley

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

离散数学 · 计算机科学 2009-02-09 Krassimir Yankov Iordjev , Dimiter Stoichkov Kovachev

A generalized Motzkin path, called G-Motzkin path for short, of length $n$ is a lattice path from $(0, 0)$ to $(n, 0)$ in the first quadrant of the XOY-plane that consists of up steps $\mathbf{u}=(1, 1)$, down steps $\mathbf{d}=(1, -1)$,…

组合数学 · 数学 2022-04-19 Yidong Sun , Cheng Sun , Xiuli Hao

The vertex set of the kth cartesian power of a directed cycle of length m can be naturally identified with the set of k-tuples of integers modulo m. For any two vertices v and w of this graph, it is easy to see that if there is a…

组合数学 · 数学 2007-05-23 David Austin , Heather Gavlas , Dave Witte

In this note, we show that to each elliptic curve of the form $$y^2-axy-y=x^3-bx^2-cx,$$ we can associate a family of lattice paths whose step set is determined by the parameters of the elliptic curve. The enumeration of these lattice paths…

组合数学 · 数学 2025-07-23 Paul Barry

A generalized Motzkin path, called G-Motzkin path for short, of length $n$ is a lattice path from $(0, 0)$ to $(n, 0)$ in the first quadrant of the XOY-plane that consists of up steps $\mathbf{u}=(1, 1)$, down steps $\mathbf{d}=(1, -1)$,…

组合数学 · 数学 2022-01-25 Yidong Sun , Weichen Wang , Cheng Sun

We enumerate the edges in the Hasse diagram of several lattices arising in the combinatorial context of lattice paths. Specifically, we will consider the case of Dyck, Grand Dyck, Motzkin, Grand Motzkin, Schr\"oder and Grand Schr\"oder…

组合数学 · 数学 2012-04-02 Luca Ferrari , Emanuele Munarini

We revisit certain path-lifting and path-continuation properties of abstract maps as described in the work of F. Browder and R. Rheindboldt in 1950-1960s, and apply their elegant theory to exponential maps. We obtain thereby a number of…

微分几何 · 数学 2021-08-02 Ivan P. Costa e Silva , José L. Flores , Kledilson P. R. Honorato

We introduce a new concept of permutation avoidance pattern called hatted pattern, which is a natural generalization of the barred pattern. We show the growth rate of the class of permutations avoiding a hatted pattern in comparison to…

组合数学 · 数学 2012-08-07 Phan Thuan Do , Dominique Rossin , Thi Thu Huong Tran

We characterize the quotients among lattice path matroids (LPMs) in terms of their diagrams. This characterization allows us to show that ordering LPMs by quotients yields a graded poset, whose rank polynomial has the Narayana numbers as…

组合数学 · 数学 2024-01-17 Carolina Benedetti , Kolja Knauer

We present a differential-calculus-based method which allows one to derive more identities from {\it any} given Fibonacci-Lucas identity containing a finite number of terms and having at least one free index. The method has two {\it…

数论 · 数学 2023-12-06 Kunle Adegoke

We give a combinatorial interpretation of vector continued fractions obtained by applying the Jacobi-Perron algorithm to a vector of $p\geq 1$ resolvent functions of a banded Hessenberg operator of order $p+1$. The interpretation consists…

组合数学 · 数学 2023-05-09 Abey López-García , Vasiliy A. Prokhorov