On indecomposable elements in lattices
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910276604919808 |
|---|---|
| author | Fukshansky, Lenny Kostopoulou, Filiana |
| author_facet | Fukshansky, Lenny Kostopoulou, Filiana |
| contents | 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 fractional ideals in real quadratic number fields, we obtain an explicit counting estimate for the number of indecomposables with bounded norm, showing logarithmic growth. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2606_00868 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On indecomposable elements in lattices Fukshansky, Lenny Kostopoulou, Filiana Number Theory Metric Geometry 11H06, 11R80, 52B20 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 fractional ideals in real quadratic number fields, we obtain an explicit counting estimate for the number of indecomposables with bounded norm, showing logarithmic growth. |
| title | On indecomposable elements in lattices |
| topic | Number Theory Metric Geometry 11H06, 11R80, 52B20 |
| url | https://arxiv.org/abs/2606.00868 |