Related papers: Brick-wall lattice paths and applications
We consider the system of equations $A_k(x)=p(x)A_{k-1}(x)(q(x)+\sum_{i=0}^k A_i(x))$ for $k\geq r+1$ where $A_i(x)$, $0\leq i \leq r$, are some given functions and show how to obtain a close form for $A(x)=\sum_{k\geq 0}A_k(x)$. We apply…
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…
The paper is devoted to the study of lattice paths that consist of vertical steps $(0,-1)$ and non-vertical steps $(1,k)$ for some $k\in \mathbb Z$. Two special families of primary and free lattice paths with vertical steps are considered.…
We find a bijection between bi-banded paths and peak-counting paths, applying to two classes of lattice paths including Dyck paths. Thus we find a new interpretation of Narayana numbers as coefficients of weight polynomials enumerating…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
In data analysis, there is a strong demand for graph metrics that differ from the classical shortest path and resistance distances. Recently, several new classes of graph metrics have been proposed. This paper presents some of them…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…
The set of discrete lattice paths from (0, 0) to (n, n) with North and East steps (i.e. words w $\in$ { x, y } * such that |w| x = |w| y = n) has a canonical monoid structure inherited from the bijection with the set of join-continuous maps…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
The quest for new realizations of higher-order topological system has garnered much recent attention. In this work, we propose a paradigmatic brick lattice model where corner modes requires protection by nonsymmorphic symmetry in addition…
We introduce an equivalence relation on the set of Dyck paths and some operations on them. We determine a formula for the cardinality of those equivalence classes and use this information to obtain a combinatorial formula for the number of…
Polymetric walls are walls built from bricks in more than one size. Architects and builders want to built polymetric walls that satisfy certain structural and aesthetical constraints. In a recent paper by de Jong, Vinduska, Hans and Post…
We study heaps of pieces for lattice paths, which give a combinatorial visualization of lattice paths. We introduce two types of heaps: type $I$ and type $II$. A heap of type $I$ is characterized by peaks of a lattice path. We have a…
The theme of this article is a "reciprocity" between bounded up-down paths and bounded alternating sequences. Roughly speaking, this ``reciprocity" manifests itself by the fact that the extension of the sequence of numbers of paths of…
In this work, we explore the combinatorics arising from the quiver generating series of the unreduced $r$-colored HOMFLY-PT polynomial $\bar{P}_r(a,q)$ for some twist-knots and double twist knots. By taking the limit $a = 0$ and $q = 1$, we…
We establish three identities involving Dyck paths and alternating Motzkin paths, whose proofs are based on variants of the same bijection. We interpret these identities in terms of closed random walks on the halfline. We explain how these…
Considerable progress has recently been made in the development of techniques to exactly determine two-point resistances in networks of various topologies. In particular, two types of method have emerged. One is based on potentials and the…
We discuss the hard-hexagon and hard-square problems, as well as the corresponding problem on the honeycomb lattice. The case when the activity is unity is of interest to combinatorialists, being the problem of counting binary matrices with…
For $\ell \geq 1$ and $k \geq 2$, we consider certain admissible sequences of $k-1$ lattice paths in a colored $\ell \times \ell$ square. We show that the number of such admissible sequences of lattice paths is given by the sum of squares…
We study the path behavior of the symmetric walk on some special comb-type subsets of ${\mathbb Z}^2$ which are obtained from ${\mathbb Z}^2$ by generalizing the comb having finitely many horizontal lines instead of one.