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

We introduce a notion of signature whose sorts form a direct category, and study computads for such signatures. Algebras for such a signature are presheaves with an interpretation of every function symbol of the signature, and we describe…

We present a property satisfied by a large variety of complex continued fraction algorithms (the "finite building property") and use it to explore the structure of bijectivity domains for natural extensions of Gauss maps. Specifically, we…

Let $X$ be a smooth proper scheme over an algebraically closed field $k$ in characteristic $p$. In this short note, by interpreting $\mathcal{D}_{X}$-modules as $F$-divided sheaves and establishing a cohomological boundedness property for…

In this paper we propose a physical derivation of a 4d conjectural duality for $USp(2N)$ with an anti-symmetric rank-two tensor and fundamental flavors, in presence of a non-trivial superpotential. This duality has been conjectured as a…

For a coherent filtered D-module we show that the dual of each graded piece over the structure sheaf is isomorphic to a certain graded piece of the ring-theoretic local cohomology complex of the graded quotient of the dual of the filtered…

Lind and Schmidt have shown that the homoclinic group of a cyclic $\Z^k$ algebraic dynamical system is isomorphic to the dual of the phase group. We show that this duality result is part of an exact sequence if $k=1$. The exact sequence is…

We suggest a new duality between a pair of 3d N = 5 SCFTs, one of ABJ type and one based on the exceptional superalgebra F (4). Our main evidence for the proposed duality is the matching of the superconformal index. In addition to the…

We show that all groups of a distinguished class of \guillemotleft large\guillemotright\ topological groups, that of Roelcke precompact Polish groups, have Kazhdan's Property (T). This answers a question of Tsankov and generalizes previous…

Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

An equivalence between attainability of simultaneous diagonalization (SD) and hidden convexity in quadratically constrained quadratic programming (QCQP) stimulates us to investigate necessary and sufficient SD conditions, which is one of…

If K is a number field, arithmetic duality theorems for tori and complexes of tori over K are crucial to understand local-global principles for linear algebraic groups over K. When K is a global field of positive characteristic, we prove…

Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…

Let A and B be finite dimensional simple real algebras with division gradings by an abelian group G. In this paper we give necessary and sufficient conditions for the coincidence of the graded identities of A and B. We also prove that every…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

In this paper, we will give a thorough study of the notion of Property $(T)$ for $C^*$-algebras (as introduced by M.B. Bekka in \cite{Bek-T}) as well as a slight stronger version of it, called "strong property $(T)$" (which is also an…

Let $F$ be a $p$-adic field, and let $G$ be either the split special orthogonal group $\mathrm{SO}_{2n+1}(F)$ or the symplectic group $\mathrm{Sp}_{2n}(F)$, with $n \geq 0$. We prove that a smooth irreducible representation of good parity…

A $(v, k, \lambda)$ symmetric design is said to have the symmetric difference property (SDP) if the symmetric difference of any three blocks is either a block or the complement of a block. Symmetric designs fulfilling this property have the…

Many computer vision problems can be formulated as binary quadratic programs (BQPs). Two classic relaxation methods are widely used for solving BQPs, namely, spectral methods and semidefinite programming (SDP), each with their own…

In a previous paper we showed how the main theorems characterizing operator algebras and operator modules, fit neatly into the framework of the `noncommutative Shilov boundary', and more particularly via the left multiplier operator algebra…