Related papers: A Reflection Principle for Three Vicious Walkers
The problems of enumerating lattice walks, with an arbitrary finite set of allowed steps, both in one and two dimensions, where one must always stay in the non-negative half-line and quarter-plane respectively, are used, as case studies, to…
In this work we extend the results of the reunion probability of $N$ one-dimensional random walkers to include mixed boundary conditions between their trajectories. The level of the mixture is controlled by a parameter $c$, which can be…
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
We find and analyse the exact solution of a model of three different polymers with asymmetric contact interactions in two dimensions, modelling a scenario where there are different types of polymers involved. In particular, we find the…
I compute the difference of vector and axial vector current correlators in the weak coupling phase of (lattice-regulated) SU(3) gauge theory with two flavors of symmetric-representation dynamical fermions. This is a walking theory at the…
It has been observed that quantum walks on regular lattices can give rise to wave equations for relativistic particles in the continuum limit. In this paper we define the 3D walk as a product of three coined one-dimensional walks. The…
It is showed that the very recently introduced Lagrangian $loop$ formulation of the lattice Maxwell theory is equivalent to the Villain form in 2+1 dimensions. A transparent description of the classical $loop$ action is given in pure…
For some m \ge 4, let us color each column of the integer lattice L = Z^2 independently and uniformly into one of m colors. We do the same for the rows, independently from the columns. A point of L will be called blocked if its row and…
A pair of random walks $(R,S)$ on the vertices of a graph $G$ is {\it successful} if two tokens can be scheduled (moving only one token at a time) to travel along $R$ and $S$ without colliding. We consider questions related to P. Winkler's…
We consider the $1$-dimensional reflected Brownian motion and $3$-dimensional Bessel process and the general models. By decomposing the hitting times of consecutive sites into loops, we obtain identities, called loop identities, for the…
We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…
Generating functions for asymmetric step-size paths restricted by two absorbing barriers are derived. The method begins by applying the Lagrange inversion formula to arbitrary powers of roots of the characteristic equation, that being a…
We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
We give a simplified proof for the equivalence of loop-erased random walks to a lattice model containing two complex fermions, and one complex boson. This equivalence works on an arbitrary directed graph. Specifying to the $d$-dimensional…
A particle entering a scattering and absorbing medium executes a random walk through a sequence of scattering events. The particle ultimately achieves first-passage, leaving the medium or it is absorbed. The Kubelka-Munk model describes a…
We consider walks on a triangular domain that is a subset of the triangular lattice. We then specialise this by dividing the lattice into two directed sublattices with different weights. Our central result is an explicit formula for the…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
We give precise asymptotics to the number of first time returning random walks in the standard orthogonal lattice in $\mathbb{R}$ and we prove that these numbers do not form a $P$-recursive sequence. In the process, the known asymptotics of…
We address the problem of counting walks by winding angle on the Kreweras lattice, an oriented version of the triangular lattice. Our method uses a new decomposition of the lattice, which allows us to write functional equations…