skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Algebraic area enumeration for open lattice walks
Abstract We calculate the number of open walks of fixed length and algebraic area on a square planar lattice by an extension of the operator method used for the enumeration of closed walks. The open walk area is defined by closing the walks with a straight line across their endpoints and can assume half-integer values in lattice cell units. We also derive the length and area counting of walks with endpoints on specific straight lines and outline an approach for dealing with walks with fully fixed endpoints.  more » « less
Award ID(s):
2112729
PAR ID:
10418372
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of Physics A: Mathematical and Theoretical
Volume:
55
Issue:
48
ISSN:
1751-8113
Page Range / eLocation ID:
485005
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Biopolymers, like chromatin, are often confined in small volumes. Confinement has a great effect on polymer conformations, including polymer entanglement. Polymer chains and other filamentous structures can be represented by polygonal curves in three-space. In this manuscript, we examine the topological complexity of polygonal chains in three-space and in confinement as a function of their length. We model polygonal chains by equilateral random walks in three-space and by uniform random walks (URWs) in confinement. For the topological characterization, we use the second Vassiliev measure. This is an integer topological invariant for polygons and a continuous functions over the real numbers, as a function of the chain coordinates for open polygonal chains. For URWs in confined space, we prove that the average value of the Vassiliev measure in the space of configurations increases as O ( n 2 ) with the length of the walks or polygons. We verify this result numerically and our numerical results also show that the mean value of the second Vassiliev measure of equilateral random walks in three-space increases as O ( n ). These results reveal the rate at which knotting of open curves and not simply entanglement are affected by confinement. 
    more » « less
  2. We give a summary of recent progress on the signed area enumeration of 9 closed walks on planar lattices. Several connections are made with quantum mechanics 10 and statistical mechanics. Explicit combinatorial formulae are proposed which rely on 11 sums labelled by the multicompositions of the length of the walks. 
    more » « less
  3. We give a summary of recent progress on the signed area enumeration of 9 closed walks on planar lattices. Several connections are made with quantum mechanics 10 and statistical mechanics. Explicit combinatorial formulae are proposed which rely on 11 sums labelled by the multicompositions of the length of the walks. 
    more » « less
  4. We give a summary of recent progress on the signed area enumeration of 9 closed walks on planar lattices. Several connections are made with quantum mechanics 10 and statistical mechanics. Explicit combinatorial formulae are proposed which rely on 11 sums labelled by the multicompositions of the length of the walks. 
    more » « less
  5. Linear least squares (LLS) is perhaps the most common method of data analysis, dating back to Legendre, Gauss and Laplace. Framed as linear regression, LLS is also a backbone of mathematical statistics. Here we report on an unexpected new connection between LLS and random walks. To that end, we introduce the notion of a random walk based on a discrete sequence of data samples (data walk). We show that the slope of a straight line which annuls the net area under a residual data walk equals the one found by LLS. For equidistant data samples this result is exact and holds for an arbitrary distribution of steps. 
    more » « less