Related papers: Computer proofs for Property (T), and SDP duality
We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…
We prove that cocompact (and more generally: undistorted) lattices on $\tilde{A}_2$-buildings satisfy Lafforgue's strong property (T), thus exhibiting the first examples that are not related to algebraic groups over local fields. Our…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
Consider a convex set S defined by a matrix inequality of polynomials or rational functions over a domain. The set S is called semidefinite programming (SDP) representable or just semidefinite representable if it equals the projection of a…
World-sheet and spacetime supersymmetries that are manifest in some string backgrounds may not be so in their T-duals. Nevertheless, they always remain symmetries of the underlying conformal field theory. In previous work the mechanism by…
For a locally convex $^*$-algebra $A$ equipped with a fixed continuous $^*$-character $\varepsilon$, we define a cohomological property, called property $(FH)$, which is similar to character amenability. Let $C_c(G)$ be the space of…
In this paper, we present sufficient conditions ensuring that the sum of the image of quadratic functions and the nonnegative orthant is convex. The hidden convexity of the trust-region problem with linear inequality constraints is…
We give the mathematical theory of duality computer in the density matrix formalism. This result complements the mathematical theory of duality computer of Gudder in the pure state formalism.
This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…
We present a tool for verification of deterministic programs with shared mutable references against specifications such as assertions, preconditions, postconditions, and read/write effects. We implement our tool by encoding programs with…
Tsetlin Machines (TsMs) are a promising and interpretable machine learning method which can be applied for various classification tasks. We present an exact encoding of TsMs into propositional logic and formally verify properties of TsMs…
Semi-infinite cohomology is constructed from scratch as the proper generalization of finite dimensional Lie algebra cohomology. The differential d and other operators are realized as universal inner deri- vations of a completed algebra,…
Semidefinite programs (SDPs) are a class of optimisation problems that find application in numerous areas of physics, engineering and mathematics. Semidefinite programming is particularly suited to problems in quantum physics and quantum…
A machine developed by the second author produces a rich family of unitary representations of the Thompson groups F,T and V. We use it to give direct proofs of two previously known results. First, we exhibit a unitary representation of V…
The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…
The facial reduction algorithm of Borwein and Wolkowicz and the extended dual of Ramana provide a strong dual for the conic linear program $$ (P) \sup {<c, x> | Ax \leq_K b} $$ in the absence of any constraint qualification. The facial…
A weakly infeasible semidefinite program (SDP) has no feasible solution, but it has approximate solutions whose constraint violation is arbitrarily small. These SDPs are ill-posed and numerically often unsolvable. They are also closely…
We prove coherence theorems for bicategories, pseudofunctors and pseudonatural transformations. These theorems boil down to proving the coherence of some free $(4,2)$-categories. In the case of bicategories and pseudofunctors, existing…
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witnesses for LTL verification over imperative programs. Our…
Let G be a topological group such that its homology H(G) with coefficients in a principal ideal domain R is an exterior algebra, generated in odd degrees. We show that the singular cochain functor carries the duality between G-spaces and…