English
Related papers

Related papers: Average Length of Cycles in Rectangular Lattice

200 papers

We study the problem of determining the probability that m vectors selected uniformly at random from the intersection of the full-rank lattice L in R^n and the window [0,B)^n generate $\Lambda$ when B is chosen to be appropriately large.…

Combinatorics · Mathematics 2013-12-20 Felix Fontein , Pawel Wocjan

The evaluation of the average number S_N(t) of distinct sites visited up to time t by N independent random walkers all starting from the same origin on an Euclidean lattice is addressed. We find that, for the nontrivial time regime and for…

Statistical Mechanics · Physics 2009-10-31 S. B. Yuste , L. Acedo

In this paper, following the paper ``On the average hitting times of the squares of cycles,'' we provide an explicit formula for the average hitting times of a simple random walk on a directed graph with $N$ vertices, where the graph…

Combinatorics · Mathematics 2026-01-27 Shunya Tamura

In the past decade, a lot of attention has been devoted to the enumera-tion of walks with prescribed steps confined to a convex cone. In two dimensions, this means counting walks in the first quadrant of the plane (possibly after a linear…

Combinatorics · Mathematics 2025-04-11 Mireille Bousquet-Mélou

In the first part of this paper I give an elementary overview about some number sequences which count various sorts of lattice paths in strips along the x-axis and compute their generating functions in terms of Fibonacci and Lucas…

Combinatorics · Mathematics 2016-06-24 Johann Cigler

In this paper, we develop a method for studying cycle lengths in hypergraphs. Our method is built on earlier ones used in [21,22,18]. However, instead of utilizing the well-known lemma of Bondy and Simonovits [4] that most existing methods…

Combinatorics · Mathematics 2016-09-28 Tao Jiang , Jie Ma

We study the splitting of regular square lattices subject to stochastic intermittent flows. Various flow patterns are produced by different groupings of the nodes, based on their random alternation between two possible states. The resulting…

Physics and Society · Physics 2013-05-29 Markus Schläpfer , Konstantinos Trantopoulos

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…

Combinatorics · Mathematics 2016-08-03 Michael Haythorpe

We study numerically three-dimensional Z(N) lattice gauge theories at finite temperature, for N = 5, 6, 8, 12, 13 and 20 on lattices with temporal extension $N_t$ = 2, 4, 8. For each model, we locate phase transition points and determine…

High Energy Physics - Lattice · Physics 2015-06-22 Oleg Borisenko , Volodymyr Chelnokov , Mario Gravina , Alessandro Papa

The main objective of this thesis is a classification project for integral lattices. Using Kneser's neighbour method we have developed the computer program tn to classify complete genera of integral lattices. Main results are detailed…

Metric Geometry · Mathematics 2007-05-23 Boris Hemkemeier

The subject of this paper is the cycle structure of the random permutation $\sigma$ of $[N]$, which is the product of $k$ independent random cycles of maximal length $N$. We use the character-based Fourier transform to study the number of…

Combinatorics · Mathematics 2016-10-13 Miklos Bona , Boris Pittel

We consider random lattice triangulations of $n\times k$ rectangular regions with weight $\lambda^{|\sigma|}$ where $\lambda>0$ is a parameter and $|\sigma|$ denotes the total edge length of the triangulation. When $\lambda\in(0,1)$ and $k$…

Probability · Mathematics 2015-05-25 Pietro Caputo , Fabio Martinelli , Alistair Sinclair , Alexandre Stauffer

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

Information Theory · Computer Science 2015-09-18 Hojjat Mostafanasab

We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z^2, and always stay in the quadrant x >= 0, y >= 0. We first give a criterion which guarantees that the length generating…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Melou , Marko Petkovsek

The $I=\frac{3}{2}$ $\pi K$ $s$-wave scattering phase shift is computed by lattice quantum chromodynamics with $N_f=3$ flavors of Asqtad-improved staggered fermions. The energy-eigenvalues of $\pi K$ systems at one center of mass frame and…

High Energy Physics - Lattice · Physics 2026-02-06 Ziwen Fu , Qu-Zhi Li , Jun Wang

The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…

Combinatorics · Mathematics 2017-03-21 Rika Yatchak

The main aim of this paper is to study aggregation functions on lattices via clone theory approach. Observing that the aggregation functions on lattices just correspond to $0,1$-monotone clones, as the main result we show that for any…

Rings and Algebras · Mathematics 2018-12-27 Radomír Halaš , Jozef Pócs

In this note we study the error term R_{n,L}(x) in the generalized circle problem for a ball of volume x and a random lattice L of large dimension n. Our main result is the following functional central limit theorem: Fix an arbitrary…

Number Theory · Mathematics 2016-11-22 Andreas Strömbergsson , Anders Södergren

We determine the three-loop coefficient of the beta function in the asymmetric momentum subtraction scheme in Landau gauge. This scheme is convenient for lattice studies of \alpha_s, the running coupling constant of QCD. We present high…

High Energy Physics - Phenomenology · Physics 2010-03-19 Ph. Boucaud , J. P. Leroy , J. Micheli , O. Pene , C. Roiesnel

We propose a method to determine the isoscalar \bar K N scattering length on the lattice. Our method represents the generalization of L\"uscher's approach in the presence of inelastic channels (complex scattering length). In addition, the…

High Energy Physics - Lattice · Physics 2015-05-13 Michael Lage , Ulf-G. Meißner , Akaki Rusetsky