ISU - Multigrid for computing propagators

The Iteratively Smoothing Unigrid algorithm (ISU), a new multigrid method for computing propagators in Lattice Gauge Theory, is explained. The main idea is to compute good (i.e.\ smooth) interpolation operators in an iterative way. This method shows {\em no critical slowing down} for the 2-dimensional Laplace equation in an SU(2) gauge field. First results for the Dirac-operator are also shown.Comment: 3 pages, latex, no figures, Contribution to Lattice 94, uses espcrc2.sty and fleqn.sty as required for lattice proceeding

Ferromagnetic phase transition for the spanning-forest model (q \to 0 limit of the Potts model) in three or more dimensions

We present Monte Carlo simulations of the spanning-forest model (q \to 0 limit of the ferromagnetic Potts model) in spatial dimensions d=3,4,5. We show that, in contrast to the two-dimensional case, the model has a "ferromagnetic" second-order phase transition at a finite positive value w_c. We present numerical estimates of w_c and of the thermal and magnetic critical exponents. We conjecture that the upper critical dimension is 6.Comment: LaTex2e, 4 pages; includes 6 Postscript figures; Version 2 has expanded title as published in PR

Dynamic critical behavior of the Chayes-Machta-Swendsen-Wang algorithm

We study the dynamic critical behavior of the Chayes-Machta dynamics for the Fortuin-Kasteleyn random-cluster model, which generalizes the Swendsen-Wang dynamics for the q-state Potts model to noninteger q, in two and three spatial dimensions, by Monte Carlo simulation. We show that the Li-Sokal bound z \ge \alpha/\nu is close to but probably not sharp in d=2, and is far from sharp in d=3, for all q. The conjecture z \ge \beta/\nu is false (for some values of q) in both d=2 and d=3.Comment: Revtex4, 4 pages including 4 figure

Completeness of the classical 2D Ising model and universal quantum computation

We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with complex inhomogeneous couplings and external fields. In the case where the original model is an Ising or Potts-type model, we find that the corresponding 2D square lattice requires only polynomially more spins w.r.t the original one, and we give a constructive method to map such models to the 2D Ising model. For more general models the overhead in system size may be exponential. The results are established by connecting classical spin models with measurement-based quantum computation and invoking the universality of the 2D cluster states.Comment: 4 pages, 1 figure. Minor change

Cluster simulations of loop models on two-dimensional lattices

We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use this algorithm to investigate the honeycomb-lattice O(n) loop model, for which we determine several new critical exponents, and a square-lattice O(n) loop model, for which we obtain new information on the phase diagram.Comment: LaTex2e, 4 pages; includes 1 table and 2 figures. Totally rewritten in version 2, with new theory and new data. Version 3 as published in PR

Grassmann Integral Representation for Spanning Hyperforests

Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and unrooted spanning (hyper)forests and spanning (hyper)trees. All these results are generalizations of Kirchhoff's matrix-tree theorem. Furthermore, we show that the class of integrals describing unrooted spanning (hyper)forests is induced by a theory with an underlying OSP(1|2) supersymmetry.Comment: 50 pages, it uses some latex macros. Accepted for publication on J. Phys.

Topological interactions between ring polymers: Implications for chromatin loops

Chromatin looping is a major epigenetic regulatory mechanism in higher eukaryotes. Besides its role in transcriptional regulation, chromatin loops have been proposed to play a pivotal role in the segregation of entire chromosomes. The detailed topological and entropic forces between loops still remain elusive. Here, we quantitatively determine the potential of mean force between the centers of mass of two ring polymers, i.e. loops. We find that the transition from a linear to a ring polymer induces a strong increase in the entropic repulsion between these two polymers. On top, topological interactions such as the non-catenation constraint further reduce the number of accessible conformations of close-by ring polymers by about 50%, resulting in an additional effective repulsion. Furthermore, the transition from linear to ring polymers displays changes in the conformational and structural properties of the system. In fact, ring polymers adopt a markedly more ordered and aligned state than linear ones. The forces and accompanying changes in shape and alignment between ring polymers suggest an important regulatory function of such a topology in biopolymers. We conjecture that dynamic loop formation in chromatin might act as a versatile control mechanism regulating and maintaining different local states of compaction and order.Comment: 12 pages, 11 figures. The article has been accepted by The Journal Of Chemical Physics. After it is published, it will be found at http://jcp.aip.or

Approximating the partition function of the ferromagnetic Potts model

We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1 under approximation-preserving reducibility. Thus, it is as hard to approximate the partition function as it is to find approximate solutions to a wide range of counting problems, including that of determining the number of independent sets in a bipartite graph. Our proof exploits the first order phase transition of the "random cluster" model, which is a probability distribution on graphs that is closely related to the q-state Potts model.Comment: Minor correction

Lattice paths and branched continued fractions II. Multivariate Lah polynomials and Lah symmetric functions

We introduce the generic Lah polynomials Ln,k(ϕ), which enumerate unordered forests of increasing ordered trees with a weight ϕi for each vertex with i children. We show that, if the weight sequence ϕ is Toeplitz-totally positive, then the triangular array of generic Lah polynomials is totally positive and the sequence of row-generating polynomials Ln(ϕ,y) is coefficientwise Hankel-totally positive. Upon specialization we obtain results for the Lah symmetric functions and multivariate Lah polynomials of positive and negative type. The multivariate Lah polynomials of positive type are also given by a branched continued fraction. Our proofs use mainly the method of production matrices; the production matrix is obtained by a bijection from ordered forests of increasing ordered trees to labeled partial Łukasiewicz paths. We also give a second proof of the continued fraction using the Euler–Gauss recurrence method