157 research outputs found
Improved bounds for the number of forests and acyclic orientations in the square lattice
In a recent paper Merino and Welsh (1999) studied several counting problems on the square lattice . The authors gave the following bounds for the asymptotics of , the number of forests of , and , the number of acyclic orientations of : and .
In this paper we improve these bounds as follows: and . We obtain this by developing a method for computing the Tutte polynomial of the square lattice and other related graphs based on transfer matrices
Computing the Tutte polynomial of Archimedean tilings
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte polynomial of square lattices. We also address the problem of obtaining Tutte polynomial evaluations from the symbolic expressions generated by our algorithm, improving the best known lower bound for the asymptotics of the number of spanning forests, and the lower and upper bounds for the asymptotics of the number of acyclic orientations of the square lattice
Detecting and counting small subgraphs, and evaluating a parameterized Tutte polynomial: lower bounds via toroidal grids and Cayley graph expanders
Given a graph property , we consider the problem , where the input is a pair of a graph and a positive integer , and the task is to decide whether contains a -edge subgraph that satisfies . Specifically, we study the parameterized complexity of and of its counting problem with respect to both approximate and exact counting. We obtain a complete picture for minor-closed properties : the decision problem always admits an FPT algorithm and the counting problem always admits an FPTRAS. For exact counting, we present an exhaustive and explicit criterion on the property which, if satisfied, yields fixed-parameter tractability and otherwise -hardness. Additionally, most of our hardness results come with an almost tight conditional lower bound under the so-called Exponential Time Hypothesis, ruling out algorithms for that run in time for any computable function . As a main technical result, we gain a complete understanding of the coefficients of toroidal grids and selected Cayley graph expanders in the homomorphism basis of . This allows us to establish hardness of exact counting using the Complexity Monotonicity framework due to Curticapean, Dell and Marx (STOC'17). Our methods can also be applied to a parameterized variant of the Tutte Polynomial of a graph , to which many known combinatorial interpretations of values of the (classical) Tutte Polynomial can be extended. As an example, corresponds to the number of -forests in the graph . Our techniques allow us to completely understand the parametrized complexity of computing the evaluation of at every pair of rational coordinates
Renormalization: an advanced overview
We present several approaches to renormalization in QFT: the multi-scale
analysis in perturbative renormalization, the functional methods \`a la
Wetterich equation, and the loop-vertex expansion in non-perturbative
renormalization. While each of these is quite well-established, they go beyond
standard QFT textbook material, and may be little-known to specialists of each
other approach. This review is aimed at bridging this gap.Comment: Review, 130 pages, 33 figures; v2: misprints corrected, refs. added,
minor improvements; v3: some changes to sect. 5, refs. adde
- …