Related papers: The Solution of the Kadison-Singer Problem
In the summer of 2013 Marcus, Spielman, and Srivastava gave a surprising and beautiful solution to the Kadison--Singer problem. The current presentation is slightly more didactical than other versions that have appeared since; it hopes to…
We survey the techniques used in our recent resolution of the Kadison-Singer problem and proof of existence of Ramanujan Graphs of every degree: mixed characteristic polynomials and the method of interlacing families of polynomials. To…
We give self-contained presentation of results related to the Kadison-Singer problem, which was recently solved by Marcus, Spielman, and Srivastava. This problem connects with unusually large number of areas including: operator algebras…
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…
We give a combinatorial form of the Kadison-Singer problem, a famous problem in C*-algebra. This combinatorial problem, which has several minor variations, is a discrepancy question about vectors in C^n. Some partial results can be easily…
It is known that the famous, intractible 1959 Kadison-Singer problem in $C^{*}$-algebras is equivalent to fundamental unsolved problems in a dozen areas of research in pure mathematics, applied mathematics and Engineering. The recent…
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…
In this paper, pursuing the same line of ideas in the proof of an old longstanding open conjecture of \emph{Kadison-Singer} , we introduce a key lemma which we call it the interlacing lemma which indicates a necessary condition for having a…
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$…
A difficult step in the process of karyotyping is segmenting chromosomes that touch or overlap. In an attempt to automate the process, previous studies turned to Deep Learning methods, with some formulating the task as a semantic…
Recently, the problem of music plagiarism has emerged as an even more pressing social issue. As music information retrieval research advances, there is a growing effort to address issues related to music plagiarism. However, many studies,…
In 2013, Marcus, Spielman, and Srivastava resolved the famous Kadison-Singer conjecture. It states that for $n$ independent random vectors $v_1,\cdots, v_n$ that have expected squared norm bounded by $\epsilon$ and are in the isotropic…
We prove some new equivalences of the paving conjecture and obtain some estimates on the paving constants. In addition we give a new family of counterexamples to one of the Akemann-Anderson conjectures.
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…
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\| =…
In this paper we survey a recent progress on continuous frames inspired by the solution of the Kadison-Singer problem by Marcus, Spielman, and Srivastava. We present an extension of Lyapunov's theorem for discrete frames due to Akemann and…
An extension of the ideas of the Prelle-Singer procedure to second order differential equations is proposed. As in the original PS procedure, this version of our method deals with differential equations of the form…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
We show that any $n\times m$ matrix $A$ can be approximated in operator norm by a submatrix with a number of columns of order the stable rank of $A$. This improves on existing results by removing an extra logarithmic factor in the size of…
This application-oriented study concerns computational musicology, which makes use of grammar systems. We define multi-generative rule-synchronized scattered-context grammar systems (without erasing rules) and demonstrates how to…