Related papers: Hardness of monadic second-order formulae over suc…

Breaking of equivalence between the microcanonical ensemble and the canonical ensemble, describing a large system subject to hard and soft constraints, respectively, was recently shown to occur in large random graphs. Hard constraints must…

We study the dynamics of a N=2 supersymmetric SU(N) gauge theory with fundamental or adjoint matter in presence of a non trivial Omega-background along a two dimensional plane. The prepotential and chiral correlators of the gauge theory can…

We define sets of coulourings of the infinite discrete plane using monadic second order (MSO) formulas. We determine the complexity of deciding whether such a formula defines a subshift, parametrized on the quantifier alternation complexity…

We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open problem in NP-completeness. We present a number of new polynomial…

This paper studies Schauder theory to transmission problems modelled by fully nonlinear uniformly elliptic equations of second order. We focus on operators F that fails to be concave or convex in the space of symmetric matrices. In a first…

Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…

We discuss $SU(N_c)$ gauge theory coupled to two adjoint chiral superfields $X$ and $Y$, and a number of fundamental chiral superfields $Q^i$. We add a superpotential that has the form of Arnold's $D$ series $W = \Tr X^{k+1} + \Tr XY^2$. We…

Some mysterious features of the strong interactions become easily understood if our usual QCD with N=3 is `close to' SU(oo) and if the latter theory is confining. N=oo theories are theoretically simpler; in particular there has been much…

Fagin defined the class $NP$ by the means of Existential Second-Order logic. Feder and Vardi expressed it (up to polynomial equivalence) by special fragments of Existential Second-Order logic (SNP), while the authors used forbidden expanded…

This paper presents the following results on sets that are complete for NP. 1. If there is a problem in NP that requires exponential time at almost all lengths, then every many-one NP-complete set is complete under length-increasing…

The Metric Dimension problem asks for a minimum-sized resolving set in a given (unweighted, undirected) graph $G$. Here, a set $S \subseteq V(G)$ is resolving if no two distinct vertices of $G$ have the same distance vector to $S$. The…

The symmetries of asymptotically flat spacetimes impose constraints on observables at infinity. The consequences of this have been extensively explored for S-matrix elements, where soft theorems are known to be equivalent to Ward identities…

By reducing a split $G_2$ Kac-Moody algebra by a non-maximal set of first-class constraints we produce W-algebras which (i) contain fields of negative conformal spin and (ii) are not trivial extensions of canonical W-algebras.

Let $\mathcal G$ be an addable, minor-closed class of graphs. We prove that the zero-one law holds in monadic second-order logic (MSO) for the random graph drawn uniformly at random from all {\em connected} graphs in $\mathcal G$ on $n$…

We introduce a notion of Q-algebra that can be considered as a generalization of the notion of Q-manifold (a supermanifold equipped with an odd vector field obeying {Q,Q} =0). We develop the theory of connections on modules over Q-algebras…

In this paper we show that Atkin and Swinnerton-Dyer type of congruences hold for weakly modular forms (modular forms that are permitted to have poles at cusps). Unlike the case of original congruences for cusp forms, these congruences are…

A rough structure theorem is proved for graphs $G$ containing no copy of a bounded degree tree $T$: from any such $G$, one can delete $o(|G||T|)$ edges in order to get a subgraph all of whose connected components have a cover of order…

We study the way in which the abstract structure of a small overlap monoid is reflected in, and may be algorithmically deduced from, a small overlap presentation. We show that every C(2) monoid admits an essentially canonical C(2)…

Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…

Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…