English
Related papers

Related papers: The Solution of the Kadison-Singer Problem

200 papers

Recently Marcus, Spielman and Srivastava gave a spectacular proof of a theorem which implies a positive solution to the Kadison-Singer problem. We extend (and slightly sharpen) this theorem to the realm of hyperbolic polynomials. A benefit…

Combinatorics · Mathematics 2014-12-02 Petter Brändén

We answer a question posed by Y. Elias et al. in [8] about possible spectral distortions of algebraic numbers. We provide a closed form for the spectral distortion of certain classes of cyclotomic polynomials. Moreover, we present a bound…

Number Theory · Mathematics 2020-07-30 L. Babinkostova , Ariana Chin , Aaron Kirtland , Vladyslav Nazarchuk , Esther Plotnick

This survey accompanies a lecture on the paper ``Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees'' by A. Marcus, D. Spielman, and N. Srivastava at the 2024 International Congress of Basic Science (ICBS) in July, 2024. Its…

Combinatorics · Mathematics 2024-12-31 Nikhil Srivastava

In this survey we describe progress over the last decade or so in understanding the complexity of solving constraint satisfaction problems (CSPs) approximately in the streaming and sketching models of computation. After surveying some of…

Computational Complexity · Computer Science 2022-05-06 Madhu Sudan

We study the connection between *-representations of algebras associated with graphs, locally-scalar graph representations and the problem about the spectrum of a sum of two Hermitian operators. For algebras associated with Dynkin graphs we…

Representation Theory · Mathematics 2007-05-23 Stanislav Krugljak , Stanislav Popovych , Yurii Samoilenko

This is Part II of the paper series on data-compatible T-matrix completion (DCTMC), which is a method for solving nonlinear inverse problems. Part I of the series contains theory and here we present simulations for inverse scattering of…

Mathematical Physics · Physics 2016-11-02 Howard W. Levinson , Vadim A. Markel

There is a connection between *-representations of algebras associated with graphs and the problem about the spectrum of a sum of Hermitian operators (spectral problem). For algebras associated with extended Dynkin graphs we give an…

Representation Theory · Mathematics 2007-05-23 Stanislav Krugljak , Stanislav Popovych , Yurii Samoilenko

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

Here we present a new approach to deal with first order ordinary differential equations (1ODEs), presenting functions. This method is an alternative to the one we have presented in [1]. In [2], we have establish the theoretical background…

Classical Analysis and ODEs · Mathematics 2023-01-06 L. G. S. Duarte , L. A. C. P. da Mota , A. B. M. M. Queiroz

Audio-based cover song detection has received much attention in the MIR community in the recent years. To date, the most popular formulation of the problem has been to compare the audio signals of two tracks and to make a binary decision…

Sound · Computer Science 2019-05-29 Marc Sarfati , Anthony Hu , Jonathan Donier

Akemann and Anderson made a conjecture about ``paving'' projections in finite dimensional matrix algebras which, if true, would settle the well-known Kadison-Singer problem. We falsify their conjecture by an explicit seqence of…

Operator Algebras · Mathematics 2007-05-23 Nik Weaver

Given a Counting Monadic Second Order (CMSO) sentence $\psi$, the CMSO$[\psi]$ problem is defined as follows. The input to CMSO$[\psi]$ is a graph $G$, and the objective is to determine whether $G\models \psi$. Our main theorem states that…

Data Structures and Algorithms · Computer Science 2018-02-06 Daniel Lokshtanov , M. S. Ramanujan , Saket Saurabh , Meirav Zehavi

The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…

Computational Complexity · Computer Science 2010-07-19 Zhixiang Chen , Bin Fu

I briefly review the present status of bosonic strings and discretized random surfaces in D>1 which seem to be in a polymer rather than stringy phase. As an explicit example of what happens, I consider the Kazakov-Migdal model with a…

High Energy Physics - Theory · Physics 2009-10-28 Y. Makeenko

In these lectures I discuss various unsolved problems of string theory and their relations to quantum gravity, 3d Ising model, large N QCD, and quantum cosmology. No solutions are presented but some new and perhaps useful approaches are…

High Energy Physics - Theory · Physics 2008-02-03 A. M. Polyakov

This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…

Classical Analysis and ODEs · Mathematics 2015-06-24 Mikhail Kudryavtsev , Sergio Palafox , Luis O. Silva

Music segmentation refers to the dual problem of identifying boundaries between, and labeling, distinct music segments, e.g., the chorus, verse, bridge etc. in popular music. The performance of a range of music segmentation algorithms has…

Sound · Computer Science 2021-08-31 Matthew C. McCallum

This note begins with an introduction to the inverse isospectral problem popularized by M. Kac's 1966 article in the American Mathematical Monthly, "Can one hear the shape of a drum?" Although the answer has been known for some twenty years…

Spectral Theory · Mathematics 2020-12-11 Zhiqin Lu , Julie Rowlett

A generally intelligent learner should generalize to more complex tasks than it has previously encountered, but the two common paradigms in machine learning -- either training a separate learner per task or training a single learner for all…

Machine Learning · Computer Science 2019-05-09 Michael B. Chang , Abhishek Gupta , Sergey Levine , Thomas L. Griffiths

In their seminal work, Atserias et al. and independently Pipatsrisawat and Darwiche in 2009 showed that CDCL solvers can simulate resolution proofs with polynomial overhead. However, previous work does not address the tightness of the…

Computational Complexity · Computer Science 2023-04-20 Marc Vinyals , Chunxiao Li , Noah Fleming , Antonina Kolokolova , Vijay Ganesh