arXiv (All)
open access
Zero-trace index of matrices
The zero-trace index $t(A)$ of a square complex matrix $A$ is introduced. It is defined as the largest integer $k$ such that $A$ admits a $k \times k$ compression with trace zero. This concept is analogous to the zero-dilation index $d(A)$ and is closely related to the $k$-numerical range. The $k$-n
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
- The SATOR Matrix - Discrete Warped First-Return Realization of the Golden-Torus Transfer Operators#177906
- One Arithmetic Gadget, Two Problems#1123814
- Subexponential Approximation of the Permanent in Deterministic Polynomial Time#997388
- Spectra of Random Polynomial Matrices: the Petaloid Law#1154495
- Algebraic Structures using Super Interval Matrices#112197
Record · ID 1389432
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