Related papers: Hardness of monadic second-order formulae over suc…
We present a general analysis of all the possible soft breakings of N=2 supersymmetric QCD, preserving the analytic properties of the Seiberg-Witten solutions for the SU(2) group with Nf=1, 2, 3 hypermultiplets. We obtain all the couplings…
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems (nowadays usually called Boolean constraint satisfaction problems) and…
We present a pedagogical discussion of the emergence of gauged supergravities from M-theory. First, a review of maximal supergravity and its global symmetries and supersymmetric solutions is given. Next, different procedures of dimensional…
We develop a new theory of strong subalgebras and linear congruences that are defined globally. Using this theory we provide a new proof of the correctness of Zhuk's algorithm for all tractable CSPs on a finite domain, and therefore a new…
Query evaluation over probabilistic databases is known to be intractable in many cases, even in data complexity, i.e., when the query is fixed. Although some restrictions of the queries [19] and instances [4] have been proposed to lower the…
We study W-algebras obtained by quantum Hamiltonian reduction of $sl(Mn)$ associated to the $sl(2)$ embedding of rectangular type. The algebra can be realized as the asymptotic symmetry of higher spin gravity with $M \times M$ matrix valued…
We present an algorithm for strongly refuting smoothed instances of all Boolean CSPs. The smoothed model is a hybrid between worst and average-case input models, where the input is an arbitrary instance of the CSP with only the negation…
Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…
We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either conflicts or query solutions. Considering a monotonic query…
A propositional logic sentence in conjunctive normal form that has clauses of length two (a 2-CNF) can be associated with a multigraph in which the vertices correspond to the variables and edges to clauses. We first show that every such…
We characterise the sentences in Monadic Second-order Logic (MSO) that are over finite structures equivalent to a Datalog program, in terms of an existential pebble game. We also show that for every class C of finite structures that can be…
In addition to superconformal symmetry, (1,1) supersymmetric two-dimensional sigma models on special holonomy manifolds have extra symmetries that are in one-to-one correspondence with the covariantly constant forms on these manifolds. The…
This paper studies the logical properties of a very general class of infinite ranked trees, namely those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal mu-calculus, three main…
The role of polymorphisms in determining the complexity of constraint satisfaction problems is well established. In this context we study the stability of CSP complexity and polymorphism properties under some basic graph theoretic…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
The sparsity order of a (simple undirected) graph is the highest possible rank (over ${\mathbb R}$ or ${\mathbb C}$) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the…
We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…
The structure of classical non-linear $\cw$ algebras closing on rational functions is analyzed both for the ordinary and the supersymmetric case. Such algebras appear as a result of a coset construction. Their relevance to physical…
We consider mappings between Carnot groups. In this paper, which is a continuation of "Pansu pullback and rigidity of mappings between Carnot groups" (arXiv:2004.09271), we focus on Carnot groups which are nonrigid in the sense of…
We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…