arXiv (All)
open access
On indecomposable elements in lattices
We study the distribution of indecomposable elements in Euclidean lattices. A positive element in a lattice is called indecomposable if it cannot be represented as a sum of two other positive nonzero elements. The set of all indecomposables in a lattice forms the Hilbert basis for the positive latti
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
- Theta Series with Half-integral Characteristics#1202742
- The Erdős-Falconer distance problem in the integer lattice#1247592
- A density deficit for sums of three cube-full numbers#1130614
- Maximal Filters in the Lattice of Partitions of an Infinite Set#1062101
Record · ID 1199863
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