English
Related papers

Related papers: Matrix Identities on Weighted Partial Motzkin Path…

200 papers

Recently, several authors have considered lattice paths with various steps, including vertical steps permitted. In this paper, we consider a kind of generalized Motzkin paths, called {\it G-Motzkin paths} for short, that is lattice paths…

Combinatorics · Mathematics 2022-01-25 Yidong Sun , Di Zhao , Wenle Shi , Weichen Wang

For an integer $p\geq 2$ we construct vertical and horizontal one-pth Riordan arrays from a Riordan array. When $p=2$, one-pth Riordan arrays reduced to well known half Riordan arrays. The generating functions of the $A$-sequences of…

Combinatorics · Mathematics 2021-01-19 Tian-Xiao He

We present a method for obtaining congruences modulo powers of 3 for sequences given by recurrences of finite depth with polynomial coefficients. We apply this method to Catalan numbers, Motzkin numbers, Riordan numbers, Schr\"oder numbers,…

Combinatorics · Mathematics 2013-08-14 Christian Krattenthaler , Thomas W. Müller

We construct an explicit vector space basis in terms of bivariate Vandermonde determinants for the alternating component of the diagonal coinvariant ring $DR_n$, answering a question of Stump. As a Corollary, we recover the combinatorial…

Combinatorics · Mathematics 2025-11-12 Yuhan Jiang

We introduce a general method for obtaining fixed-parameter algorithms for problems about finding paths in undirected graphs, where the length of the path could be unbounded in the parameter. The first application of our method is as…

Data Structures and Algorithms · Computer Science 2022-07-18 Fedor V. Fomin , Petr A. Golovach , Tuukka Korhonen , Kirill Simonov , Giannos Stamoulis

We exhibit a bijection between Dyck paths and alternating sign matrices which are determined by their antidiagonal sums.

Combinatorics · Mathematics 2017-07-24 Martin Rubey

In queuing theory, it is usual to have some models with a "reset" of the queue. In terms of lattice paths, it is like having the possibility of jumping from any altitude to zero. These objects have the interesting feature that they do not…

Combinatorics · Mathematics 2023-06-22 Cyril Banderier , Michael Wallner

In this paper we formulate combinatorial identities that give representation of positive integers as linear combination of even powers of 2 with binomial coefficients. We present side by side combinatorial as well as computer generated…

Number Theory · Mathematics 2007-09-14 George Grossman , Aklilu Zeleke , Akalu Tefera

We propose a method to obtain the optimal weight function of 9 paths in (3+1)D space-time whose length is less than or equal to $2\times (6+2)$ lattice units. The factor 2 comes from inclusion of opposite direction path or time reversed…

High Energy Physics - Lattice · Physics 2024-06-24 Sadataka Furui , Serge Dos Santos

This paper examines the recursive sequence of polynomials $p_n(x)$, defined by $p_0(x) = x^2 - 2$ and $p_n(x) = p_{n-1}(x)^2 - 2$ for $n \geq 1$. It describes the field-theoretic motivations behind this sequence, derives a recursive formula…

Combinatorics · Mathematics 2025-01-24 Sophie Marques , Elizabeth Mrema

Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…

Rings and Algebras · Mathematics 2024-06-04 Rosa Preiß

We give combinatorial interpretations of several related identities associated with the names Barrucand, Strehl and Franel, including one for the Apery numbers. The combinatorial constructs employed are derangement-type card deals as…

Combinatorics · Mathematics 2008-12-31 David Callan

In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…

Discrete Mathematics · Computer Science 2013-12-30 Rodrigo De Castro , Andrés L. Ramírez , José L. Ramírez

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…

Combinatorics · Mathematics 2026-04-01 Keiichi Shigechi

We construct a bijection from permutations to some weighted Motzkin paths known as Laguerre histories. As one application of our bijection, a neat $q$-$\gamma$-positivity expansion of the $(\inv,\exc)$-$q$-Eulerian polynomials is obtained.

Combinatorics · Mathematics 2019-02-06 Sherry H. F. Yan , Hao Zhou , Zhicong Lin

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 study a class of observables in four-dimensional superconformal Yang--Mills theories which, in the planar limit at finite 't Hooft coupling, can be expressed as determinants of semi-infinite matrices built from Bessel functions. This…

High Energy Physics - Theory · Physics 2025-08-29 G. P. Korchemsky

In this paper we use matrices, whose entries satisfy certain linear conditions, to obtain composition identities $f(x_i)f(y_i)=f(z_i)$, where $f(x_i)$ is an irreducible form, with integer coefficients, of degree $n$ in $n$ variables ($n$…

Number Theory · Mathematics 2020-05-18 Ajai Choudhry

We give an identity which is conjectured and proved by using an implementation in Multi-WZ.

Combinatorics · Mathematics 2007-05-23 Akalu Tefera

Two subclasses of Motzkin paths, S-Motzkin and T-Motzkin paths, are introduced. We provide bijections between S-Motzkin paths and ternary trees, S-Motzkin paths and non-crossing trees, and T-Motzkin paths and ordered pairs of ternary trees.…

Combinatorics · Mathematics 2019-02-06 Helmut Prodinger , Sarah J. Selkirk , Stephan Wagner