English
Related papers

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

200 papers

This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMI). Since in some SDP instances all feasible solutions have irrational entries, numerical…

Optimization and Control · Mathematics 2025-04-28 Vladimir Kolmogorov , Simone Naldi , Jeferson Zapata

Finite-density QCD and many other field theories with sign problems have a $\mathcal{PT}$-type symmetry. After a brief introduction to $\mathcal{PT}$-symmetric field theories, a real dual representation for $\mathcal{PT}$-symmetric scalar…

High Energy Physics - Lattice · Physics 2021-10-28 Moses A. Schindler , Stella T. Schindler , Michael C. Ogilvie

Let W be an irreducible, finitely generated Coxeter group. The geometric representation provides an discrete embedding in the orthogonal group of the so-called Tits form. One can look at the representation modulo the kernel of this form; we…

Group Theory · Mathematics 2012-11-27 Yves de Cornulier

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

In this paper we present an invariance proof of three properties on Simpson's 4-slot algorithm, i.e. data-race freedom, data coherence and data freshness, which together implies linearisability of the algorithm. It is an extension of…

Software Engineering · Computer Science 2021-12-14 Xu Wang , Qiwen Xu

It is known that for $\sigma$-compact groups Kazhdan's Property $(T)$ is equivalent to Serre's Property $(FH)$. Generalized versions of those properties, called properties $(T_{B})$ and $(F_{B})$, can be defined in terms of the isometric…

Group Theory · Mathematics 2016-11-18 Alan Czuron

We present a logic that extends CTL (Computation Tree Logic) with operators that express synchronization properties. A property is synchronized in a system if it holds in all paths of a certain length. The new logic is obtained by using the…

Logic in Computer Science · Computer Science 2016-05-25 Krishnendu Chatterjee , Laurent Doyen

Interpolation of jointly infeasible predicates plays important roles in various program verification techniques such as invariant synthesis and CEGAR. Intrigued by the recent result by Dai et al.\ that combines real algebraic geometry and…

Logic in Computer Science · Computer Science 2017-09-04 Takamasa Okudono , Yuki Nishida , Kensuke Kojima , Kohei Suenaga , Kengo Kido , Ichiro Hasuo

We show that property (T) is not profinite, that is, we construct two finitely generated residually finite groups which have isomorphic profinite completions while one admits property (T) and the other does not. This settles a question…

Group Theory · Mathematics 2011-07-25 Menny Aka

This paper addresses the following three topics: positive semidefinite (psd) matrix completions, universal rigidity of frameworks, and the Strong Arnold Property (SAP). We show some strong connections among these topics, using semidefinite…

Optimization and Control · Mathematics 2013-01-29 M. Laurent , A. Varvitsiotis

This paper improves the algorithms based on supporting halfspaces and quadratic programming for convex set intersection problems in our earlier paper in several directions. First, we give conditions so that much smaller quadratic programs…

Optimization and Control · Mathematics 2014-06-17 C. H. Jeffrey Pang

We introduce and study the class of groups graded by root systems. We prove that if {\Phi} is an irreducible classical root system of rank at least 2 and G is a group graded by {\Phi}, then under certain natural conditions on the grading,…

Group Theory · Mathematics 2014-03-12 Mikhail Ershov , Andrei Jaikin-Zapirain , Martin Kassabov

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Logic · Mathematics 2026-01-19 Joey Lakerdas-Gayle

We study the exactness of the semidefinite programming (SDP) relaxation of quadratically constrained quadratic programs (QCQPs). With the aggregate sparsity matrix from the data matrices of a QCQP with $n$ variables, the rank and positive…

Optimization and Control · Mathematics 2020-09-22 Godai Azuma , Mituhiro Fukuda , Sunyoung Kim , Makoto Yamashita

In this paper, we consider the problem of minimizing a general homogeneous quadratic function, subject to three real or four complex homogeneous quadratic inequality or equality constraints. For this problem, we present a sufficient and…

Optimization and Control · Mathematics 2023-04-11 Wenbao Ai , Wei Liang , Jianhua Yuan

Semidefinite programs (SDPs) are a framework for exact or approximate optimization that have widespread application in quantum information theory. We introduce a new method for using reductions to construct integrality gaps for SDPs. These…

Quantum Physics · Physics 2019-03-18 Aram W. Harrow , Anand Natarajan , Xiaodi Wu

Geometry of buildings is used to prove some homological properties of the category of smooth representations of a reductive p-adic group (Kazhdan's "pairing conjecture", Bernstein's description of homological duality in terms of…

Representation Theory · Mathematics 2007-05-23 Roman Bezrukavnikov

Let p be a real number with 1<p and different from 2. We study Property (T_lp) for a second countable locally compact group G. Property (T_lp) is a weak version of Kazhdan's Property (T), defined in terms of the orthogonal representations…

Group Theory · Mathematics 2015-02-04 Bachir Bekka , Baptiste Olivier

We describe a correspondence (or duality) between the q-characters of finite-dimensional representations of a quantum affine algebra and its Langlands dual in the spirit of q-alg/9708006 and 0809.4453. We prove this duality for the…

Quantum Algebra · Mathematics 2011-04-20 Edward Frenkel , David Hernandez

Guarded Kleene Algebra with Tests (GKAT) is an efficient fragment of KAT, as it allows for almost linear decidability of equivalence. In this paper, we study the (co)algebraic properties of GKAT. Our initial focus is on the fragment that…

Logic in Computer Science · Computer Science 2023-02-03 Todd Schmid , Tobias Kappé , Dexter Kozen , Alexandra Silva