The paper defines a lexicographic total order on complex numbers and a Spectral and Nilpotent Ordering (SNO) for arbitrary matrices, claiming to extend majorization, Schur-Ostrowski, and operator convexity results to the complex domain.
Random Tensor Inequalities and Tail bounds for Bivariate Random Tensor Means, Part I
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this work, we apply the concept about operator connection to consider bivariate random tensor means. We first extend classical Markov and Chebyshev inequalities from a random variable to a random tensor by establishing Markov inequality for tensors and Chebyshev inequality for tensors. These inequalities are applied to establish tail bounds for bivariate random tensor means represented by operator perspectives based on various types of connection functions: tensor increasing functions, tensor decreasing functions, and tensor concavity functions. We also consider tail bounds relations for the summation and product of eigenvalues based on majorization ordering of eigenvalues of bivariate random tensor means. This is Part I of our work about random tensor inequalities and tail bounds for bivariate random tensor mean. In our Part II, we will consider bivariate random tensor mean with respect to non-invertible random tensors and their applications.
citation-role summary
citation-polarity summary
fields
math.FA 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Matrix Ordering through Spectral and Nilpotent Structures in Totally Ordered Complex Number Fields
The paper defines a lexicographic total order on complex numbers and a Spectral and Nilpotent Ordering (SNO) for arbitrary matrices, claiming to extend majorization, Schur-Ostrowski, and operator convexity results to the complex domain.