Related papers: Computer proofs for Property (T), and SDP duality
Let $A$ be a unital separable simple amenable $C^*$-algebra with finite tracial rank which satisfies the Universal Coefficient Theorem (UCT). Suppose $\af$ and $\bt$ are two automorphisms with the Rokhlin property that {induce the same…
A notion of dual curve for pseudoholomorphic curves in 4--manifolds turns out to be possible only if the notion of almost complex structure structure is slightly generalized. The resulting structure is as easy (perhaps easier) to work with,…
We consider tensor products of finite-dimensional representations of a coideal subalgebra in $U_{q}(\mathfrak{sl}_2)$. We present an explicit expression for the dual of the canonical bases through a diagrammatic presentation. We show that…
Pseudo-automorphisms are birational transformations acting as regular automorphisms in codimension 1. We import ideas from geometric group theory to prove that a group of birational transformations that satisfies a fixed point property on…
We show {\it semidefinite programming} (SDP) feasibility problem is equivalent to solving a {\it convex hull relaxation} (CHR) for a finite system of quadratic equations. On the one hand, this offers a simple description of SDP. On the…
As a strengthening of Kazhdan's property (T) for locally compact groups, property (TT) was introduced by Burger and Monod. In this paper, we add more rigidity and introduce property (TTT). This property is suited for the study of rigidity…
We prove a uniqueness result for finite-dimensional representations of the Kauffman skein algebra $\mathcal{S}_A(S)$ of a surface $S$, when $A$ is a root of unity and when the surface $S$ is a sphere with at most four punctures or a torus…
For any topological group $G$ the dual object $\hat G$ is defined as the set of equivalence classes of irreducible unitary representations of $G$ equipped with the Fell topology. If $G$ is compact, $\hat G$ is discrete, and we investigate…
A flag of codes $C_0 \subsetneq C_1 \subsetneq \cdots \subsetneq C_s \subseteq {\mathbb F}_q^n$ is said to satisfy the {\it isometry-dual property} if there exists ${\bf x}\in (\mathbb{F}_q^*)^n$ such that the code $C_i$ is {\bf…
We establish a new spectral criterion for Kazhdan's property $(T)$ which is applicable to a large class of discrete groups defined by generators and relations. As the main application, we prove property $(T)$ for the groups $EL_n(R)$, where…
The main outcomes of the paper are divided into two parts. First, we present a new dual for quadratic programs, in which, the dual variables are affine functions, and we prove strong duality. Since the new dual is intractable, we consider a…
Computer programs may go wrong due to exceptional behaviors, out-of-bound array accesses, or simply coding errors. Thus, they cannot be blindly trusted. Scientific computing programs make no exception in that respect, and even bring…
The aim of this partly expository paper is to present and discuss two classes of sets of integers (Jamison and Kazhdan sets) whose definition and/or properties are determined or inspired by operator-theoretical properties. Jamison sets…
Total dual integrality is a powerful and unifying concept in polyhedral combinatorics and integer programming that enables the refinement of geometric min-max relations given by linear programming Strong Duality into combinatorial min-max…
Quadratically constrained quadratic programs (QCQPs) are a highly expressive class of nonconvex optimization problems. While QCQPs are NP-hard in general, they admit a natural convex relaxation via the standard (Shor) semidefinite program…
We describe the self-duality symmetries for 4d Maxwell theory at any value of the coupling $\tau$ via topological manipulations that include gauging continuous symmetries with flat connections. Moreover, we demonstrate that the…
The paper considers pseudo-differential boundary value control systems. The underlying operators form an algebra D with the help of which we are able to formulate typical boundary value control problems. The symbolic calculus gives tools to…
This short expository paper outlines applications of computer algebra to the implication problem of conditional independence for Gaussian random variables. We touch on certificates for validity and invalidity of inference rules from the…
Satisfiability Modulo Theories (SMT) and SAT solvers are critical components in many formal software tools, primarily due to the fact that they are able to easily solve logical problem instances with millions of variables and clauses. This…
We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…