Lattice multi-polygons

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a unimodular sequence in $\mathbb{Z}^2$. This formula implies the generalized twelve-point theorem in [12]. We then introduce the notion of lattice multi-polygons which is a generalization of lattice polygons, state the generalized Pick's formula and discuss the classification of Ehrhart polynomials of lattice multi-polygons and also of several natural subfamilies of lattice multi-polygons.Comment: 21 pages, 7 figures, Kyoto J. Math. to appea

Reflexive polytopes of higher index and the number 12

We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another application, we show that any reflexive polygon of arbitrary index satisfies the famous "number 12" property. This is a new, infinite class of lattice polygons possessing this property, and extends the previously known sixteen instances. The number 12 property also holds more generally for l-reflexive non-convex or self-intersecting polygonal loops. We conclude by discussing higher-dimensional examples and open questions

Reflexive polytopes of higher index and the number 12

We introduce reflexive polytopes of index l as a natural generalisation of the notion of a reflexive polytope of index 1. These l-reflexive polytopes also appear as dual pairs. In dimension two we show that they arise from reflexive polygons via a change of the underlying lattice. This allows us to efficiently classify all isomorphism classes of l-reflexive polygons up to index 200. As another application, we show that any reflexive polygon of arbitrary index satisfies the famous "number 12" property. This is a new, infinite class of lattice polygons possessing this property, and extends the previously known sixteen instances. The number 12 property also holds more generally for l-reflexive non-convex or self-intersecting polygonal loops. We conclude by discussing higher-dimensional examples and open questions.Comment: Dedicated to the memory of Maximilian Kreuzer. 23 pages, 4 figures, 4 tables, an appendix containing Magma source cod

Minimal knotted polygons in cubic lattices

An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the lattices. Data are collected and analysed on minimal length knotted polygons, their entropy, and their lattice curvature and writhe

Knotting probabilities after a local strand passage in unknotted self-avoiding polygons

We investigate the knotting probability after a local strand passage is performed in an unknotted self-avoiding polygon on the simple cubic lattice. We assume that two polygon segments have already been brought close together for the purpose of performing a strand passage, and model this using Theta-SAPs, polygons that contain the pattern Theta at a fixed location. It is proved that the number of n-edge Theta-SAPs grows exponentially (with n) at the same rate as the total number of n-edge unknotted self-avoiding polygons, and that the same holds for subsets of n-edge Theta-SAPs that yield a specific after-strand-passage knot-type. Thus the probability of a given after-strand-passage knot-type does not grow (or decay) exponentially with n, and we conjecture that instead it approaches a knot-type dependent amplitude ratio lying strictly between 0 and 1. This is supported by critical exponent estimates obtained from a new maximum likelihood method for Theta-SAPs that are generated by a composite (aka multiple) Markov Chain Monte Carlo BFACF algorithm. We also give strong numerical evidence that the after-strand-passage knotting probability depends on the local structure around the strand passage site. Considering both the local structure and the crossing-sign at the strand passage site, we observe that the more "compact" the local structure, the less likely the after-strand-passage polygon is to be knotted. This trend is consistent with results from other strand-passage models, however, we are the first to note the influence of the crossing-sign information. Two measures of "compactness" are used: the size of a smallest polygon that contains the structure and the structure's "opening" angle. The opening angle definition is consistent with one that is measurable from single molecule DNA experiments.Comment: 31 pages, 12 figures, submitted to Journal of Physics

Self-avoiding walks and polygons on the triangular lattice

We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40 we also calculate series for the metric properties of mean-square end-to-end distance, mean-square radius of gyration and the mean-square distance of a monomer from the end points. For self-avoiding polygons to length 58 we calculate series for the mean-square radius of gyration and the first 10 moments of the area. Analysis of the series yields accurate estimates for the connective constant of triangular self-avoiding walks, $\mu=4.150797226(26)$, and confirms to a high degree of accuracy several theoretical predictions for universal critical exponents and amplitude combinations.Comment: 24 pages, 6 figure

Universal Amplitude Combinations for Self-Avoiding Walks, Polygons and Trails

We give exact relations for a number of amplitude combinations that occur in the study of self-avoiding walks, polygons and lattice trails. In particular, we elucidate the lattice-dependent factors which occur in those combinations which are otherwise universal, show how these are modified for oriented lattices, and give new results for amplitude ratios involving even moments of the area of polygons. We also survey numerical results for a wide range of amplitudes on a number of oriented and regular lattices, and provide some new ones.Comment: 20 pages, NI 92016, OUTP 92-54S, UCSBTH-92-5

BFACF-style algorithms for polygons in the body-centered and face-centered cubic lattices

In this paper the elementary moves of the BFACF-algorithm for lattice polygons are generalised to elementary moves of BFACF-style algorithms for lattice polygons in the body-centred (BCC) and face-centred (FCC) cubic lattices. We prove that the ergodicity classes of these new elementary moves coincide with the knot types of unrooted polygons in the BCC and FCC lattices and so expand a similar result for the cubic lattice. Implementations of these algorithms for knotted polygons using the GAS algorithm produce estimates of the minimal length of knotted polygons in the BCC and FCC lattices