arXiv (All)
open access
Square matrices with integer eigenvalues under entry permutations
We investigate the problem of which multisets of integer entries yield integer eigenvalues in every square matrix arrangement? Combining module reduction with a dyadic criterion for complete splitting of cubic polynomials, we first show that if the multiset has at least one zero entry, the only poss
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
- A negative Schur coefficient for products of two chains#1156888
- Algebraic approximations to linear combinations of S-units#1141420
- Matrix roots of order n of a multivariate polynomial#1142839
- The Normal Form of Smith's Matrices#984279
- Pairs of commuting integer matrices#405965
Record · ID 1131725
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