Back to Search
Start Over
Lonely Points in Simplices.
- Source :
-
Discrete & computational geometry [Discrete Comput Geom] 2023; Vol. 69 (1), pp. 4-25. Date of Electronic Publication: 2022 Sep 29. - Publication Year :
- 2023
-
Abstract
- Given a lattice L ⊆ Z m and a subset A ⊆ R m , we say that a point in A is lonely if it is not equivalent modulo L to another point of  A . We are interested in identifying lonely points for specific choices of L when A is a dilated standard simplex, and in conditions on L which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.<br /> (© The Author(s) 2022.)
Details
- Language :
- English
- ISSN :
- 0179-5376
- Volume :
- 69
- Issue :
- 1
- Database :
- MEDLINE
- Journal :
- Discrete & computational geometry
- Publication Type :
- Academic Journal
- Accession number :
- 36605030
- Full Text :
- https://doi.org/10.1007/s00454-022-00428-2