科研之友
微信
新浪微博
Facebook
分享链接
摘要
We investigate the problem of the decomposition of balls into a finite number of congruent pieces in dimension d = 2k. In addition, we prove that the d-dimensional unit ball B-d can be divided into a finite number of congruent pieces if d = 4 or d >= 6. We show that the minimal number of required pieces is less than 20d, if d >= 10.
- 出版日期2016
