๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Partition Function of the Eight-Vertex Lattice Model

โœ Scribed by Rodney J. Baxter

Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
269 KB
Volume
281
Category
Article
ISSN
0003-4916

No coin nor oath required. For personal study only.

โœฆ Synopsis

The partition function of the zero-field ``Eight-Vertex'' model on a square M by N lattice is calculated exactly in the limit of M, N large. This model includes the dimer, ice and zerofield Ising, F and KDP models as special cases. In general the free energy has a branch point singularity at a phase transition, with an irrational exponent.

๐Ÿ“œ SIMILAR VOLUMES

Renormalization connection between the e
Renormalization connection between the eight-vertex model and the gaussian model
โœ H.J.F Knops ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

A generalized version of the Villain model is defined which contains the eight-vertex model as a special case. A renormalization pattern is formulated in terms of this Villain model by which critical line(s) in the eight-vertex model are connected with the Gaussian fixed line. Gaussian equivalents a

MacMahon Symmetric Functions, the Partit
MacMahon Symmetric Functions, the Partition Lattice, and Young Subgroups
โœ Mercedes H. Rosas ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 180 KB

A MacMahon symmetric function is a formal power series in a finite number of alphabets that is invariant under the diagonal action of the symmetric group. In this article, we show that the MacMahon symmetric functions are the generating functions for the orbits of sets of functions indexed by partit

Representations of a sublattice of the p
Representations of a sublattice of the partition lattice on a lattice
โœ Ronny Rousseau ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 529 KB

A partial ordering is defined for monotone projections on a lattice, such that the set of these mappings is a lattice which is isomorphic to a sublattice of the partition lattice.

Chains in the lattice of noncrossing par
Chains in the lattice of noncrossing partitions
โœ Paul H. Edelman; Rodica Simion ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 735 KB

The lattice of noncrossing set partitions is known to admit an R-labeling. Under this labeling, maximal chains give rise to permutations. We discuss structural and enumerative properties of the lattice of noncrossing partitions, which pertain to a new permutation statistic, m(a), defined as the num

On the structure of the lattice of noncr
On the structure of the lattice of noncrossing partitions
โœ Rodica Simion; Daniel Ullman ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 882 KB

Simion, R. and D. Ullman, On the structure of the lattice of noncrossing partitions, Discrete Mathematics 98 (1991) 193-206. We show that the lattice of noncrossing (set) partitions is self-dual and that it admits a symmetric chain decomposition. The self-duality is proved via an order-reversing i