Related papers: Computer proofs for Property (T), and SDP duality
We introduce the spatial Rokhlin property for actions of coexact compact quantum groups on $\mathrm{C}^*$-algebras, generalizing the Rokhlin property for both actions of classical compact groups and finite quantum groups. Two key…
We review the algebraic approach to super non-Abelian T-Duality considered in [1], focusing on symmetric and semi-symmetric coset spaces on $G/H$. We discuss a potential impediment, appearing in these models when integrating out the gauge…
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems well-known to be NP-hard in general. In this paper we study sufficient conditions for a convex hull result that immediately implies that…
We study the behavior of the Etingof-Kazhdan quantization functors under the natural duality operations of Lie bialgebras and Hopf algebras. In particular, we prove that these functors are "compatible with duality", i.e., they commute with…
We address the problem of verifying k-safety properties: properties that refer to k-interacting executions of a program. A prominent way to verify k-safety properties is by self composition. In this approach, the problem of checking…
We study 3d $\mathcal{N}=2$ SQCD with symplectic and orthogonal gauge groups and adjoint matter. For $USp(2n)$ with two fundamentals and $SO(N)$ with one vector these models have been recently shown to s-confine. Here we corroborate the…
We reformulate and extend the geometric method for proving Kazhdan property T developed by Dymara and Januszkiewicz and used by Ershov and Jaikin. The main result says that a group G, generated by finite subgroups G_i, has property T if the…
Utilizing the notion of property (T) we construct new examples of quantum group norms on the polynomial algebra of a compact quantum group, and provide criteria ensuring that these are not equal to neither the minimal nor the maximal norm.…
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced…
We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n),…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
We show that the dual to any subspace of $c_0(\Gamma)$ has the strongest possible quantitative version of the Schur property. Further, we establish relationship between the quantitative Schur property and quantitative versions of the…
We characterize the SDP designs that give rise to four-weight spin models with two values. We prove that the only such designs are the symplectic SDP designs. The proof involves analysis of cardinalities of intersections of four blocks.
Symmetric extensions are essential in quantum mechanics, providing a lens to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a…
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, {\delta})\!)_2$…
Using a recent classification of $\operatorname{End}(\mathcal{D}(G))$, we determine a number of properties for $\operatorname{Aut}(\mathcal{D}(G))$, where $\mathcal{D}(G)$ is the Drinfel'd double of a finite group $G$. Furthermore, we…
We present a new duality between the F-terms of supersymmetric field theories defined in two- and four-dimensions respectively. The duality relates N=2 supersymmetric gauge theories in four dimensions, deformed by an Omega-background in one…
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…
Interpolation based software model checkers have been successfully employed to automatically prove programs correct. Their power comes from interpolating SMT solvers that check the feasibility of potential counterexamples and compute…
We describe an essential improvement of our recent algorithm for computing cohomology of Lie (super)algebra based on partition of the whole cochain complex into minimal subcomplexes. We replace the arithmetic of rational numbers or integers…