Related papers: A Reflection Principle for Three Vicious Walkers
We define a lattice model for rock, absorbers, and gas that makes it possible to examine the flow of gas to a complicated absorbing boundary over long periods of time. The motivation is to deduce the geometry of the boundary from the time…
We study the motion of a particle on the two-dimensional honeycomb lattice, whose sites are occupied by either flipping rotators or flipping mirrors, which scatter the particle according to a deterministic rule. For both types of scatterers…
In this paper we develop the idea of Lyons and gives a simple criterion for the recurrence and the transience. We also show that a wedge has the infinite collision property if and only if it is a recurrent graph.
We study restricted multiple three wave interaction system by the inverse scattering method. We develop the algebraic approach in terms of classical $r$-matrix and give an interpretation of the Poisson brackets as linear $r$-matrix algebra.…
We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…
A Lindley process arises from classical studies in queueing theory and it usually reflects waiting times of customers in single server models. In this note we study recurrence of its higher dimensional counterpart under some mild…
The evolution of domain structure is investigated in a two-dimensional voter model with three states under cyclic dominance. The study focus on the dynamics of vortices, defined by the points where three states (domains) meet. We can…
A lattice walk model is said to be reluctant if the defining step set has a strong drift towards the boundaries. We describe efficient random generation strategies for these walks.
Competition among cooperators, defectors, and loners is studied in an evolutionary prisoner's dilemma game with optional participation. Loners are risk averse i.e. unwilling to participate and rather rely on small but fixed earnings. This…
We solve two problems regarding the enumeration of lattice paths in $\mathbb{Z}^2$ with steps $(1,1)$ and $(1,-1)$ with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.…
We investigate the spectrum and IR properties of the SU(3) "sextet" model with two Dirac fermions in the two-index symmetric representation via lattice simulations. This model is a prime candidate for a realization of Walking Technicolor,…
We present a model for a random walk with memory, phenomenologically inspired in a biological system. The walker has the capacity to remember the time of the last visit to each site and the step taken from there. This memory affects the…
A new class of walking droplets, coined superwalkers, has been observed when a bath of silicone oil is vibrated simultaneously at a given frequency and its subharmonic tone with a relative phase difference between them~[1]. In this paper,…
In this article we are interested in finding positive discrete harmonic functions with Dirichlet conditions in three quadrants. Whereas planar lattice (random) walks in the quadrant have been well studied, the case of walks avoiding a…
We address the enumeration of walks with small steps confined to a two-dimensional cone, for example the quarter plane, three-quarter plane or the slit plane. In the quarter plane case, the solutions for unweighted step-sets are already…
The purpose of the present work is to provide short and supple teaching notes for a $30$ hours introductory course on elementary \textit{Enumerative Algebraic Combinatorics}. We fully adopt the \textit{Rota way}. The themes are organized…
We consider a network model, embedded on the Manhattan lattice, of a quantum localisation problem belonging to symmetry class C. This arises in the context of quasiparticle dynamics in disordered spin-singlet superconductors which are…
This paper considers the enumeration of ternary trees (i.e. rooted ordered trees in which each vertex has 0 or 3 children) avoiding a contiguous ternary tree pattern. We begin by finding recurrence relations for several simple tree…
We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.…
Relations between the mean values of distributions of flipped spins on periodic Heisenberg XX chain and some aspects of enumerative combinatorics are discussed. The Bethe vectors, which are the state-vectors of the model, are considered…