English
Related papers

Related papers: Weak Paveability and the Kadison-Singer Problem

200 papers

In these notes we develop a link between the Kadison-Singer problem and questions about certain dynamical systems. We conjecture that whether or not a given state has a unique extension is related to certain dynamical properties of the…

Operator Algebras · Mathematics 2007-11-15 Vern I. Paulsen

We study the following $\mathsf{KS}_2(c)$ problem: let $c \in\mathbb{R}^+$ be some constant, and $v_1,\ldots, v_m\in\mathbb{R}^d$ be vectors such that $\|v_i\|^2\leq \alpha$ for any $i\in[m]$ and $\sum_{i=1}^m \langle v_i, x\rangle^2 =1$…

Computational Complexity · Computer Science 2022-11-04 Ben Jourdan , Peter Macgregor , He Sun

One of the equivalent formulations of the Kadison-Singer problem which was resolved in 2013 by Marcus, Spielman and Srivastava, is the "paving conjecture". Roughly speaking, the paving conjecture states that every positive semi-definite…

Probability · Mathematics 2021-01-08 Kasra Alishahi , Milad Barzegar

We adapt the arguments of Marcus, Spielman and Srivastava in their proof of the Kadison-Singer problem to prove improved paving estimates. Working with Anderson's paving formulation of Kadison-Singer instead of Weaver's vector balancing…

Functional Analysis · Mathematics 2018-11-05 Jonathan Leake , Mohan Ravichandran

Let $M_n$ denote the algebra of complex $n\times n $ matrices and write $M$ for the direct sum of the $M_n$. So a typical element of $M$ has the form \[x = x_1\oplus x_2 \... \oplus x_n \oplus \...,\] where $x_n \in M_n$ and $\|x\| =…

Operator Algebras · Mathematics 2010-09-14 Charles Akemann , Joel Anderson , Betul Tanbay

We use the method of interlacing families of polynomials introduced to prove two theorems known to imply a positive solution to the Kadison--Singer problem. The first is Weaver's conjecture $KS_{2}$ \cite{weaver}, which is known to imply…

Combinatorics · Mathematics 2014-04-15 Adam Marcus , Daniel A Spielman , Nikhil Srivastava

Marcus, Spielman and Srivastava (Annals of Mathematics 2014) solved the Kadison--Singer Problem by proving a strong form of Weaver's conjecture: they showed that for all $\alpha > 0$ and all lists of vectors of norm at most $\sqrt{\alpha}$…

Computational Complexity · Computer Science 2022-05-04 Daniel A. Spielman , Peng Zhang

This paper concerns the McKean-Vlasov stochastic differential equation (SDE) with common noise. An appropriate definition of a weak solution to such an equation is developed. The importance of the notion of compatibility in this definition…

Probability · Mathematics 2020-06-29 William R. P. Hammersley , David Šiška , Łukasz Szpruch

Kadison--Schwarz (KS) maps form a natural class of positive linear maps lying strictly between positivity and complete positivity. Despite their relevance in operator algebras and quantum dynamics, explicit analytic sufficient conditions…

Quantum Physics · Physics 2026-03-04 Adam Rutkowski

Akemann and Weaver (2014) have shown a remarkable extension of Weaver's $KS_r$ Conjecture (2004) in the form of approximate Lyapunov's theorem. This was made possible thanks to the breakthrough solution of the Kadison-Singer problem by…

Functional Analysis · Mathematics 2018-02-02 Marcin Bownik

We show that groups with a mild form of non-positive curvature (a navigable path system) satisfy the weak rank rigidity conjecture: they either have linear divergence or a Morse element. This class includes discrete groups of projective…

Group Theory · Mathematics 2026-05-29 Cornelia Drutu , Davide Spriano , Stefanie Zbinden

Anderson's paving conjectures are known to be equivalent to the Kadison-Singer problem. We prove some new equivalences of Anderson's conjectures that require the paving of smaller sets of matrices. We prove that if the strictly upper…

Operator Algebras · Mathematics 2007-11-15 Vern I. Paulsen , Mrinal Raghupathi

A weak formulation is devised for the K(m,n) equation which is a nonlinearly dispersive generalization of the gKdV equation having compacton solutions. With this formulation, explicit weak compacton solutions are derived, including ones…

Mathematical Physics · Physics 2025-02-06 Stephen C. Anco , Maria Gandarias

We consider a paving property for a maximal abelian *-subalgebra (MASA) $A$ in a von Neumann algebra $M$, that we call so-paving, involving approximation in the so-topology, rather than in norm (as in classical Kadison-Singer paving). If…

Operator Algebras · Mathematics 2016-01-20 Sorin Popa , Stefaan Vaes

We develop a "weak Wa\.zewski principle" for discrete and continuous time dynamical systems on metric spaces having a weaker topology to show that attractors can be continued in a weak sense. After showing that the Wasserstein space of a…

Dynamical Systems · Mathematics 2011-03-18 Martin Kell

We introduce a new extragradient iterative process, motivated and inspired by [S. H. Khan, A Picard-Mann Hybrid Iterative Process, Fixed Point Theory and Applications, doi:10.1186/1687-1812-2013-69], for finding a common element of the set…

Functional Analysis · Mathematics 2014-03-14 Ibrahim Karahan , Murat Ozdemir

In 1955 Kadison \cite{14} asked whether the analogue of the classical Burnside's theorem of the Linear Algebra holds in the infinite dimensional case. We use reproducing kernels method to solve the Kadison question. Namely, we prove that…

General Mathematics · Mathematics 2023-10-03 Mubariz T. Garayev

We prove that a function $f:X\to Y$ from a first-countable (more generally, Preiss-Simon) space $X$ to a regular space $Y$ is weakly discontinuous (which means that every subspace $A\subset X$ contains an open dense subset $U\subset A$ such…

General Topology · Mathematics 2017-06-21 Taras Banakh , Bogdan Bokalo

In this article, we present a geometric theoretical analysis of semidefinite feasibility problems (SDFPs). This is done by decomposing a SDFP into smaller problems, in a way that preserves most feasibility properties of the original…

Optimization and Control · Mathematics 2015-07-29 Bruno F. Lourenço , Masakazu Muramatsu , Takashi Tsuchiya

The Kadison-Singer Conjecture, as proved by Marcus, Spielman, and Srivastava (MSS) [Ann. Math. 182, 327-350 (2015)], has been informally thought of as a strengthening of Batson, Spielman, and Srivastava's theorem that every undirected graph…

Data Structures and Algorithms · Computer Science 2024-01-09 Phevos Paschalidis , Ashley Zhuang
‹ Prev 1 2 3 10 Next ›