On indecomposable elements in lattices
Abstract
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 lattice semigroup. We classify lattices that contain only finitely many indecomposables versus those that contain infinitely many. In the two-dimensional case, we prove that every positive element in a lattice can be represented as a positive integer linear combination of at most two indecomposables, which is a certain variation of the discrete Carathéodory's property. In the case of lattices coming from ideals in the rings of integers of real quadratic number fields, we obtain an explicit counting estimate for the number of indecomposables with bounded norm, showing logarithmic growth.
Related
- Two indecomposable Enriques categories
- Geometric bounds on norms of signed indecomposable integers
- Absolutely indecomposable quasi-parabolic G-bundles and the multiplicity of irreducible characters
- cal N= 4 supersymmetric multiparticle systems based on indecomposable multiplets
- Indecomposable characters of the wreath product of a torus by the infinite block-diagonal symmetric group
BibTeX
@misc{fukshansky2026indecomposable,
title = {{On indecomposable elements in lattices}},
author = {Lenny Fukshansky and Filiana Kostopoulou},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2606.00868},
eprint = {2606.00868},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.00868},
}
RIS
TY - UNPB
TI - On indecomposable elements in lattices
AU - Lenny Fukshansky
AU - Filiana Kostopoulou
PY - 2026
DA - 2026/10/04
PB - arXiv
DO - 10.48550/arxiv.2606.00868
UR - https://arxiv.org/abs/2606.00868
AB - 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 lattice semigroup. We classify lattices that contain only finitely many indecomposables versus those that contain infinitely many. In the two-dimensional case, we prove that every positive element in a lattice can be represented as a positive integer linear combination of at most two indecomposables, which is a certain variation of the discrete Carathéodory's property. In the case of lattices coming from ideals in the rings of integers of real quadratic number fields, we obtain an explicit counting estimate for the number of indecomposables with bounded norm, showing logarithmic growth.
ER -