Related papers: Gitterwege reeller Zahlen

We introduce a method for describing Riordan matrices via recurrence relations along their diagonals. This provides a new structural description that complements the classical row-wise and column-wise constructions via the A-sequence. As an…

We consider the rational flow $\xi_R(z)= R(z) (d/dz)$ where $R$ is given by the quotient of two polynomials without common factors on the Riemann sphere. The separatrix graph $\Gamma_R$ is the boundary between trajectories with different…

An isometric path between two vertices in a graph $G$ is a shortest path joining them. The isometric path number of $G$, denoted by $\ip(G)$, is the minimum number of isometric paths needed to cover all vertices of $G$. In this paper, we…

We consider posets of lattice paths (endowed with a natural order) and begin the study of such structures. We give an algebraic condition to recognize which ones of these posets are lattices. Next we study the class of Dyck lattices (i.e.,…

The path integral on a homogeneous space $ G/H $ is constructed, based on the guiding principle `first lift to $ G $ and then project to $ G/H $'. It is then shown that this principle admits inequivalent quantizations inducing a gauge field…

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…

The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…

In this paper, we study symmetric lattice paths. Let $d_{n}$, $m_{n}$, and $s_{n}$ denote the number of symmetric Dyck paths, symmetric Motzkin paths, and symmetric Schr\"oder paths of length $2n$, respectively. By using Riordan group…

Hamiltonian lattice gauge models based on the assignment of the Heisenberg double of a Lie group to each link of the lattice are constructed in arbitrary space-time dimensions. It is shown that the corresponding generalization of the…

Gessel walks are lattice paths confined to the quarter plane that start at the origin and consist of unit steps going either West, East, South-West or North-East. In 2001, Ira Gessel conjectured a nice closed-form expression for the number…

Let $L$ be a lattice of full rank in $n$-dimensional real space. A vector in $L$ is called $i$-sparse if it has no more than $i$ nonzero coordinates. We define the $i$-th successive sparsity level of $L$, $s_i(L)$, to be the minimal $s$ so…

Let k be an algebraically closed field of characteristic two. Let R be the ring of Witt vectors of length two over k. We construct a group stack \hat G over k, the metaplectic extension of the Greenberg realization of Sp_{2n}(R). We also…

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 $P(G)=(P_{0}(G),P_{1}(G),\cdots, P_{\rho}(G))$ be the path sequence of a graph $G$, where $P_{i}(G)$ is the number of paths with length $i$ and $\rho$ is the length of a longest path in $G$. In this paper, we first give the path…

Let $p$ be a prime number and $\left(\frac{\cdot}{p}\right)$ be the Legendre symbol modulo $p$. The \emph{Legendre path} attached to $p$ is the polygonal path whose vertices are the normalized character sums $\frac{1}{\sqrt{p}} \sum_{n\leq…

Probabilistic frames are a generalization of finite frames into the Wasserstein space of probability measures with finite second moment. We introduce new probabilistic definitions of duality, analysis, and synthesis and investigate their…

We define a new product on orbits of pairs of flags in a vector space, using open orbits in certain varieties of pairs of flags. This new product defines an associative $\mathbb{Z}$-algebra, denoted by $G(n,r)$. We show that $G(n,r)$ is a…

An old result of M\"uller and R\"odl states that a countable graph $G$ has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of $G$ by positive integers, an infinite increasing path can be found. They…

We present some properties of the Weierstrass $\wp$-function associated to the hexagonal (or triangular) lattice. In particular, with the help of an old theorem of I.N. Baker \cite{B} on the characterization of meromorphic solutions of the…

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…