论文信息 - The Kadison-Singer problem in discrepancy theory

The Kadison-Singer problem in discrepancy theory

Abstract 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 deduced from known facts in discrepancy theory.

Nicholas Weaver

[1] M. Atiyah,et al. Special Article Mathematics in the 20th Century , 2002 .

[2] C. Akemann,et al. Lyapunov theorems for operator algebras , 1991 .

[3] József Beck,et al. "Integer-making" theorems , 1981, Discret. Appl. Math..

[4] J. Bourgain,et al. On a problem of Kadison and Singer. , 1991 .

[5] Bernard Chazelle,et al. The discrepancy method - randomness and complexity , 2000 .

[6] Betül Tanbay,et al. Pure state extensions and compressibility of the ₁-algebra , 1991 .

[7] Edward Nelson,et al. Representation of Elliptic Operators in an Enveloping Algebra , 1959 .

[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[9] I. Singer,et al. EXTENSIONS OF PURE STATES. , 1959 .

[10] Wojciech Banaszczyk,et al. Balancing vectors and Gaussian measures of n-dimensional convex bodies , 1998, Random Struct. Algorithms.

[11] Nik Weaver,et al. A Counterexample to a Conjecture of Akemann and Anderson , 2001, math/0105183.

[12] D. R. Fulkerson,et al. Transversals and Matroid Partition , 1965 .