- Détails du magazine
- Format
- Magazine
- eISSN
- 2182-1976
- Première publication
- 16 Apr 2016
- Période de publication
- 2 fois par an
- Langues
- Anglais
Chercher
Résumé
Gardner asked whether it was possible to tile/pack the squares 1×1,…, 24×24 in a 70×70 square. Arguments that it is impossible have been given by Bitner–Reingold and more recently by Korf–Mofitt–Pollack. Here we outline a simpler algorithm, which we hope could be used to give an alternative and more direct proof in the future. We also derive results of independent interest concerning such packings.
Mots clés
- packing problems
- 70 × 70 square
Résumé
We treat the boundary of the union of blocks in the Jenga game as a surface with a polyhedral structure and consider its genus. We generalize the game and determine the maximum genus among the configurations in the generalized game.
Mots clés
- Jenga
- combinatorics
- geometric topology
Résumé
Using six colors, one per side, cubes can be colored in 30 unique ways. In this paper, a row and column pattern in Conway’s matrix always leads to a selection of eight cubes to replicate one of the 30 cubes. Each cube in the set of 30 has a 2 × 2 × 2 replica with inside faces of matching color. The eight cubes of each replica can be configured in two different ways.
Mots clés
- coloring problems
- 30 color cubes
Résumé
In this paper, we define the term
Mots clés
- Mathematical sculpture