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

In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green's function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that…

A growing self-avoiding walk (GSAW) is a walk on a graph that is directed, does not visit the same vertex twice, and has a trapped endpoint. We show that the generating function enumerating GSAWs on a half-infinite strip of finite height is…

Let $E$ be an elliptic curve over $\mathbb{Q}$. Let $p$ be a prime of good reduction for $E$. Then, for a prime $p \neq \ell$, the Frobenius automorphism associated to $p$ (unique up to conjugation) acts on the $\ell$-adic Tate module of…

We construct $\mathbb{Z}_p$-lattices and $\mathbb{F}_q[\![t]\!]$-lattices from cyclic $(f,\sigma)$-codes over finite chain rings, employing quotients of natural nonassociative orders and principal left ideals in carefully chosen…

Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…

In this thesis we study in detail the self-intersection properties of Random Walks. Although notoriously hard to tackle, these properties are crucially related to the excluded-volume effect and other central features of real polymers. Our…

Let $E_p(x)$ denote the Artin-Hasse exponential and let $\overline{E}_p(x)$ denote its reduction modulo $p$ in $\mathbb{F}_p[[x]]$. In this article we study transcendence properties of $\overline{E}_p(x)$ over $\mathbb{F}_p[x]$. We give two…

The TASEP is a paradigmatic model of out-of-equilibrium statistical physics, for which many quantities have been computed, either exactly or by approximate methods. In this work we study two new kinds of observables that have some relevance…

We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…

This paper reports the results of a search for first occurrences of square-free gaps using an algorithm based on the sieve of Eratosthenes. Using Qgap(L) to denote the starting number of the first gap having exactly the length L, the…

We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…

Let $\{X_{v}:v\in\mathbb{Z}^d\}$ be i.i.d. random variables. Let $S(\pi)=\sum_{v\in\pi}X_v$ be the weight of a self-avoiding lattice path $\pi$. Let \[M_n=\max\{S(\pi):\pi\text{ has length }n\text{ and starts from the origin}\}.\] We are…

In the interchange process on a graph $G=(V,E)$, distinguished particles are placed on the vertices of $G$ with independent Poisson clocks on the edges. When the clock of an edge rings, the two particles on the two sides of the edge…

Self-avoiding walks on the body-centered-cubic (BCC) and face-centered-cubic (FCC) lattices are enumerated up to lengths 28 and 24, respectively, using the length-doubling method. Analysis of the enumeration results yields values for the…

We investigate semi-stiff interacting self-avoiding walks on the square lattice with random impurities. The walks are simulated using the flatPERM algorithm and the inhomogeneity is realised as a random fraction of the lattice that is…

This is the second of two papers on the end-to-end distance of a weakly self-repelling walk on a four dimensional hierarchical lattice. It completes the proof that the expected value grows as a constant times \sqrt{T} log^{1/8}T (1+O((log…

The collapse transition of an isolated polymer has been modelled by many different approaches, including lattice models based on self-avoiding walks and self-avoiding trails. In two dimensions, previous simulations of kinetic growth trails,…

We investigate random walks on a lattice with imperfect traps. In one dimension, we perturbatively compute the survival probability by reducing the problem to a particle diffusing on a closed ring containing just one single trap. Numerical…

We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…

We establish a connection between exclusion statistics with arbitrary integer exclusion parameter $g$ and a class of random walks on planar lattices. This connection maps the generating function for the number of closed walks of given…