arXiv (All)
open access
Towards a Characterization of Matrix Monotonicity via Radial Convexity
The theory of matrix monotone functions of finite degree depends subtly on the matrix size. Motivated by this phenomenon, we introduce radial convexity of metrics with respect to matrix orders on the cone of positive definite matrices. We establish radial convexity of several natural metrics with re
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Qualitative convexity and universal cross-sections#1062032
- Anisotropic View Distance Metric for High-Dimensional Data: Theory, Geometry, and Fast Computation#925690
- Convex Order Beyond Dimension One: Projection Tests, Counterexamples and Gaussian Mixtures#1216779
- Unique Minimizers for Permanents, Mixed Discriminants, and Log-concave Polynomials#1035053
- Convex Order and Moment Persuasion#1071459
Record · ID 1342612
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive