Translational tilings by a polytope, with multiplicity
We study the problem of covering Rd by overlapping translates of a convex polytope, such that almost every point of Rd is covered exactly k times. Such a covering of Euclidean space by a discrete set of translations is called a k-tiling. The investigation of simple tilings by translations (which...
Saved in:
Main Authors: | Robins, Sinai., Shiryaev, Dmitry., Gravin, Nick. |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Article |
Language: | English |
Published: |
2013
|
Online Access: | https://hdl.handle.net/10356/96779 http://hdl.handle.net/10220/13087 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The inverse moment problem for convex polytopes
by: Gravin, Nick., et al.
Published: (2013) -
Polyhedral Gauss sums, and polytopes with symmetry
by: Malikiosis, Romanos-Diogenes, et al.
Published: (2016) -
On the skeleton of the metric polytope
by: Deza, Antoine., et al.
Published: (2014) -
On aperiodicity problem of polynomial polytopes
by: Wang, Qing-Guo, et al.
Published: (2014) -
SIMPLICIAL COMPLEX, POLYTOPES AND COMBINATORICS
by: CHANG HAI BIN
Published: (2021)