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

We use the recently conjectured exact $S$-matrix of the massive ${\rm O}(n)$ model to derive its form factors and ground state energy. This information is then used in the limit $n\to0$ to obtain quantitative results for various universal…

We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…

We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in $\mathbb{R}^3$ and prove that our method is ergodic on the space of thick walks. The data…

Let $p$ be an odd prime number and $\zeta_{p} := \exp(2\pi i/p)$. Then, it is well-known that the $A_{p-1}$-root lattice can be realized as the (Hermitian) trace form of the $p$-th cyclotomic extension $\mathbb{Q}(\zeta_{p})/\mathbb{Q}$…

This paper came to existence out of the desire to understand iterations of strictly triangular polynomial maps over finite fields. This resulted in two connected results: First, we give a generalization of $\F_p$-actions on $\F_p^n$ and…

In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…

We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is used to study polymer growth near a $D$-dimensional attractive hyperspherical boundary. The…

Let $\Lambda$ be a basic finite dimensional algebra over an algebraically closed field, with the property that the square of the Jacobson radical $J$ vanishes. We determine the irreducible components of the module variety $\text{Mod}_{\bf…

We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent gamma =…

We study rooted self avoiding polygons and self avoiding walks on deterministic fractal lattices of finite ramification index. Different sites on such lattices are not equivalent, and the number of rooted open walks W_n(S), and rooted…

Self-avoiding walk (SAW) represents linear polymer chain on a large scale, neglecting its chemical details and emphasizing the role of its conformational statistics. The role of the latter is important in formation of agglomerates and…

Explicit algebraic area enumeration formulae are derived for various lattice walks generalizing the canonical square lattice walk, and in particular for the triangular lattice chiral walk recently introduced by the authors. A key element in…

This paper initiates the explicit study of face numbers of matroid polytopes and their computation. We prove that, for the large class of split matroid polytopes, their face numbers depend solely on the number of cyclic flats of each rank…

If $\mathcal{P}$ is a lattice polytope (i.e., $\mathcal{P}$ is the convex hull of finitely many integer points in $\mathbb{R}^d$), Ehrhart's famous theorem (1962) asserts that the integer-point counting function $|t \mathcal{P} \cap…

The diagonal of a multivariate power series F is the univariate power series Diag(F) generated by the diagonal terms of F. Diagonals form an important class of power series; they occur frequently in number theory, theoretical physics and…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

This chapter deals with the exact enumeration of certain classes of self-avoiding polygons and polyominoes on the square lattice. We present three general approaches that apply to many classes of polyominoes. The common principle to all of…