A Cluster Method for the Ashkin--Teller Model

A cluster Monte Carlo algorithm for the Ashkin-Teller (AT) model is constructed according to the guidelines of a general scheme for such algorithms. Its dynamical behaviour is tested for the square lattice AT model. We perform simulations on the line of critical points along which the exponents vary continuously, and find that critical slowing down is significantly reduced. We find continuous variation of the dynamical exponent $z$ along the line, following the variation of the ratio $\alpha/\nu$, in a manner which satisfies the Li-Sokal bound $z_{cluster}\geq\alpha/\nu$, that was so far proved only for Potts models.Comment: 18 pages, Revtex, figures include

Galois groups of multivariate Tutte polynomials

The multivariate Tutte polynomial $\hat Z_M$ of a matroid $M$ is a generalization of the standard two-variable version, obtained by assigning a separate variable $v_e$ to each element $e$ of the ground set $E$. It encodes the full structure of $M$. Let \bv = \{v_e\}_{e\in E}, let $K$ be an arbitrary field, and suppose $M$ is connected. We show that $\hat Z_M$ is irreducible over K(\bv), and give three self-contained proofs that the Galois group of $\hat Z_M$ over K(\bv) is the symmetric group of degree $n$, where $n$ is the rank of $M$. An immediate consequence of this result is that the Galois group of the multivariate Tutte polynomial of any matroid is a direct product of symmetric groups. Finally, we conjecture a similar result for the standard Tutte polynomial of a connected matroid.Comment: 8 pages, final version, to appear in J. Alg. Comb. Substantial revisions, including the addition of two alternative proofs of the main resul

Application of the O(N)O(N)-Hyperspherical Harmonics to the Study of the Continuum Limits of One-Dimensional σ\sigma-Models and to the Generation of High-Temperature Expansions in Higher Dimensions

In this talk we present the exact solution of the most general one-dimensional $O(N)$-invariant spin model taking values in the sphere $S^{N-1}$, with nearest-neighbour interactions, and we discuss the possible continuum limits. All these results are obtained using a high-temperature expansion in terms of hyperspherical harmonics. Applications in higher dimensions of the same technique are then discussed.Comment: 59208 bytes uuencoded gzip'ed (expands to 135067 bytes Postscript); 4 pages including all figures; contribution to Lattice '9

Borel summability and Lindstedt series

Resonant motions of integrable systems subject to perturbations may continue to exist and to cover surfaces with parametric equations admitting a formal power expansion in the strength of the perturbation. Such series may be, sometimes, summed via suitable sum rules defining $C^\infty$ functions of the perturbation strength: here we find sufficient conditions for the Borel summability of their sums in the case of two-dimensional rotation vectors with Diophantine exponent $\tau=1$ (e. g. with ratio of the two independent frequencies equal to the golden mean).Comment: 17 pages, 1 figur

On the Potts model partition function in an external field

We study the partition function of Potts model in an external (magnetic) field, and its connections with the zero-field Potts model partition function. Using a deletion-contraction formulation for the partition function Z for this model, we show that it can be expanded in terms of the zero-field partition function. We also show that Z can be written as a sum over the spanning trees, and the spanning forests, of a graph G. Our results extend to Z the well-known spanning tree expansion for the zero-field partition function that arises though its connections with the Tutte polynomial

Non-Coexistence of Infinite Clusters in Two-Dimensional Dependent Site Percolation

This paper presents three results on dependent site percolation on the square lattice. First, there exists no positively associated probability measure on {0,1}^{Z^2} with the following properties: a) a single infinite 0cluster exists almost surely, b) at most one infinite 1*cluster exists almost surely, c) some probabilities regarding 1*clusters are bounded away from zero. Second, we show that coexistence of an infinite 1*cluster and an infinite 0cluster is almost surely impossible when the underlying probability measure is ergodic with respect to translations, positively associated, and satisfies the finite energy condition. The third result analyses the typical structure of infinite clusters of both types in the absence of positive association. Namely, under a slightly sharpened finite energy condition, the existence of infinitely many disjoint infinite self-avoiding 1*paths follows from the existence of an infinite 1*cluster. The same holds with respect to 0paths and 0clusters.Comment: 17 pages, 1 figur

Exponential Time Complexity of Weighted Counting of Independent Sets

We consider weighted counting of independent sets using a rational weight x: Given a graph with n vertices, count its independent sets such that each set of size k contributes x^k. This is equivalent to computation of the partition function of the lattice gas with hard-core self-repulsion and hard-core pair interaction. We show the following conditional lower bounds: If counting the satisfying assignments of a 3-CNF formula in n variables (#3SAT) needs time 2^{\Omega(n)} (i.e. there is a c>0 such that no algorithm can solve #3SAT in time 2^{cn}), counting the independent sets of size n/3 of an n-vertex graph needs time 2^{\Omega(n)} and weighted counting of independent sets needs time 2^{\Omega(n/log^3 n)} for all rational weights x\neq 0. We have two technical ingredients: The first is a reduction from 3SAT to independent sets that preserves the number of solutions and increases the instance size only by a constant factor. Second, we devise a combination of vertex cloning and path addition. This graph transformation allows us to adapt a recent technique by Dell, Husfeldt, and Wahlen which enables interpolation by a family of reductions, each of which increases the instance size only polylogarithmically.Comment: Introduction revised, differences between versions of counting independent sets stated more precisely, minor improvements. 14 page

Compact phases of polymers with hydrogen bonding

We propose an off-lattice model for a self-avoiding homopolymer chain with two different competing attractive interactions, mimicking the hydrophobic effect and the hydrogen bond formation respectively. By means of Monte Carlo simulations, we are able to trace out the complete phase diagram for different values of the relative strength of the two competing interactions. For strong enough hydrogen bonding, the ground state is a helical conformation, whereas with decreasing hydrogen bonding strength, helices get eventually destabilized at low temperature in favor of more compact conformations resembling $\beta$-sheets appearing in native structures of proteins. For weaker hydrogen bonding helices are not thermodynamically relevant anymore.Comment: 5 pages, 3 figures; revised version published in PR

On the convergence of cluster expansions for polymer gases

We compare the different convergence criteria available for cluster expansions of polymer gases subjected to hard-core exclusions, with emphasis on polymers defined as finite subsets of a countable set (e.g. contour expansions and more generally high- and low-temperature expansions). In order of increasing strength, these criteria are: (i) Dobrushin criterion, obtained by a simple inductive argument; (ii) Gruber-Kunz criterion obtained through the use of Kirkwood-Salzburg equations, and (iii) a criterion obtained by two of us via a direct combinatorial handling of the terms of the expansion. We show that for subset polymers our sharper criterion can be proven both by a suitable adaptation of Dobrushin inductive argument and by an alternative --in fact, more elementary-- handling of the Kirkwood-Salzburg equations. In addition we show that for general abstract polymers this alternative treatment leads to the same convergence region as the inductive Dobrushin argument and, furthermore, to a systematic way to improve bounds on correlations

Exact sampling of self-avoiding paths via discrete Schramm-Loewner evolution

We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus on the problem of reproducing the parametrization corresponding to that of lattice models, namely self-avoiding walks on the lattice, and we propose a strategy that gives rise to discrete paths where consecutive points lie an approximately constant distance apart from each other. This new method allows us to tackle two non-trivial features of self-avoiding walks that critically depend on the parametrization: the asphericity of a portion of chain and the correction-to-scaling exponent.Comment: 18 pages, 4 figures. Some sections rewritten (including title and abstract), numerical results added, references added. Accepted for publication in J. Stat. Phy