Definability equals recognizability for graphs of bounded treewidth

We prove a conjecture of Courcelle, which states that a graph property is definable in MSO with modular counting predicates on graphs of constant treewidth if, and only if it is recognizable in the following sense: constant-width tree decompositions of graphs satisfying the property can be recognized by tree automata. While the forward implication is a classic fact known as Courcelle's theorem, the converse direction remained openComment: 21 pages, an extended abstract will appear in the proceedings of LICS 201

Shapley Meets Shapley

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a coalition of vertices is the weight of the maximum size matching in the subgraph induced by the coalition. The Shapley value is one of the most important solution concepts in cooperative game theory. After establishing some general insights, we show that the Shapley value of matching games can be computed in polynomial time for some special cases: graphs with maximum degree two, and graphs that have a small modular decomposition into cliques or cocliques (complete k-partite graphs are a notable special case of this). The latter result extends to various other well-known classes of graph-based cooperative games. We continue by showing that computing the Shapley value of unweighted matching games is #P-complete in general. Finally, a fully polynomial-time randomized approximation scheme (FPRAS) is presented. This FPRAS can be considered the best positive result conceivable, in view of the #P-completeness result.Comment: 17 page

Three-dimensional simplicial gravity and combinatorics of group presentations

We demonstrate how some problems arising in simplicial quantum gravity can be successfully addressed within the framework of combinatorial group theory. In particular, we argue that the number of simplicial 3-manifolds having a fixed homology type grows exponentially with the number of tetrahedra they are made of. We propose a model of 3D gravity interacting with scalar fermions, some restriction of which gives the 2-dimensional self-avoiding-loop-gas matrix model. We propose a qualitative picture of the phase structure of 3D simplicial gravity compatible with the numerical experiments and available analytical results.Comment: 24 page

On the Euler characteristic of Kronecker moduli spaces

Combining the MPS degeneration formula for the Poincar\'e polynomial of moduli spaces of stable quiver representations and localization theory, it turns that the determination of the Euler characteristic of these moduli spaces reduces to a combinatorial problem of counting certain trees. We use this fact in order to obtain an upper bound for the Euler characteristic in the case of the Kronecker quiver. We also derive a formula for the Euler characteristic of some of the moduli spaces appearing in the MPS degeneration formula.Comment: 15 page