R J Baxter 1982 London: Academic xii + 486 pp price £43.60 Over the past few years there has been a growing belief that all the twodimensional lattice statistical models will eventually be solved and that it will be Professor Baxter who solves them. Baxter has inherited the mantle of Onsager who started the process by solving exactly the two-dimensional Ising model in 1944.

Exactly Solved Models in Statistical Mechanics

This paper gives a review of integration algorithms for finite dimensional mechanical systems that are based on discrete variational principles. The variational technique gives a unified treatment of many symplectic schemes, including those of higher order, as well as a natural treatment of the discrete Noether theorem. The approach also allows us to include forces, dissipation and constraints in a natural way. Amongst the many specific schemes treated as examples, the Verlet, SHAKE, RATTLE, Newmark, and the symplectic partitioned Runge–Kutta schemes are presented.

/pdf/discrete-mechanics-and-variational-integrators-4qm2t5dk6u.pdf

Discrete mechanics and variational integrators

A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional consistency. This property yields, among other features, the existence of the discrete zero curvature with a spectral parameter. For all integrable systems of the obtained exhaustive list, the so called three-leg forms are found. This establishes Lagrangian and symplectic structures for these systems, and the connection to discrete systems of the Toda type on arbitrary graphs. Generalizations of these ideas to the three-dimensional integrable systems and to the quantum context are also discussed.

Classification of integrable equations on quad-graphs. The consistency approach

The purpose of this work is twofold. First, we demonstrate analytically
that the classical Newmark family as well as related integration
algorithms are variational in the sense of the Veselov formulation of
discrete mechanics. Such variational algorithms are well known to be
symplectic and momentum preserving and to often have excellent global
energy behavior. This analytical result is veried through numerical examples
and is believed to be one of the primary reasons that this class
of algorithms performs so well.
Second, we develop algorithms for mechanical systems with forcing,
and in particular, for dissipative systems. In this case, we develop integrators
that are based on a discretization of the Lagrange d'Alembert
principle as well as on a variational formulation of dissipation. It is
demonstrated that these types of structured integrators have good numerical
behavior in terms of obtaining the correct amounts by which
the energy changes over the integration run.

/pdf/variational-integrators-and-the-newmark-algorithm-for-vozkbpe62d.pdf

Variational integrators and the Newmark algorithm for conservative and dissipative mechanical systems

In architectural freeform design, the relation between shape and fabrication poses new challenges and requires more sophistication from the underlying geometry. The new concept of conical meshes satisfies central requirements for this application: They are quadrilateral meshes with planar faces, and therefore particularly suitable for the design of freeform glass structures. Moreover, they possess a natural offsetting operation and provide a support structure orthogonal to the mesh. Being a discrete analogue of the network of principal curvature lines, they represent fundamental shape characteristics. We show how to optimize a quad mesh such that its faces become planar, or the mesh becomes even conical. Combining this perturbation with subdivision yields a powerful new modeling tool for all types of quad meshes with planar faces, making subdivision attractive for architecture design and providing an elegant way of modeling developable surfaces.

/pdf/geometric-modeling-with-conical-meshes-and-developable-1yxp9wwbnw.pdf

Geometric modeling with conical meshes and developable surfaces

Discrete (lattice) systems constitute a well-established part of the theory of integrable systems. They came up already in the early days of the theory (see, e.g. [11, 12]), and took gradually more and more important place in it (cf. a review in [18]). Nowadays many experts in the field agree that discrete integrable systems are in many respects even more fundamental than the continuous ones. They play a prominent role in various applications of integrable systems such as discrete differential geometry (see, e.g., a review in [9]). Traditionally, independent variables of discrete integrable systems are considered as belonging to a regular square lattice Z (or its multidimensional analogs Z). Only very recently, there appeared first hints on the existence of a rich and meaningful theory of integrable systems on nonsquare lattices and, more generally, on arbitrary graphs. The relevant publications are almost exhausted by [2, 3, 5, 6, 16, 20, 21, 22]. We define integrable systems on graphs as flat connections with the values in loop groups. This is very natural definition, and experts in discrete integrable systems will not only immediately accept it, but might even consider it trivial. Nevertheless, it crystallized only very recently, and seems not to appear in the literature before [3, 5, 6]. (It should be noted that a different framework for integrable systems on graphs is being developed by Novikov with collaborators [16, 20, 21].) We were led to considering such systems by our (with Hoffmann) investigations of circle patterns as objects of discrete complex analysis: in [5, 6] we demonstrated that certain classes of circle patterns with the combinatorics of regular hexagonal lattice

