arXiv (All)
open access
A Threshold Number for the Shortest Vector Problem in the Infinity Norm
For an integer full column rank matrix $A$, we consider the lattice that consists of all integer combinations of columns of $A$. We prove that a shortest non-zero vector $Az$ has infinity norm equal to $1$ whenever the number of columns of $A$ is at least $Δ$, the largest absolute value of a full ra
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
- Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers#1156354
- Eventual Nonnegativity of a Matrix Is in P#1050031
- The Marcus-Minc Transform Inequality#1077191
- Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality#1013989
- Module Lattice Security (Part III): Structured CVP Distance on the Log-Unit Lattice#200406
Record · ID 1144726
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