Related papers: Counting walks with large steps in an orthant

Given a finitely generated residually finite group $G$, the residual finiteness growth $\text{RF}_G: \mathbb{N} \to \mathbb{N}$ bounds the size of a finite group $Q$ needed to detect an element of norm at most $r$. More specifically, if…

We determine whether each known generating set of arbitrary oriented Reidemeister moves is minimal. We then provide a complete classification of minimal generating sets that include a coherent Reidemeister move of type II. We also classify…

In recent years, computer simulations are playing a fundamental role in unveiling some of the most intriguing features of prime numbers. In this work, we define an algorithm for a deterministic walk through a two-dimensional grid that we…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

There is a natural action of the braid group on the symmetric matrices with units on the diagonal, appearing in various fields as Singularity Theory, Frobenius Manifolds or Isomonodromic deformations of certain classes of linear…

Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a 2D optical quantum walk on a…

We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…

We continue the investigation, that began in [3] and [4], into finite groups whose set of nontrivial conjugacy class sizes form an arithmetic progression. Let $G$ be a finite group and denote the set of conjugacy class sizes of $G$ by ${\rm…

We consider two dimensional random walks conditioned to stay in the positive quadrant. Assuming that the increments of the walk have finite second moments and that the drift vector is co-oriented with one of two axes, we construct positive…

Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of {\em…

We have produced extended series for two-dimensional prudent polygons, based on a transfer matrix algorithm of complexity O$(n^5),$ for a series of length $n.$ We have extended the definition to three dimensions and produced series…

In this work, we present a simple and efficient generator of polymeric linear chains, based on a random self-avoiding walk process. The chains are generated using a discrete process of growth, in cubic networks and in a finite time, without…

Gessel's walks are the planar walks that move within the positive quadrant $\mathbb{Z}_{+}^{2}$ by unit steps in any of the following directions: West, North-East, East and South-West. In this paper, we find an explicit expression for the…

This article provides tools for the study of the Dirichlet random walk in $\mathbb{R}^d$. By this we mean the random variable $W=X_1\Theta_1+\cdots+X_n\Theta_n$ where $X=(X_1,\ldots,X_n) \sim \mathcal{D}(q_1,\ldots,q_n)$ is Dirichlet…

A quantum walk describes the discrete unitary evolution of a quantum particle on a discrete graph. Some quantum walks, referred to as the Weyl and Dirac quantum walks, provide a description of the free evolution of relativistic quantum…

Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…

We study $6$-transposition groups, i.e. groups generated by a normal set of involutions $D$, such that the order of the product of any two elements from $D$ does not exceed $6$. We classify most of the groups generated by $3$ elements from…

The treatment of two-dimensional random walks in the quarter plane leads to Markov processes which involve semi-infinite matrices having Toeplitz or block Toeplitz structure plus a low-rank correction. Finding the steady state probability…

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…

Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and…