Osculating and neighbour-avoiding polygons on the square lattice
Iwan Jensen
Abstract
We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour vertices provided these are joined by the associated edge and thus form a sub-set of self-avoiding polygons. We use the finite lattice method to count the number of osculating polygons and neighbour-avoiding polygons on the square lattice. We also calculate their radius of gyration and the first area-weighted moment. Analysis of the series confirms exact predictions for the critical exponents and the universality of various amplitude combinations. For both cases we have found exact solutions for the number of convex and almost-convex polygons.
Create a lesson
Related papers
Dynamically Reentrant Skyrmion Phase in Oscillating Magnetic Fields
Z. Demir Vatansever, E. Vatansever, A. Vasilopoulos et al.
Mutual linearity in semi-Markov networks
Julian B. Voits, Ulrich S. Schwarz
Steady states in asymmetric exclusion processes with reactions: Fluctuations and non-mean field behaviour
Rohn Chatterjee, Atri Goswami, Sudip Mukherjee
Marginal Operator Deformations and Pseudocriticality in Baxter--Wu Models
Hyun-Yong Lee, Naoki Kawashima, Nikolaos G. Fytas et al.
Kardar--Parisi--Zhang density hydrodynamics in a coherent XXZ--ASEP Lindbladian
Yansheng Liu, Daoguang Li, Kaixiang Lu et al.
Brownian gyrator model with stochastic resetting
Satya N. Majumdar, Gregory Schehr, Pascal Viot et al.