Related papers: Counting walks by their last erased self-avoiding …

We study the asymptotic behavior of ``true" self-avoiding random walks on general infinite locally finite trees. In this model, the walk starts at the root and, at each step, from its current vertex chooses a neighboring edge to traverse…

We prove that loop-erased random walks on finite pre-Sierpinski gaskets can be extended to the infinite pre-Sierpinski gasket by virtue of the `erasing-larger-loops-first' method, and obtain the asymptotic behavior of the walk as the number…

Let $s\colon X\rightarrow \operatorname{Spec} \mathbb{F}$ be a separated scheme of finite type over a finite field $\mathbb{F}$ of characteristic $p$, let $\Lambda$ be a not necessarily commutative $\mathbb{Z}_p$-algebra with finitely many…

We present improved simulations of three-dimensional self avoiding walks with one end attached to an impenetrable surface on the simple cubic lattice. This surface can either be a-thermal, having thus only an entropic effect, or attractive.…

We study self-avoiding walks on the four-dimensional hypercubic lattice via Monte Carlo simulations of walks with up to one billion steps. We study the expected logarithmic corrections to scaling, and find convincing evidence in support the…

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…

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…

Let $p$ be a prime. In 2017, Kemarsky, Paulin, and Shapira (KPS) conjectured that any Laurent series over $\mathbb{F}_p$ exhibits full escape of mass with respect to any irreducible polynomial $P(t)\in\mathbb{F}_p[t]$. In 2025, this was…

Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex is adjacent to the…

Fix $p>1$, not necessarily integer, with $p(d-2)<d$. We study the $p$-fold self-intersection local time of a simple random walk on the lattice $\Z^d$ up to time $t$. This is the $p$-norm of the vector of the walker's local times, $\ell_t$.…

This paper presents a topological framework for investigating the Birch and Swinnerton Dyer conjecture through four dimensional embeddings of elliptic curves. We propose a correspondence between the algebraic rank of an elliptic curve and…

We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that corresponds to the probability that pairs of…

Recently James Martin introduced multiline queues, and used them to give a combinatorial formula for the stationary distribution of the multispecies asymmetric simple exclusion exclusion process (ASEP) on a circle. The ASEP is a model of…

We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at the…

We propose a new model for counting $\mathbf{GL}_2(\mathbb{F}_p)$-number fields having the same local properties as the splitting field of the mod $p$-Galois representation associated with an elliptic curve over the rational numbers. We…

Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…

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…

We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…

Let $f$ be a map with bounded set of singular values for which periodic dynamic rays exist and land. We prove that each non-repelling cycle is associated to a singular orbit which cannot accumulate on any other non-repelling cycle. When $f$…