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

In the classic "Concrete Math", by Graham, Patashnik and Knuth, it is stated that "The numbers in Pascal's triangle satisfy, practically speaking, infinitely many identities, so it is not too surprising that we can find some surprising…

The study of the interplay between the testability of properties of Boolean functions and the invariances acting on their domain which preserve the property was initiated by Kaufman and Sudan (STOC 2008). Invariance with respect to…

Converse PDL is the extension of propositional dynamic logic with a converse operation on programs. Our main result states that Converse PDL enjoys the (local) Craig Interpolation Property, with respect to both atomic programs and…

We prove a Poincar\'e duality for arithmetic $p$-adic pro-\'etale cohomology of smooth dagger curves over finite extensions of ${\mathbf Q}_p$. We deduce it, via the Hochschild-Serre spectral sequence, from geometric comparison theorems…

Constraint satisfaction (CSP) and structure isomorphism (SI) are among the most well-studied computational problems in Computer Science. While neither problem is thought to be in $\texttt{PTIME},$ much work is done on $\texttt{PTIME}$…

Proof by coupling is a classical technique for proving properties about pairs of randomized algorithms by carefully relating (or coupling) two probabilistic executions. In this paper, we show how to automatically construct such proofs for…

This paper develops a duality theory for connected cochain DG algebras, with particular emphasis on the non-commutative aspects. One of the main items is a dualizing DG module which induces a duality between the derived categories of DG…

We give a complete proof of the twisted duality property M(q)'= Z M(q^\perp) Z* of the (self-dual) CAR-Algebra in any Fock representation. The proof is based on the natural Halmos decomposition of the (reference) Hilbert space when two…

We review the close relationship between abstract machines for (call-by-name or call-by-value) lambda-calculi (extended with Felleisen's C) and sequent calculus, reintroducing on the way Curien-Herbelin's syntactic kit expressing the…

We prove coherence theorems for dualizable objects in monoidal bicategories and for fully dualizable objects in symmetric monoidal bicategories, describing coherent dual pairs and coherent fully dual pairs. These are property-like…

We study two cases of interrelations between enhancement of symmetries in the infra red (IR) and duality properties of supersymmetric quantum field theories in four dimensions. First we discuss an SU(2) N=1 model with four flavors, singlet…

Thirty years ago, in a seminal paper Ramana derived an exact dual for Semidefinite Programming (SDP). Ramana's dual has the following remarkable features: i) it is an explicit, polynomial size semidefinite program ii) it does not assume…

This paper presents a comprehensive exploration of semi-definite programming (SDP) techniques within the context of quantum information. It examines the mathematical foundations of convex optimization, duality, and SDP formulations,…

We investigate the problem of safety verification of infinite-state parameterized programs that are formed based on a rich class of topologies. We introduce a new proof system, called parametric proof spaces, which exploits the underlying…

Semidefinite programs (SDP) are one of the most versatile frameworks in numerical optimization, serving as generalizations of many conic programs and as relaxations of NP-hard combinatorial problems. Their main drawback is their…

We present a new proof of Stembridge's theorem about the enumeration of totally symmetric plane partitions using the methodology suggested in the recent Koutschan-Kauers-Zeilberger semi-rigorous proof of the Andrews-Robbins q-TSPP…

We show that if $T$ is any of four semigroups of two elements that are not groups, there exists a finite dimensional associative $T$-graded algebra over a field of characteristic $0$ such that the codimensions of its graded polynomial…

The notion of strong 1-boundedness for finite von Neumann algebras was introduced by Jung in arXiv:math/0510576 . This framework provided a free probabilistic approach to study rigidity properties and classification of finite von Neumann…

The paper studies computability-theoretic aspects of topological $T_0$-spaces. We introduce effective versions of the notions of a countable $c$-poset and a (second-countable) topological space with base. Based on this, we prove an…

We provide a detailed study of two properties of spaces and pairs of spaces, the surjection property and the epsilon-surjection property, that were recently introduced to characterize the notion of computable type arising from computability…