527 research outputs found

    From Cycle Rooted Spanning Forests to the Critical Ising Model: an Explicit Construction

    Full text link
    Fisher established an explicit correspondence between the 2-dimensional Ising model defined on a graph GG and the dimer model defined on a decorated version \GD of this graph \cite{Fisher}. In this paper we explicitly relate the dimer model associated to the critical Ising model and critical cycle rooted spanning forests (CRSFs). This relation is established through characteristic polynomials, whose definition only depends on the respective fundamental domains, and which encode the combinatorics of the model. We first show a matrix-tree type theorem establishing that the dimer characteristic polynomial counts CRSFs of the decorated fundamental domain \GD_1. Our main result consists in explicitly constructing CRSFs of \GD_1 counted by the dimer characteristic polynomial, from CRSFs of G1G_1 where edges are assigned Kenyon's critical weight function \cite{Kenyon3}; thus proving a relation on the level of configurations between two well known 2-dimensional critical models.Comment: 51 pages, 24 figures. To appear, Comm. Math. Phys. Revised version: title has changed. The terminology `correspondence' has been changed to that of `explicit construction' and `mapping

    Tetromino tilings and the Tutte polynomial

    Get PDF
    We consider tiling rectangles of size 4m x 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its orientation and position on the lattice. For a particular choice of the weights, the generating function of tilings is shown to be the evaluation of the multivariate Tutte polynomial Z\_G(Q,v) (known also to physicists as the partition function of the Q-state Potts model) on an (m-1) x (n-1) rectangle G, where the parameter Q and the edge weights v can take arbitrary values depending on the tile weights.Comment: 8 pages, 6 figure

    Generation of folk song melodies using Bayes transforms

    Get PDF
    The paper introduces the `Bayes transform', a mathematical procedure for putting data into a hierarchical representation. Applicable to any type of data, the procedure yields interesting results when applied to sequences. In this case, the representation obtained implicitly models the repetition hierarchy of the source. There are then natural applications to music. Derivation of Bayes transforms can be the means of determining the repetition hierarchy of note sequences (melodies) in an empirical and domain-general way. The paper investigates application of this approach to Folk Song, examining the results that can be obtained by treating such transforms as generative models

    Loop models and their critical points

    Full text link
    Loop models have been widely studied in physics and mathematics, in problems ranging from polymers to topological quantum computation to Schramm-Loewner evolution. I present new loop models which have critical points described by conformal field theories. Examples include both fully-packed and dilute loop models with critical points described by the superconformal minimal models and the SU(2)_2 WZW models. The dilute loop models are generalized to include SU(2)_k models as well.Comment: 20 pages, 15 figure

    Logarithmic corrections in the free energy of monomer-dimer model on plane lattices with free boundaries

    Full text link
    Using exact computations we study the classical hard-core monomer-dimer models on m x n plane lattice strips with free boundaries. For an arbitrary number v of monomers (or vacancies), we found a logarithmic correction term in the finite-size correction of the free energy. The coefficient of the logarithmic correction term depends on the number of monomers present (v) and the parity of the width n of the lattice strip: the coefficient equals to v when n is odd, and v/2 when n is even. The results are generalizations of the previous results for a single monomer in an otherwise fully packed lattice of dimers.Comment: 4 pages, 2 figure

    Some Exact Results for Spanning Trees on Lattices

    Full text link
    For nn-vertex, dd-dimensional lattices Λ\Lambda with d2d \ge 2, the number of spanning trees NST(Λ)N_{ST}(\Lambda) grows asymptotically as exp(nzΛ)\exp(n z_\Lambda) in the thermodynamic limit. We present an exact closed-form result for the asymptotic growth constant zbcc(d)z_{bcc(d)} for spanning trees on the dd-dimensional body-centered cubic lattice. We also give an exact integral expression for zfccz_{fcc} on the face-centered cubic lattice and an exact closed-form expression for z488z_{488} on the 4884 \cdot 8 \cdot 8 lattice.Comment: 7 pages, 1 tabl

    On the duality relation for correlation functions of the Potts model

    Full text link
    We prove a recent conjecture on the duality relation for correlation functions of the Potts model for boundary spins of a planar lattice. Specifically, we deduce the explicit expression for the duality of the n-site correlation functions, and establish sum rule identities in the form of the M\"obius inversion of a partially ordered set. The strategy of the proof is by first formulating the problem for the more general chiral Potts model. The extension of our consideration to the many-component Potts models is also given.Comment: 17 pages in RevTex, 5 figures, submitted to J. Phys.

    Phase Transition in a Self-repairing Random Network

    Full text link
    We consider a network, bonds of which are being sequentially removed; that is done at random, but conditioned on the system remaining connected (Self-Repairing Bond Percolation SRBP). This model is the simplest representative of a class of random systems for which forming of isolated clusters is forbidden. It qualitatively describes the process of fabrication of artificial porous materials and degradation of strained polymers. We find a phase transition at a finite concentration of bonds p=pcp=p_c, at which the backbone of the system vanishes; for all p<pcp<p_c the network is a dense fractal.Comment: 4 pages, 4 figure

    Influence of extended dynamics on phase transitions in a driven lattice gas

    Full text link
    Monte Carlo simulations and dynamical mean-field approximations are performed to study the phase transition in a driven lattice gas with nearest-neighbor exclusion on a square lattice. A slight extension of the microscopic dynamics with allowing the next-nearest-neighbor hops results in dramatic changes. Instead of the phase separation into high- and low-density regions in the stationary state the system exhibits a continuous transition belonging to the Ising universality class for any driving. The relevant features of phase diagram are reproduced by an improved mean-field analysis.Comment: 3 pages, 3 figure

    Numerical Estimation of the Asymptotic Behaviour of Solid Partitions of an Integer

    Full text link
    The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo simulations using Wang-Landau sampling method for integers up to 8000. It is shown that, for large n, ln[p(n)]/n^(3/4) = 1.79 \pm 0.01, where p(n) is the number of solid partitions of the integer n. This result strongly suggests that the MacMahon conjecture for solid partitions, though not exact, could still give the correct leading asymptotic behaviour.Comment: 6 pages, 4 figures, revtex
    corecore