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
_version_ 1784862439804764160
author Jaroschek, Maximilian
Kauers, Manuel
Kovács, Laura
author_facet Jaroschek, Maximilian
Kauers, Manuel
Kovács, Laura
author_sort Jaroschek, Maximilian
collection PubMed
description 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.
format Online
Article
Text
id pubmed-9805990
institution National Center for Biotechnology Information
language English
publishDate 2022
publisher Springer US
record_format MEDLINE/PubMed
spelling pubmed-98059902023-01-03 Lonely Points in Simplices Jaroschek, Maximilian Kauers, Manuel Kovács, Laura Discrete Comput Geom Article 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. Springer US 2022-09-29 2023 /pmc/articles/PMC9805990/ /pubmed/36605030 http://dx.doi.org/10.1007/s00454-022-00428-2 Text en © The Author(s) 2022 https://creativecommons.org/licenses/by/4.0/Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/ (https://creativecommons.org/licenses/by/4.0/) .
spellingShingle Article
Jaroschek, Maximilian
Kauers, Manuel
Kovács, Laura
Lonely Points in Simplices
title Lonely Points in Simplices
title_full Lonely Points in Simplices
title_fullStr Lonely Points in Simplices
title_full_unstemmed Lonely Points in Simplices
title_short Lonely Points in Simplices
title_sort lonely points in simplices
topic Article
url 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
work_keys_str_mv AT jaroschekmaximilian lonelypointsinsimplices
AT kauersmanuel lonelypointsinsimplices
AT kovacslaura lonelypointsinsimplices

Ejemplares similares