Related papers: Average Length of Cycles in Rectangular Lattice

Phase transitions in zero-temperature 3D Z(N) lattice gauge theories are studied. We use a cluster algorithm defined for the dual formulation of the models. We also attempt to explain the nature of the intermediate continuously symmetric…

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…

A connected set in a graph is a non-empty set of vertices that induces a connected subgraph. In an infinite lattice, a connected set is often referred to as a lattice animal, whose enumeration up to isomorphism is a classical problem in…

The operation of replacing every vertex of an $r$-regular lattice $H$ by a complete graph of order $r$ is called clique-inserting, and the resulting lattice is called the clique-inserted-lattice of $H$. For any given $r$-regular lattice,…

We apply the averaging theory of high order for computing the limit cycles of discontinuous piecewise quadratic and cubic polynomial perturbations of a linear center. These discontinuous piecewise differential systems are formed by two…

A lattice path inside the $m\times n$ table $T$ is a sequence $\nu_1,\ldots,\nu_k$ of cells such that $\nu_{j+1}-\nu_j\in\{(1,-1),(1,0),(1,1)\}$ for all $j=1,\ldots,k-1$. The number of lattice paths in $T$ from the first column to the…

We give analogues in the finite general linear group of two elementary results concerning long cycles and transpositions in the symmetric group: first, that the long cycles are precisely the elements whose minimum-length factorizations into…

We prove that the cycle space of every planar finitely separable 3-connected graph $G$ is generated by some ${\rm Aut}(G)$-invariant nested set of cycles. We also discuss the situation in the case of smaller connectivity.

A method for successive synthesis of the Weyl matrix on the square lattice is proposed. It allows one to compute the Weyl matrix of a large graph by adding new edges and solving elementary systems of linear algebraic equations at each step.…

We study a cyclic Lotka-Volterra model of N interacting species populating a d-dimensional lattice. In the realm of a Kirkwood approximation, a critical number of species N_c(d) above which the system fixates is determined analytically. We…

Zigzags in graphs embedded in surfaces are cyclic sequences of edges whose any two consecutive edges are different, have a common vertex and belong to the same face. We investigate zigzags in randomly constructed combinatorial tetrahedral…

We consider the long-run growth rate of the average value of a random multiplicative process $x_{i+1} = a_i x_i$ where the multipliers $a_i=1+\rho\exp(\sigma W_i - \frac12 \sigma^2 t_i)$ have Markovian dependence given by the exponential of…

For lattice paths in strips which begin at $(0,0)$ and have only up steps $U: (i,j) \rightarrow (i+1,j+1)$ and down steps $D: (i,j)\rightarrow (i+1,j-1)$, let $A_{n,k}$ denote the set of paths of length $n$ which start at $(0,0)$, end on…

We prove that the set of long cycles has the edge-Erd\H{o}s-P\'osa property: for every fixed integer $\ell\ge 3$ and every $k\in\mathbb{N}$, every graph $G$ either contains $k$ edge-disjoint cycles of length at least $\ell$ (long cycles) or…

Let $f(x) \in \mathbb{Z}[x]$; for each integer $\alpha$ it is interesting to consider the number of iterates $n_{\alpha}$, if possible, needed to satisfy $f^{n_{\alpha}}(\alpha) = \alpha$. The sets $\{\alpha, f(\alpha), \ldots,…

We consider planar lattice walks that start from (0,0), remain inthe first quadrant i, j >= 0, and are made of three types of steps: North-East, West and South. These walks are known to have remarkable enumerative and probabilistic…

Utilizing the approach recently proposed for the $\ell N$ inclusive scattering cross section on the lattice, we compute the differential scattering cross section for the charged current process $\ell p \rightarrow \nu n $ for various…

We make a first study of the phase diagram of four-dimensional N=4 super Yang-Mills theory regulated on a space-time lattice. The lattice formulation we employ is both gauge invariant and retains at all lattice spacings one exactly…

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,…

Let $Q_n$ denote the graph of the $n$-dimensional cube with vertex set $\{0,1\}^n$ in which two vertices are adjacent if they differ in exactly one coordinate. Suppose $G$ is a subgraph of $Q_n$ with average degree at least $d$. How long a…