We study the scrambling of quantum information in local random unitary circuits by focusing
on the tripartite information proposed by Hosur et al. We provide exact results for the …

In recent decades, two-dimensional random walks in domains with non-smooth boundaries
became increasingly popular and are of interest to several groups in the mathematical …

Let S⊂{− 1, 0, 1} 2\{(0, 0)}. We address the enumeration of plane lattice walks with steps in
S, that start from (0, 0) and remain in the first quadrant {(i, j): i⩾ 0, j⩾ 0}. A priori, there are 28 …

Lattice Path Enumeration Page 1 Chapter 10 Lattice Path Enumeration Christian Krattenthaler
Universität Wien CONTENTS 10.1 Introduction ....................................................... 589 10.2 Lattice …

If you ask a mathematician what they love most about mathematics, certain answers
invariably arise: beauty, abstraction, creativity, logical structure, connection (between …

In the present paper, we introduce a new approach, relying on the Galois theory of
difference equations, to study the nature of the generating series of walks in the quarter …

Counting quadrant walks via Tutte’s invariant method Page 1 FPSAC 2016 Vancouver, Canada
DMTCS proc. BC, 2016, 203–214 Counting quadrant walks via Tutte’s invariant method Olivier …

We study nearest-neighbors walks on the two-dimensional square lattice, that is, models of
walks on Z 2 defined by a fixed step set that is a subset of the non-zero vectors with …

The number of excursions (finite paths starting and ending at the origin) having a given
number of steps and obeying various geometric constraints is a classical topic of …

Models of spatially homogeneous walks in the quarter plane Z2+ with steps taken from a
subset S of the set of jumps to the eight nearest neighbors are considered. The generating …