Cargando…
The Covering Radius and a Discrete Surface Area for Non-Hollow Simplices
We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of d/2 in dimension d, achieved by the “standard terminal simplices” and direct sums of them. We prove this conjecture up to dimension three and show it to be equivalent...
Autores principales: | Codenotti, Giulia, Santos, Francisco, Schymura, Matthias |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer US
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8709830/ https://www.ncbi.nlm.nih.gov/pubmed/35023883 http://dx.doi.org/10.1007/s00454-021-00330-3 |
Ejemplares similares
-
Simplicity
por: Sober, Elliott
Publicado: (1975) -
Code simplicity
por: Kanat-Alexander, Max
Publicado: (2012) -
The complexity of simplicity
por: Peterson, Scott N, et al.
Publicado: (2001) -
The simplicity of planar networks
por: Viana, Matheus P., et al.
Publicado: (2013) -
Lonely Points in Simplices
por: Jaroschek, Maximilian, et al.
Publicado: (2022)