Related papers: Computer proofs for Property (T), and SDP duality

A Datalog program solves a constraint satisfaction problem (CSP) if and only if it derives the goal predicate precisely on the unsatisfiable instances of the CSP. There are three Datalog fragments that are particularly important for…

We study robust convex quadratic programs where the uncertain problem parameters can contain both continuous and integer components. Under the natural boundedness assumption on the uncertainty set, we show that the generic problems are…

Using the superfield formalism and the master action approach, we prove, both at the classical and quantum levels, the dual equivalence between four-dimensional supersymmetric self-dual and topologically massive models coupled to dynamical…

Let $\textbf{SU}$ be the superintuitionistic logic defined by the axiom $\boldsymbol{su} = ((\neg p\to q)\land(\neg q\to p) \rightarrow r \vee s) \to ( p \rightarrow r) \vee(q \rightarrow s)$, or equivalently, by Andrew's axiom. It is easy…

We generalise the analysis in [arXiv:0904.1744] to superspace, and explicitly prove that for any embedding of surface operators in a general, twisted N=2 pure abelian theory on an arbitrary four-manifold, the parameters transform naturally…

This article is to give an infinite dimensional analogue of a result of Choi and Effros. We say that an (not necessarily unital) operator system $T$ is \emph{dualizable} if one can find an equivalent dual matrix norm on the dual space $T^*$…

In conic linear programming -- in contrast to linear programming -- the Lagrange dual is not an exact dual: it may not attain its optimal value, or there may be a positive duality gap. The corresponding Farkas' lemma is also not exact (it…

A resolution of the identity due to canonical coherent states is often proven in the weak operator topology. However, such a resolution with an integral symbol is typically supposed to hold in the strong operator topology associated with…

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

We analyze self-dual polyhedral cones and prove several properties about their slack matrices. In particular, we show that self-duality is equivalent to the existence of a positive semidefinite (PSD) slack. Beyond that, we show that if the…

Let $K$ be a finite extension of $\mathbb{Q}_p$. We prove that the arithmetic $p$-adic pro-\'etale cohomology of smooth partially proper spaces over $K$ satisfies a duality, as conjectured by Colmez, Gilles and Nizio{\l}. We derive it from…

In this paper we study various convolution-type algebras associated with a locally compact quantum group from cohomological and geometrical points of view. The quantum group duality endows the space of trace class operators over a locally…

This article generalizes two approaches for property (T) - the first is a generalization of Zuk's criterion for property (T) and the second is a generalization of the work of Kassabov regarding property (T) and subspace arrangements. In…

We define and study the notion of property $(\rm T)$ for Banach algebras, generalizing the one from $C^*$-algebras. For a second countable locally compact group $G$ and a given family of Banach spaces $\mathcal E$, we prove that our Banach…

The goal of this paper is to give a group-theoretic proof of the congruence subgroup property for $Aut(F_2)$, the group of automorphisms of a free group on two generators. This result was first proved by Asada using techniques from…

We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We introduce the…

This paper describes a formalization of discrete real closed fields in the Coq proof assistant. This abstract structure captures for instance the theory of real algebraic numbers, a decidable subset of real numbers with good algorithmic…

Design verification is a complex and costly task, especially for large and intricate processor projects. Formal verification techniques provide advantages by thoroughly examining design behaviors, but they require extensive labor and…

We discuss proving correctness and completeness of definite clause logic programs. We propose a method for proving completeness, while for proving correctness we employ a method which should be well known but is often neglected. Also, we…

This text collects useful results concerning the quasi-Hopf algebra $\D $. We give a review of issues related to its use in conformal theories and physical mathematics. Existence of such algebras based on 3-cocycles with values in $ {R} /…