Related papers: Riordan Paths and Derangements
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…
A vertical recursive relation approach to Riordan arrays is induced, while the horizontal recursive relation is represented by $A$- and $Z$-sequences. This vertical recursive approach gives a way to represent the entries of a Riordan array…
A well-known bijection between Motzkin paths and ordered trees with outdegree always $\le2$, is lifted to Grand Motzkin paths (the nonnegativity is dropped) and an ordered list of an odd number of such $\{0,1,2\}$ trees. This offers an…
We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijections between Motzkin paths and two families of restricted involutions that are counted by Motzkin numbers, namely, involutions avoiding 4321…
We prove a conjecture of Drake and Kim: the number of $2$-distant noncrossing partitions of $\{1,2,...,n\}$ is equal to the sum of weights of Motzkin paths of length $n$, where the weight of a Motzkin path is a product of certain fractions…
We show that Laurent biorthogonal polynomials whose defining three-term recurrence have constant coefficients have coefficient arrays that are Riordan arrays. For each such family of Laurent biorthogonal polynomials we associate in a…
A non-Grassmanian path integral representation is given for the solution of the Klein-Gordon and the Dirac equations. The trajectories of the path integral are rendered differentiable by the relativistic corrections. The nonrelativistic…
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…
We study the involutions belonging to the class of 321 avoiding permutations. We calculate the algebraic generating functions of the set containing the involutions avoiding 321 and of some of its subsets. Precisely we determine the…
We investigate paths in the hexagonal circle packing and enumerate them with respect to width, height, number of steps, area, and kissing number. Functional equations and the kernel method yield closed bivariate generating functions…
A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…
There was recent interest in Motzkin paths without peaks (peak: up-step followed immediately by down-step); additional results about this interesting family is worked out. The new results are the enumeration of such paths that live in a…
We study three operations on Riordan arrays. First, we investigate when the sum of Riordan arrays yields another Riordan array. We characterize the $A$- and $Z$-sequences of these sums of Riordan arrays, and also identify an analog for…
The notion of a Riordan graph was introduced recently, and it is a far-reaching generalization of the well-known Pascal graphs and Toeplitz graphs. However, apart from a certain subclass of Toeplitz graphs, nothing was known on independent…
In this paper, we use the theory of Riordan matrices to introduce the notion of a Riordan graph. The Riordan graphs are a far-reaching generalization of the well known and well studied Pascal graphs and Toeplitz graphs, and also some other…
A Schr\"oder path is a lattice path from $(0,0)$ to $(2n,0)$ with steps $(1,1)$, $(1,-1)$ and $(2,0)$ that never goes below the $x-$axis. A small Schr\"{o}der path is a Schr\"{o}der path with no $(2,0)$ steps on the $x-$axis. In this paper,…
Many polynomial invariants are defined on graphs for encoding the combinatorial information and researching them algebraically. In this paper, we introduce the cycle polynomial and the path polynomial of directed graphs for counting cycles…
The paths on the {\bf R$^3$} real Euclidean manifold are defined as 2-dimensional simplicial strips; points are replaced by 2-simplexes and the orbits of the action of a one discrete-parameter group on the base manifold becomes a convex…
In this paper, we study pattern avoidances of generalized permutations and show that the number of all generalized permutations avoiding $\pi$ is independent of the choice of $\pi\in S_3$, which extends the classic results on permutations…
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…