activity
19922023
most citedConnes' embedding conjecture and sums of hermitian squares

116 citations · 470 across the 86 of their papers we have counts for

collaborators

90 papers

math.OA2023

On operator valued Haar unitaries and bipolar decompositions of R-diagonal elements

Ken Dykema, John Griffin

In the context of operator valued W*-free probability theory, we study Haar unitaries, R-diagonal elements and circular elements. Several classes of Haar unitaries are differentiat…

math.OA2023

Some non-spectral DT-operators in finite von Neumann algebras, II: measures with atoms

Ken Dykema, Amudhan Krishnaswamy-Usha

Results about angles between Haagerup--Schultz projections for DT-operators whose measures have atoms are proved, which in some cases imply that such operators are non-spectral. Se…

math.NT2020★ 2 cited

Classifying minimal vanishing sums of roots of unity

Louis Christie, Kenneth J. Dykema, Igor Klep

A vanishing sum of roots of unity is called minimal if no proper, nonempty sub-sum of it vanishes. This paper classifies all minimal vanishing sums of roots of unity of weight at m…

math.OA2019★ 3 cited

Angles between Haagerup--Schultz projections and spectrality of operators

Ken Dykema, Amudhan Krishnaswamy-Usha

We investigate angles between Haagerup--Schultz projections of operators belonging to finite von Neumann algebras, in connection with a property analogous to Dunford's notion of sp…

math.OA2017

Decomposibility and norm convergence properties in finite von Neumann algebras

Ken Dykema, Joseph Noles, Dmitriy Zanin

We study Schur-type upper triangular forms for elements, T, of von Neumann algebras equipped with faithful, normal, tracial states. These were introduced in a paper of Dykema, Suko…

math.OA2017★ 10 cited

Non-closure of the set of quantum correlations via graphs

Ken Dykema, Vern I. Paulsen, Jitendra Prakash

We prove that the set of quantum correlations for a bipartite system of 5 inputs and 2 outputs is not closed. Our proof relies on computing the correlation functions of a graph, wh…