Related papers: Nonintersecting lattice paths on the cylinder
We deduce Narayana's formula for the number of lattice paths that fit in a Young diagram as a direct consequence of the Gessel-Viennot theorem on non-intersecting lattice paths.
The vicious random walker problem on a one dimensional lattice is considered. Many walkers take simultaneous steps on the lattice and the configurations in which two of them arrive at the same site are prohibited. It is known that the…
We establish a reflection principle for three lattice walkers and use this principle to reduce the enumeration of the configurations of three vicious walkers to that of configurations of two vicious walkers. In the combinatorial treatment…
The system of one-dimensional symmetric simple random walks, in which none of walkers have met others in a given time period, is called the vicious walker model. It was introduced by Michael Fisher and applications of the model to various…
We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…
Lock step walker model is a one-dimensional integer lattice walker model in discrete time. Suppose that initially there are infinitely many walkers on the non-negative even integer sites. At each tick of time, each walker moves either to…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
In this paper, we show how general determinants may be viewed as generating functions of nonintersecting lattice paths, using the Lindstr\"om-Gessel-Viennot interpretation of semistandard Young tableaux and the Jacobi-Trudi identity…
We study lattice walks in a Weyl chamber of type A with fixed or free end points. For lattice walk models with zero drift that may be counted by means of a reflection argument, we determine asymptotics for the number of such walks as their…
After recalling the definition of Grassmann algebra and elements of Grassmann--Berezin calculus, we use the expression of Pfaffians as Grassmann integrals to generalize a series of formulas relating generating functions of paths in digraphs…
In this thesis we develop generalized versions of the Chung-Feller theorem for lattice paths constrained in the half plane. The beautiful cycle method which was developed by Devoretzky and Motzkin as a means to prove the ballot problem is…
A vicious walker system consists of N random walkers on a line with any two walkers annihilating each other upon meeting. We study a system of N vicious accelerating walkers with the velocity undergoing Gaussian fluctuations, as opposed to…
We provide numerical evidence that the nonlinear searching algorithm introduced by Wong and Meyer \cite{meyer2013nonlinear}, rephrased in terms of quantum walks with effective nonlinear phase, can be extended to the finite 2-dimensional…
We derive an exact solution for the total kinetic energy of noninteracting spinless electrons at half-filling in two-dimensional bipartite lattices. We employ a conceptually novel approach that maps this problem exactly into a…
We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove…
We state and prove several theorems that demonstrate how the coordinate Bethe Ansatz for the eigenvectors of suitable transfer matrices of a generalised inhomogeneous five-vertex model on the square lattice, given certain conditions hold,…
Previous studies of kinetic transport in the Lorentz gas have been limited to cases where the scatterers are distributed at random (e.g. at the points of a spatial Poisson process) or at the vertices of a Euclidean lattice. In the present…
Numerical simulations using the Lattice Boltzmann Method are presented of the following two-dimensional incompressible flow problem. Starting from configurations corresponding to translating inviscid equilibria, namely, the translating…
We consider three directed walkers on the square lattice, which move simultaneously at each tick of a clock and never cross. Their trajectories form a non-crossing configuration of walks. This configuration is said to be osculating if the…
We consider N vicious walkers moving in one dimension in a one-body potential v(x). Using the backward Fokker-Planck equation we derive exact results for the asymptotic form of the survival probability Q(x,t) of vicious walkers initially…