Related papers: Lattice paths inside a table, I

In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice…

The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from $(0,0)$ to $(n,n)$ which is below the diagonal line $y=x$. One way to generalize the definition of Dyck path is…

Let M(n,k,r,s) be the number of ordered paths in the plane, with unit steps E or N, that intersect k times in which the first path ends at the point (r,n-r) and the second path ends at the point (s,n-s). Our main object of study in this…

Let \Gamma=<\alpha, \beta > be a numerical semigroup. In this article we consider several relations between the so-called \Gamma-semimodules and lattice paths from (0,\alpha) to (\beta,0): we investigate isomorphism classes of…

It is a classical result in combinatorics that among lattice paths with 2m steps U=(1,1) and D=(1,-1) starting at the origin, the number of those that do not go below the x-axis equals the number of those that end on the x-axis. A much more…

Let $W_d(n)$ be the number of $2n$-step walks in $\mathbb{Z}^d$ which begin and end at the origin. We study the exponent of $2$ in the prime factorisation of this number; i.e., $w_d(n) = \nu_2(W_d(n))$. We show that, for each $d$, there is…

The Young--Fibonacci graph is the Hasse diagram of one of the two (along with the Young lattice) 1-differential graded modular lattices. This explains the interest to path enumeration problems in this graph. We obtain a formula for the…

Inspired by a new mathematical model for bobbin lace, this paper considers finite lattice paths formed from the set of step vectors $\mathfrak{A}=$$\{\rightarrow,$ $\nearrow,$ $\searrow,$ $\uparrow,$ $\downarrow\}$ with the restriction that…

We say a lattice point $X=(x_1,\ldots,x_m)$ is visible from the origin, if $\gcd(x_1,...,x_m)=1$. In other word, there are no other lattice point on the line segment from the origin $O$ to $X$. From J.E. Nymann's result, we know that the…

This paper concerns the number of lattice points in the plane which are visible along certain curves to all elements in some set S of lattice points simultaneously. By proposing the concept of level of visibility, we are able to analyze…

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

We initiate the study of a type $C_n$ generalization of the lattice path matroids defined by Bonin, de Mier, and Noy. These are delta matroids whose feasible sets are in bijection with lattice paths which are symmetric along the main…

The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces `short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope $P$ contained in $[0,k]^n$ and…

For a real $N\ge 1$ and a vector $\xi =(1,\xi_1,...,\xi_n)$ define a matrix $$ {\cal A} (\xi, N) = ({array}{ccccc} N^{-1} & 0& 0& ... &0 \cr N^{\frac{1}{n}} \xi_1 & -N^{\frac{1}{n}} & 0&... & 0 \cr N^{\frac{1}{n}} \xi_2 &0& -N^{\frac{1}{n}}…

Let ${\cal PO}_n$ be the semigroup of all order-preserving partial transformations of a finite chain. It is shown that there exist bijections between the set of certain lattice paths in the Cartesian plane that start at $(0,0)$, end at…

For fixed non-negative integers $k$, $t$, and $n$, with $t < k$, a $k_t$-Dyck path of length $(k+1)n$ is a lattice path that starts at $(0, 0)$, ends at $((k+1)n, 0)$, stays weakly above the line $y = -t$, and consists of steps from the…

This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…

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…

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…

Recall first the algebraic treatment of flows or tensions in a transportation network $N$, i.e. a connected antisymmetric 1-graph $G(X, U)$. Assume that, unusually, we take the values of flows (resp. tensions) in $\mathbb{C}$. So the…