Testing first-order properties for subclasses of sparse graphs

We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nesetril and Ossona de Mendez. This generalizes several results from the literature, because many natural classes of graphs have bounded expansion: graphs of bounded tree-width, all proper minor-closed classes of graphs, graphs of bounded degree, graphs with no subgraph isomorphic to a subdivision of a fixed graph, and graphs that can be drawn in a fixed surface in such a way that each edge crosses at most a constant number of other edges. We deduce that there is an almost linear-time algorithm for deciding FO properties in classes of graphs with locally bounded expansion. More generally, we design a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion. After a linear-time initialization the data structure allows us to test an FO property in constant time, and the data structure can be updated in constant time after addition/deletion of an edge, provided the list of possible edges to be added is known in advance and their simultaneous addition results in a graph in the class. All our results also hold for relational structures and are based on the seminal result of Nesetril and Ossona de Mendez on the existence of low tree-depth colorings

Deciding first-order properties of nowhere dense graphs

Nowhere dense graph classes, introduced by Nesetril and Ossona de Mendez, form a large variety of classes of "sparse graphs" including the class of planar graphs, actually all classes with excluded minors, and also bounded degree graphs and graph classes of bounded expansion. We show that deciding properties of graphs definable in first-order logic is fixed-parameter tractable on nowhere dense graph classes. At least for graph classes closed under taking subgraphs, this result is optimal: it was known before that for all classes C of graphs closed under taking subgraphs, if deciding first-order properties of graphs in C is fixed-parameter tractable, then C must be nowhere dense (under a reasonable complexity theoretic assumption). As a by-product, we give an algorithmic construction of sparse neighbourhood covers for nowhere dense graphs. This extends and improves previous constructions of neighbourhood covers for graph classes with excluded minors. At the same time, our construction is considerably simpler than those. Our proofs are based on a new game-theoretic characterisation of nowhere dense graphs that allows for a recursive version of locality-based algorithms on these classes. On the logical side, we prove a "rank-preserving" version of Gaifman's locality theorem.Comment: 30 page

Testing first-order properties for subclasses of sparse graphs

We present a linear-time algorithm for deciding first-order (FO) properties in classes of graphs with bounded expansion, a notion recently introduced by Nešetřil and Ossona de Mendez. This generalizes several results from the literature, because many natural classes of graphs have bounded expansion: graphs of bounded tree-width, all proper minor-closed classes of graphs, graphs of bounded degree, graphs with no subgraph isomorphic to a subdivision of a fixed graph, and graphs that can be drawn in a fixed surface in such a way that each edge crosses at most a constant number of other edges. We deduce that there is an almost linear-time algorithm for deciding FO properties in classes of graphs with locally bounded expansion. More generally, we design a dynamic data structure for graphs belonging to a fixed class of graphs of bounded expansion. After a linear-time initialization the data structure allows us to test an FO property in constant time, and the data structure can be updated in constant time after addition/deletion of an edge, provided the list of possible edges to be added is known in advance and their simultaneous addition results in a graph in the class. All our results also hold for relational structures and are based on the seminal result of Nešetřil and Ossona de Mendez on the existence of low tree-depth colorings

The Cauchy Operator for Basic Hypergeometric Series

We introduce the Cauchy augmentation operator for basic hypergeometric series. Heine's ${}_2\phi_1$ transformation formula and Sears' ${}_3\phi_2$ transformation formula can be easily obtained by the symmetric property of some parameters in operator identities. The Cauchy operator involves two parameters, and it can be considered as a generalization of the operator $T(bD_q)$. Using this operator, we obtain extensions of the Askey-Wilson integral, the Askey-Roy integral, Sears' two-term summation formula, as well as the $q$-analogues of Barnes' lemmas. Finally, we find that the Cauchy operator is also suitable for the study of the bivariate Rogers-Szeg\"o polynomials, or the continuous big $q$-Hermite polynomials.Comment: 21 pages, to appear in Advances in Applied Mathematic

Knots, BPS states, and algebraic curves

We analyze relations between BPS degeneracies related to Labastida-Marino-Ooguri-Vafa (LMOV) invariants, and algebraic curves associated to knots. We introduce a new class of such curves that we call extremal A-polynomials, discuss their special properties, and determine exact and asymptotic formulas for the corresponding (extremal) BPS degeneracies. These formulas lead to nontrivial integrality statements in number theory, as well as to an improved integrality conjecture stronger than the known M-theory integrality predictions. Furthermore we determine the BPS degeneracies encoded in augmentation polynomials and show their consistency with known colored HOMFLY polynomials. Finally we consider refined BPS degeneracies for knots, determine them from the knowledge of super-A-polynomials, and verify their integrality. We illustrate our results with twist knots, torus knots, and various other knots with up to 10 crossings.Comment: 43 pages, 6 figure

Hypercommutative operad as a homotopy quotient of BV

We give an explicit formula for a quasi-isomorphism between the operads Hycomm (the homology of the moduli space of stable genus 0 curves) and BV/$\Delta$ (the homotopy quotient of Batalin-Vilkovisky operad by the BV-operator). In other words we derive an equivalence of Hycomm-algebras and BV-algebras enhanced with a homotopy that trivializes the BV-operator. These formulas are given in terms of the Givental graphs, and are proved in two different ways. One proof uses the Givental group action, and the other proof goes through a chain of explicit formulas on resolutions of Hycomm and BV. The second approach gives, in particular, a homological explanation of the Givental group action on Hycomm-algebras.Comment: minor corrections added, to appear in Comm.Math.Phy