Erratum - Frustration in periodic systems : exact results for some 2D ising models

1979 ◽  
Vol 40 (10) ◽  
pp. 1024-1024
Author(s):  
G. André ◽  
R. Bidaux ◽  
J.-P. Carton ◽  
R. Conte ◽  
L. de Seze
1979 ◽  
Vol 40 (5) ◽  
pp. 479-488 ◽  
Author(s):  
G. André ◽  
R. Bidaux ◽  
J.-P. Carton ◽  
R. Conte ◽  
L. de Seze

1988 ◽  
Vol 02 (01) ◽  
pp. 49-63 ◽  
Author(s):  
T. C. CHOY

Exactly soluble Z-invariant (or Baxter) models of statistical mechanics are generalised on two-dimensional Penrose lattices based on the de Bruijn construction. A unique soluble model is obtained for each realization of the Penrose lattice. Analysis of these models shows that they are soluble along a line in parameter space which intersects the critical surface at a point that can be determined exactly. In the Ising case, critical exponents along this line are identical with the regular two-dimensional Ising model thus supporting the conventional picture of the universality hypothesis.


1997 ◽  
Vol 11 (11) ◽  
pp. 1363-1388
Author(s):  
Alessandro Pelizzola

Layered models are models in which the coupling constants depend in an arbitrary way on one spatial coordinate, usually the distance from a free surface or boundary. Here the theory of the boundary critical behaviour of two-dimensional layered Ising models, including the Hilhorst–van Leeuwen model and models for aperiodic systems, is reviewed, with a particular attention to exact results for the critical behaviour and the boundary order parameter.


1978 ◽  
Vol 40 (25) ◽  
pp. 1605-1608 ◽  
Author(s):  
H. J. Hilhorst ◽  
M. Schick ◽  
J. M. J. van Leeuwen

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.


Sign in / Sign up

Export Citation Format

Share Document