Stronger ILPs for the Graph Genus Problem

The minimum genus of a graph is an important question in graph theory and a key ingredient in several graph algorithms. However, its computation is NP-hard and turns out to be hard even in practice. Only recently, the first non-trivial approach - based on SAT and ILP (integer linear programming) models - has been presented, but it is unable to successfully tackle graphs of genus larger than 1 in practice. Herein, we show how to improve the ILP formulation. The crucial ingredients are two-fold. First, we show that instead of modeling rotation schemes explicitly, it suffices to optimize over partitions of the (bidirected) arc set A of the graph. Second, we exploit the cycle structure of the graph, explicitly mapping short closed walks on A to faces in the embedding. Besides the theoretical advantages of our models, we show their practical strength by a thorough experimental evaluation. Contrary to the previous approach, we are able to quickly solve many instances of genus > 1

RAAGs in Ham

We prove that every RAAG (a Right-Angled Artin Group) embeds in the group of Hamiltonian symplectomorphisms of the 2-sphere.Comment: 23 pages, 2 figure

Group Field Theory: An overview

We give a brief overview of the properties of a higher dimensional generalization of matrix model which arises naturally in the context of a background independent approach to quantum gravity, the so called group field theory. We show that this theory leads to a natural proposal for the physical scalar product of quantum gravity. We also show in which sense this theory provides a third quantization point of view on quantum gravity.Comment: 10 page

Dynamic Programming for Graphs on Surfaces

We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique applies to general families of problems where standard dynamic programming runs in 2^{O(k log k)} n steps. Our approach combines tools from topological graph theory and analytic combinatorics. In particular, we introduce a new type of branch decomposition called "surface cut decomposition", generalizing sphere cut decompositions of planar graphs introduced by Seymour and Thomas, which has nice combinatorial properties. Namely, the number of partial solutions that can be arranged on a surface cut decomposition can be upper-bounded by the number of non-crossing partitions on surfaces with boundary. It follows that partial solutions can be represented by a single-exponential (in the branchwidth k) number of configurations. This proves that, when applied on surface cut decompositions, dynamic programming runs in 2^{O(k)} n steps. That way, we considerably extend the class of problems that can be solved in running times with a single-exponential dependence on branchwidth and unify/improve most previous results in this direction.Comment: 28 pages, 3 figure

An extensive English language bibliography on graph theory and its applications, supplement 1

Graph theory and its applications - bibliography, supplement

The microscopic dynamics of quantum space as a group field theory

We provide a rather extended introduction to the group field theory approach to quantum gravity, and the main ideas behind it. We present in some detail the GFT quantization of 3d Riemannian gravity, and discuss briefly the current status of the 4-dimensional extensions of this construction. We also briefly report on recent results obtained in this approach and related open issues, concerning both the mathematical definition of GFT models, and possible avenues towards extracting interesting physics from them.Comment: 60 pages. Extensively revised version of the contribution to "Foundations of Space and Time: Reflections on Quantum Gravity", edited by G. Ellis, J. Murugan, A. Weltman, published by Cambridge University Pres

Bihamiltonian Hierarchies in 2D Topological Field Theory At One-Loop Approximation

We compute the genus one correction to the integrable hierarchy describing coupling to gravity of a 2D topological field theory. The bihamiltonian structure of the hierarchy is given by a classical W-algebra; we compute the central charge of this algebra. We also express the generating function of elliptic Gromov - Witten invariants via tau-function of the isomonodromy deformation problem arising in the theory of WDVV equations of associativity.Comment: 53 pages, Latex, two references added, some typos corrected, version to appear in Commun. Math. Phy