arXiv (All)
open access
A Matrix Analogue of Rational Number Systems
Let $P,Q \in \mathbb{Z}^{d\times d}$ be invertible coprime matrices such that all the eigenvalues of $Q^{-1}P$ have modulus greater than 1, and $\mathbb{Z}^d[Q^{-1}P]$ be the smallest non-trivial $Q^{-1}P$-invariant $\mathbb{Z}$-module containing $\mathbb{Z}^d$. Suppose there is a finite digit set $
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
- Non-Expansive Matrix Based number Systems#820448
- Algebraic approximations to linear combinations of S-units#1141420
- Bloch torsion and modular combinations of Nahm sums#1326837
- Butson Hadamard Matrices from Pairs of Gauss Sums#1037437
- Skew cyclic codes through Drinfeld modules#1117618
Record · ID 1297196
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