Related papers: Average Length of Cycles in Rectangular Lattice
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
Bondy and Vince showed that every graph with minimum degree at least three contains two cycles of lengths differing by one or two.We prove the following average degree counterpart that every $n$-vertex graph $G$ with at least $\frac52(n-1)$…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
We consider a periodic lattice structure in $d=2$ or $3$ dimensions with unit cell comprising $Z$ thin elastic members emanating from a similarly situated central node. A general theoretical approach provides an algebraic formula for the…
Let $L_{c,n}$ denote the size of the longest cycle in $G(n,{c}/{n})$, $c>1$ constant. We show that there exists a continuous function $f(c)$ such that $ L_{c,n}/n \to f(c)$ a.s. for $c\geq 20$, thus extending a result of the author and…
We study a class of statistical systems which simulate 3D gonihedric system on euclidean lattice. We have found the exact partition function of the 3D-model and the corresponding critical indices analysing the transfer matrix…
If the number of runs in a (mixed-level) orthogonal array of strength 2 is specified, what numbers of levels and factors are possible? The collection of possible sets of parameters for orthogonal arrays with N runs has a natural lattice…
A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It has been difficult to count the number of Hamiltonian cycles on regular lattices with periodic boundary conditions, e.g. lattices on a torus,…
A general elliptic $N\times N$ matrix Lax scheme is presented, leading to two classes of elliptic lattice systems, one which we interpret as the higher-rank analogue of the Landau-Lifschitz equations, while the other class we characterize…
Let S be a finite subset of Z^2. A walk on the slit plane with steps in S is a sequence (0,0)=w_0, w_1, ..., w_n of points of Z^2 such that w_{i+1}-w_i belongs to S for all i, and none of the points w_i, i>0, lie on the half-line H= {(k,0):…
This paper is dedicated to the factorizations of the symmetric group. Introducing a new bijection for partitioned 3-cacti, we derive an el- egant formula for the number of factorizations of a long cycle into a product of three permutations.…
In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…
A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an…
We show that coarse graining arguments invented for the analysis of multi-spin systems on a randomly triangulated surface apply also to the O(n) model on a random lattice. These arguments imply that if the model has a critical point with…
We present a method for calculating the complex Green function $G_{ij} (\omega)$ at any real frequency $\omega$ between any two sites $i$ and $j$ on a lattice. Starting from numbers of walks on square, cubic, honeycomb, triangular, bcc,…
We recall the main types of lattice paths, which are sequences in the lattice of integer coordinates points in the plane. We start with the fundamental central lattice paths and Dyck paths and proceed in elementary terms through recently…
Lorentz lattice gases (LLGs) are discrete-time transport models in which a point particle moves ballistically between lattice sites and is scattered by randomly placed, quenched local scatterers such as ``rotators'' or ``mirrors.'' Despite…
We study the hexagonal lattice $\mathbb{Z}[\omega]$, where $\omega^6=1$. More specifically, we study the angular distribution of hexagonal lattice points on circles with a fixed radius. We prove that the angles are equidistributed on…
Lattice QCD calculation of s-wave hadron scattering lengths in the channels \pi-\pi, \pi-N, K-N, {\bar K}-N and N-N is carried out in the quenched QCD at $\beta=6/g^2=5.7$. A variant of the method of wall sourceis developed for this…