Lonely Points in Simplices

Given a lattice [Formula: see text] and a subset [Formula: see text] , we say that a point in A is lonely if it is not equivalent modulo [Formula: see text] to another point of A. We are interested in identifying lonely points for specific choices of [Formula: see text] when A is a dilated standard...

Descripción completa

Detalles Bibliográficos
Autores principales: Jaroschek, Maximilian, Kauers, Manuel, Kovács, Laura
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9805990/
https://www.ncbi.nlm.nih.gov/pubmed/36605030
http://dx.doi.org/10.1007/s00454-022-00428-2
Descripción
Sumario:Given a lattice [Formula: see text] and a subset [Formula: see text] , we say that a point in A is lonely if it is not equivalent modulo [Formula: see text] to another point of A. We are interested in identifying lonely points for specific choices of [Formula: see text] when A is a dilated standard simplex, and in conditions on [Formula: see text] which ensure that the number of lonely points is unbounded as the simplex dilation goes to infinity.

Ejemplares similares