arXiv (All)
open access
Exact Rank of the Largest Good Lattice Point Matrix
We prove that for every integer $n>2$ the largest good lattice point matrix $U_n=[u_h:h\in H_n]$, whose columns are generated by all integers $h<n$ coprime to $n$, has rank exactly $φ(n)/2+1$. The upper bound follows from the pairing identity $u_h+u_{n-h}=(n,\dots,n,2n)^{\top}$. For the lower bound
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
- On (n,k)-Simple Random Integer Lattices.#315711
- The Sharp Scale Inequality for the Schatten Trace Class#1356781
- Discrete Unique Continuation on Simplex#1202180
- The Erdős-Falconer distance problem in the integer lattice#1247592
- Positivity and negativity for $h$-bases for $n$#1345293
Record · ID 1325938
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