arXiv subjects

Andrea Sportiello

Publications and source records attributed to Andrea Sportiello.

45 records · Page 3Linked to original sources

arXiv2007

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.

math-ph↗

arXiv2007

Renormalization flow for unrooted forests on a triangular lattice

We compute in small temperature expansion the two-loop renormalization constants and the three-loop coefficient of the beta-function, that is the first non-universal term, for the sigma-model with O(N) invariance on the triangular lattice at N=-1. The partition function of the corresponding Grassmann theory is, for negative temperature, the generating function of unrooted forests on such a lattice, where the temperature acts as a chemical potential for the number of trees in the forest. To evaluate Feynman diagrams we extend the coordinate space method to the triangular lattice.

cond-mat.stat-mech↗

arXiv2007

The Phase Diagram of 1-in-3 Satisfiability Problem

We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and probability of negation of a variable in a clause. Random 1-in-3 Satisfiability and Exact 3-Cover are special cases of this ensemble. We interpolate between these cases from a region where satisfiability can be typically decided for all connectivities in polynomial time to a region where deciding satisfiability is hard, in some interval of connectivities. We derive several rigorous results in the first region, and develop the one-step--replica-symmetry-breaking cavity analysis in the second one. We discuss the prediction for the transition between the almost surely satisfiable and the almost surely unsatisfiable phase, and other structural properties of the phase diagram, in light of cavity method results.

cond-mat.stat-mech↗

arXiv2007

A Hike in the Phases of the 1-in-3 Satisfiability

We summarise our results for the random $ε$--1-in-3 satisfiability problem, where $ε$ is a probability of negation of the variable. We employ both rigorous and heuristic methods to describe the SAT/UNSAT and Hard/Easy transitions.

cond-mat.stat-mech↗

arXiv2006

One-in-Two-Matching Problem is NP-complete

2-dimensional Matching Problem, which requires to find a matching of left- to right-vertices in a balanced $2n$-vertex bipartite graph, is a well-known polynomial problem, while various variants, like the 3-dimensional analogoue (3DM, with triangles on a tripartite graph), or the Hamiltonian Circuit Problem (HC, a restriction to ``unicyclic'' matchings) are among the main examples of NP-hard problems, since the first Karp reduction series of 1972. The same holds for the weighted variants of these problems, the Linear Assignment Problem being polynomial, and the Numerical 3-Dimensional Matching and Travelling Salesman Problem being NP-complete. In this paper we show that a small modification of the 2-dimensional Matching and Assignment Problems in which for each $i \leq n/2$ it is required that either $π(2i-1)=2i-1$ or $π(2i)=2i$, is a NP-complete problem. The proof is by linear reduction from SAT (or NAE-SAT), with the size $n$ of the Matching Problem being four times the number of edges in the factor graph representation of the boolean problem. As a corollary, in combination with the simple linear reduction of One-in-Two Matching to 3-Dimensional Matching, we show that SAT can be linearly reduced to 3DM, while the original Karp reduction was only cubic.

cs.CC↗

arXiv2005

O(n) vector model at n=-1, -2 on random planar lattices: a direct combinatorial derivation

The O(n) vector model with logarithmic action on a lattice of coordination 3 is related to a gas of self-avoiding loops on the lattice. This formulation allows for analytical continuation in n: critical behaviour is found in the real interval [-2,2]. The solution of the model on random planar lattices, recovered by random matrices, also involves an analytic continuation in the number n of auxiliary matrices. Here we show that, in the two cases n=-1, -2, a combinatorial reformulation of the loop gas problem allows to achieve the random matrix solution with no need of this analytical continuation.

cond-mat.stat-mech↗

arXiv2004

Fermionic field theory for trees and forests

We prove a generalization of Kirchhoff's matrix-tree theorem in which a large class of combinatorial objects are represented by non-Gaussian Grassmann integrals. As a special case, we show that unrooted spanning forests, which arise as a q \to 0 limit of the Potts model, can be represented by a Grassmann theory involving a Gaussian term and a particular bilocal four-fermion term. We show that this latter model can be mapped, to all orders in perturbation theory, onto the N-vector model at N=-1 or, equivalently, onto the sigma-model taking values in the unit supersphere in R^{1|2}. It follows that, in two dimensions, this fermionic model is perturbatively asymptotically free.

cond-mat.stat-mech↗

arXiv2003

General duality for abelian-group-valued statistical-mechanics models

We introduce a general class of statistical-mechanics models, taking values in an abelian group, which includes examples of both spin and gauge models, both ordered and disordered. The model is described by a set of ``variables'' and a set of ``interactions''. A Gibbs factor is associated to each variable and to each interaction. We introduce a duality transformation for systems in this class. The duality exchanges the abelian group with its dual, the Gibbs factors with their Fourier transforms, and the interactions with the variables. High (low) couplings in the interaction terms are mapped into low (high) couplings in the one-body terms. The idea is that our class of systems extends the one for which the classical procedure 'a la Kramers and Wannier holds, up to include randomness into the pattern of interaction. We introduce and study some physical examples: a random Gaussian Model, a random Potts-like model, and a random variant of discrete scalar QED. We shortly describe the consequence of duality for each example.

cond-mat.stat-mech↗

arXiv2002

An exactly solvable random satisfiability problem

We introduce a new model for the generation of random satisfiability problems. It is an extension of the hyper-SAT model of Ricci-Tersenghi, Weigt and Zecchina, which is a variant of the famous K-SAT model: it is extended to q-state variables and relates to a different choice of the statistical ensemble. The model has an exactly solvable statistic: the critical exponents and scaling functions of the SAT/UNSAT transition are calculable at zero temperature, with no need of replicas, also with exact finite-size corrections. We also introduce an exact duality of the model, and show an analogy of thermodynamic properties with the Random Energy Model of disordered spin systems theory. Relations with Error-Correcting Codes are also discussed.

cond-mat.stat-mech↗