English
Related papers

Related papers: The Kadison-Singer Problem in Mathematics and Engi…

200 papers

Through the lens of noncommutative function theory, we study restrictions of pure states to unital subspaces of $C^*$-algebras, in the spirit of the Kadison--Singer question. More precisely, given a unital subspace $M$ of a $C^*$-algebra…

Operator Algebras · Mathematics 2024-11-05 Raphaël Clouâtre

Since the celebrated resolution of Kadison-Singer (via the Paving Conjecture) by Marcus, Spielman, and Srivastava, much study has been devoted to further understanding and generalizing the techniques of their proof. Specifically, their…

Combinatorics · Mathematics 2018-11-16 Jonathan Leake , Nick Ryder

We prove that separable C*-algebras which are completely close in a natural uniform sense have isomorphic Cuntz semigroups, continuing a line of research developed by Kadison - Kastler, Christensen, and Khoshkam. This result has several…

Operator Algebras · Mathematics 2015-08-26 Francesc Perera , Andrew Toms , Stuart White , Wilhelm Winter

The paper introduces a (universal) C*-algebra of continuous functions vanishing at infinity on the n-dimensional quantum complex space. To this end, the well-behaved Hilbert space representations of the defining relations are classified.…

Operator Algebras · Mathematics 2025-02-03 Ismael Cohen , Elmar Wagner

Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…

General Mathematics · Mathematics 2007-05-23 Florentin Smarandache

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

The problem of expressing a selfadjoint element that is zero on every bounded trace as a finite sum (or a limit of sums) of commutators is investigated in the setting of C*-algebras of finite nuclear dimension. Upper bounds -- in terms of…

Operator Algebras · Mathematics 2013-09-03 Leonel Robert

We associate reduced and full C*-algebras to arbitrary rings and study the inner structure of these ring C*-algebras. As a result, we obtain conditions for them to be purely infinite and simple. We also discuss several examples.…

Operator Algebras · Mathematics 2009-06-01 Xin Li

We present a systematic, algorithmic method to compute the preimage of elements under the Singer algebraic transfer. Using the lambda algebra and the invariant-theoretic formula of P.H. Chon and L.M. Ha [5], we formulate the preimage search…

Algebraic Topology · Mathematics 2025-07-28 Dang Vo Phuc

We show that the tensor product of two unital C*-algebras, one of which is nuclear and admits a unital *-homomorphism from (the building blocks of) the Jiang-Su algebra, has Kadison's similarity property. As a consequence, we obtain that a…

Operator Algebras · Mathematics 2014-02-26 Miroslava Johanesova , Wilhelm Winter

Based on the concept and properties of $C^{*}$-algebras, the paper introduces a concept of $C_{*}$-class functions. Then by using these functions in $C^{*}$-algebra- valued modular metric spaces of moeini et al. [14], some common fixed…

Functional Analysis · Mathematics 2017-08-07 Bahman Moeini , Arsalan Hojat Ansari

Kadison and Kastler introduced a natural metric on the collection of all C*-subalgebras of the bounded operators on a separable Hilbert space. They conjectured that sufficiently close algebras are unitarily conjugate. We establish this…

Operator Algebras · Mathematics 2012-03-30 Erik Christensen , Allan Sinclair , Roger Smith , Stuart White , Wilhelm Winter

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

We define the class of weakly approximately divisible unital C*-algebras and show that this class is closed under direct sums, direct limits, any tensor product with any C*-algebra, and quotients. A nuclear C*-algebra is weakly…

Operator Algebras · Mathematics 2019-02-20 Don Hadwin , Weihua Li

In this paper, we consider fixed-circle problem in C*-algebra valued metric spaces and prove some fixed-circle theorems for self-mappings by defining the notion of fixed-circle on such spaces with geometric interpretation. Furthermore, we…

Functional Analysis · Mathematics 2021-04-08 Nilay Değirmen

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…

Optimization and Control · Mathematics 2017-01-03 Raymond Hemmecke , Matthias Köppe , Jon Lee , Robert Weismantel

In this paper we give a decomposition of a state on a $C^*$-algebra into a family of pure states and a decomposition of a representation into a family of irreducible representation. Then, we use it to solve the following three problems…

Operator Algebras · Mathematics 2013-08-27 Shamim I Ansari

The notorious `measurement problem' has been roving around quantum mechanics for nearly a century since its inception, and has given rise to a variety of `interpretations' of quantum mechanics, which are meant to evade it. We argue that no…

Quantum Physics · Physics 2023-06-13 F. A. Muller

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shr\"odinger propagator…

Quantum Physics · Physics 2007-05-23 Tien D Kieu

Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…

Computational Complexity · Computer Science 2024-09-06 Asad Khaliq