/pdf/integrable-systems-on-quad-graphs-1hy002db2p.pdf

Integrable systems on quad-graphs

Classical differential geometry Discretization principles. Multidimensional nets Discretization principles. Nets in quadrics Special classes of discrete surfaces Approximation Consistency as integrability Discrete complex analysis. Linear theory Discrete complex analysis. Integrable circle patterns Foundations Solutions of selected exercises Bibliography Notations Index.

/pdf/discrete-differential-geometry-integrable-structure-w615a34ddh.pdf

Discrete Differential Geometry: Integrable Structure

We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular decompositions of oriented surfaces with all two-cells being quadrilateral. We establish a relation between integrable systems on quad-graphs and discrete systems of the Toda type on graphs. We propose a simple and general procedure for deriving discrete zero curvature representations for integrable systems on quad-graphs, based on the principle of the three-dimensional consistency. Thus, finding a zero curvature representation is put on an algorithmic basis and does not rely on the guesswork anymore. Several examples of integrable systems on quad-graphs are considered in detail, their geometric interpretation is given in terms of circle patterns.

We consider discrete nonlinear hyperbolic equations on quad-graphs, in particular on ℤ2. The fields are associated with the vertices and an equation of the form Q(x
 1, x
 2, x
 3, x
 4) = 0 relates four vertices of one cell. The integrability of equations is understood as 3D-consistency, which means that it is possible to impose equations of the same type on all faces of a three-dimensional cube so that the resulting system will be consistent. This allows one to extend these equations also to the multidimensional lattices ℤ
 N
 . We classify integrable equations with complex fields x and polynomials Q multiaffine in all variables. Our method is based on the analysis of singular solutions.

http://page.math.tu-berlin.de/~bobenko/papers/2009_Adl_Bob_Sur_En.pdf

Discrete Nonlinear Hyperbolic Equations. Classification of Integrable Cases

Two discretizations, linear and nonlinear, of basic notions of the complex analysis are considered. The underlying lattice is an arbitrary quasicrystallic rhombic tiling of a plane. The linear theory is based on the discrete Cauchy-Riemann equations, the nonlinear one is based on the notion of circle patterns. We clarify the role of the rhombic condition in both theories: under this condition the corresponding equations are integrable (in the sense of 3D consistency, which yields also the existense of zero curvature representations, Backlund transformations etc.). We demonstrate that in some precise sense the linear theory is a linearization of the nonlinear one: the tangent space to a set of integrable circle patterns at an isoradial point consists of discrete holomorphic functions which take real (imaginary) values on two sublattices. We extend solutions of the basic equations of both theories to Z d , where d is the number of different edge slopes of the quasicrystallic tiling. In the linear theory, we give an integral representation of an arbitrary discrete holomorphic function, thus proving the density of discrete exponential functions. We introduce the d-dimensional discrete logarithmic function which is a generalization of Kenyon's discrete Green's function, and uncover several new properties of this function. We prove that it is an isomonodromic solution of the discrete Cauchy-Riemann equations, and that it is a tangent vector to the space of integrable circle patterns along the family of isomonodromic discrete power functions.

/pdf/linear-and-nonlinear-theories-of-discrete-analytic-functions-4rkrcabdzd.pdf

Yuri B. Suris

Papers

Integrable systems on quad-graphs

Discrete Differential Geometry: Integrable Structure

Integrable systems on quad-graphs

Discrete Nonlinear Hyperbolic Equations. Classification of Integrable Cases

Linear and nonlinear theories of discrete analytic functions. Integrable structure and isomonodromic Green's function