43 research outputs found
Hyperforests on the Complete Hypergraph by Grassmann Integral Representation
We study the generating function of rooted and unrooted hyperforests in a
general complete hypergraph with n vertices by using a novel Grassmann
representation of their generating functions. We show that this new approach
encodes the known results about the exponential generating functions for the
different number of vertices. We consider also some applications as counting
hyperforests in the k-uniform complete hypergraph and the one complete in
hyperedges of all dimensions. Some general feature of the asymptotic regimes
for large number of connected components is discussed.Comment: 35 page
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.
Counting hypergraph matchings up to uniqueness threshold
We study the problem of approximately counting matchings in hypergraphs of
bounded maximum degree and maximum size of hyperedges. With an activity
parameter , each matching is assigned a weight .
The counting problem is formulated as computing a partition function that gives
the sum of the weights of all matchings in a hypergraph. This problem unifies
two extensively studied statistical physics models in approximate counting: the
hardcore model (graph independent sets) and the monomer-dimer model (graph
matchings).
For this model, the critical activity
is the threshold for the uniqueness of Gibbs measures on the infinite
-uniform -regular hypertree. Consider hypergraphs of maximum
degree at most and maximum size of hyperedges at most . We show that
when , there is an FPTAS for computing the partition
function; and when , there is a PTAS for computing the
log-partition function. These algorithms are based on the decay of correlation
(strong spatial mixing) property of Gibbs distributions. When , there is no PRAS for the partition function or the log-partition
function unless NPRP.
Towards obtaining a sharp transition of computational complexity of
approximate counting, we study the local convergence from a sequence of finite
hypergraphs to the infinite lattice with specified symmetry. We show a
surprising connection between the local convergence and the reversibility of a
natural random walk. This leads us to a barrier for the hardness result: The
non-uniqueness of infinite Gibbs measure is not realizable by any finite
gadgets
Counting packings of generic subsets in finite groups
A packing of subsets in a group is a
sequence such that are
disjoint subsets of . We give a formula for the number of packings if the
group is finite and if the subsets satisfy
a genericity condition. This formula can be seen as a generalization of the
falling factorials which encode the number of packings in the case where all
the sets are singletons