Related papers: Notes on Riordan arrays and lattice paths
This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…
We explore a data structure that generalises rectangular multi-dimensional arrays. The shape of an n-dimensional array is typically given by a tuple of n natural numbers. Each element in that tuple defines the length of the corresponding…
Transports along path in fibre bundles are axiomatically introduced. Their general functional form and some their simple properties are investigated. The relationships of the transports along paths and lifting of paths are studied.
Walks on Young's lattice of integer partitions encode many objects of algebraic and combinatorial interest. Chen et al. established connections between such walks and arc diagrams. We show that walks that start at $\varnothing$, end at a…
We translate the concept of succession rule and the ECO method into matrix notation, introducing the concept of a production matrix. This allows us to combine our method with other enumeration techniques using matrices, such as the method…
The Martin boundary associated with the simple random walk on an example of partially oriented lattice is shown to be trivial by computing fine estimates of the Green kernel.
Consider an $m\times n$ table $T$ and latices paths $\nu_1,\ldots,\nu_k$ in $T$ such that each step $\nu_{i+1}-\nu_i=(1,1)$, $(1,0)$ or $(1,-1)$. The number of paths from the $(1,i)$-blank (resp. first column) to the $(s,t)$-blank is…
Two subfamilies of Motzkin paths, with the same numbers of up, down, horizontal steps were known to be equinumerous with ternary trees and related objects. We construct a bijection between these two families that does not use any auxiliary…
We start with an ``algebraic'' RSK-correspondence due to Noumi and Yamada. Given a matrix $X$, we consider a pyramidal array of solid minors of $X$. It turns out that this array satisfies an algebraic variant of octahedron recurrence. The…
In a random linear graph, vertices are points on a line, and pairs of vertices are connected, independently, with a link probability that decreases with distance. We study the problem of reconstructing the linear embedding from the graph,…
We consider the following problem : we have a high-resolution street network of a given city, and low-resolution measurements of traffic within this city. We want to associate to each measurement the set of streets corresponding to the…
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…
In analyzing balanced parentheses, we consider a group of related variables in Dyck paths. In the four-dimensional space, the Dyck triangle is constructed, i.e. an integer lattice with Dyck paths.
Random walks of particles on a lattice are a classical paradigm for the microscopic mechanism underlying diffusive processes. In deterministic walks, the role of space and time can be reversed, and the microscopic dynamics can produce quite…
The main goal of this paper is to introduce and to investigate properties of generalized Riordan arrays and generalized Riordan groups that involve formal semi-Laurent series. In particular, we focus on the problem of isomorphy of…
Motzkin paths consist of up-steps, down-steps, level-steps, and never go below the $x$-axis. They return to the $x$-axis at the end. The concept of skew Dyck path \cite{Deutsch-italy} is transferred to skew Motzkin paths, namely, a left…
The aim of this paper is twofold. First, we demonstrate how Riordan matrices can be employed to connect well-known concepts in geometric combinatorics, such as $f$-vectors, $h$-vectors $\gamma$-vectors, in a similar fashion to the McMullen…
We introduce the notion of recurrence and transience for graphs over non-Archimedean ordered field. To do so we relate these graphs to random walks of directed graphs over the reals. In particular, we give a characterization of the real…
We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…
A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…