Systematic derivation of partition functions for ligand binding to two-dimensional lattices

The Ising problem consists in finding the analytical solution of the partition function of a lattice once the interaction geometry among its elements is specified. No general analytical solution is available for this problem, except for the one-dimensional case. Using site-specific thermodynamics, it is shown that the partition function for ligand binding to a two-dimensional lattice can be obtained from those of one-dimensional lattices with known solution. The complexity of the lattice is reduced recursively by application of a contact transformation that involves a relatively small number of steps. The transformation implemented in a computer code solves the partition function of the lattice by operating on the connectivity matrix of the graph associated with it. This provides a powerful new approach to the Ising problem, and enables a systematic analysis of two-dimensional lattices that model many biologically relevant phenomena. Application of this approach to finite two-dimensional lattices with positive cooperativity indicates that the binding capacity per site diverges as Na (N = number of sites in the lattice) and experiences a phase-transition-like discontinuity in the thermodynamic limit N → ∞. The zeroes of the partition function tend to distribute on a slightly distorted unit circle in complex plane and approach the positive real axis already for a 5×5 square lattice. When the lattice has negative cooperativity, its properties mimic those of a system composed of two classes of independent sites with the apparent population of low-affinity binding sites increasing with the size of the lattice, thereby accounting for a phenomenon encountered in many ligand-receptor interactions.

Ergodic theorems along sequences and Hardy fields.

Let a(x) be a real function with a regular growth as x --> infinity. [The precise technical assumption is that a(x) belongs to a Hardy field.] We establish sufficient growth conditions on a(x) so that the sequence ([a(n)])(infinity)(n=1) is a good averaging sequence in L2 for the pointwise ergodic theorem. A sequence (an) of positive integers is a good averaging sequence in L2 for the pointwise ergodic theorem if in any dynamical system (Omega, Sigma, m, T) for f [symbol, see text] in L2(Omega) the averages [equation, see text] converge for almost every omicron in. Our result implies that sequences like ([ndelta]), where delta > 1 and not an integer, ([n log n]), and ([n2/log n]) are good averaging sequences for L2. In fact, all the sequences we examine will turn out to be good averaging for Lp, p > 1; and even for L log L. We will also establish necessary and sufficient growth conditions on a(x) so that the sequence ([a(n)]) is good averaging for mean convergence. Note that for some a(x) (e.g., a(x) = log2 x), ([a(n)]) may be good for mean convergence without being good for pointwise convergence.