The PSD block-sum Schatten maximization conjecture
Let be arbitrary positive semidefinite block matrices, and let be arbitrary non-negative numbers. For a matrix , write for its Schatten -norm. The PSD block-sum Schatten maximization conjecture. Under the constraints
the maximum attainable value of is
This is presented as an equivalent formulation of the proposed norm-compression inequality in the case . The supplied text does not establish its resolution.
References
Primary source
Koenraad M. R. Audenaert, “On a Norm Compression Inequality for 2XN Partitioned Block Matrices”, arXiv:math/0702186 (2007).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.