Cargando…
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...
Autores principales: | Jaroschek, Maximilian, Kauers, Manuel, Kovács, Laura |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2022
|
Materias: | |
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 |
Ejemplares similares
-
Simplicity
por: Sober, Elliott
Publicado: (1975) -
Improved polynomial remainder sequences for Ore polynomials()
por: Jaroschek, Maximilian
Publicado: (2013) -
Valuing Simplicity: Developing a Good Point of Care Diagnostic
por: Engel, Nora, et al.
Publicado: (2020) -
The complexity of simplicity
por: Peterson, Scott N, et al.
Publicado: (2001) -
Code simplicity
por: Kanat-Alexander, Max
Publicado: (2012)