Magazine et Edition

Volume 10 (2023): Edition 17 (January 2023)

Volume 9 (2022): Edition 16 (June 2022)

Volume 8 (2021): Edition 15 (November 2021)

Volume 8 (2021): Edition 14 (October 2021)

Volume 7 (2020): Edition 13 (November 2020)

Volume 6 (2019): Edition 12 (December 2019)

Volume 6 (2019): Edition 11 (September 2019)

Volume 5 (2018): Edition 10 (December 2018)

Volume 5 (2018): Edition 9 (September 2018)

Volume 4 (2017): Edition 8 (December 2017)

Volume 4 (2017): Edition 7 (May 2017)

Volume 3 (2016): Edition 6 (December 2016)

Volume 3 (2016): Edition 5 (March 2016)

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

Volume 5 (2018): Edition 9 (September 2018)

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

4 Articles
Accès libre

Optimal Rectangle Packing for the 70 Square

Publié en ligne: 25 Sep 2018
Pages: 5 - 47

Résumé

Abstract

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
Accès libre

Maximum Genus of the Jenga Like Configurations

Publié en ligne: 25 Sep 2018
Pages: 49 - 64

Résumé

Abstract

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
Accès libre

2 × 2 × 2 Color Cubes

Publié en ligne: 25 Sep 2018
Pages: 65 - 70

Résumé

Abstract

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
Accès libre

A Classification of Mathematical Sculpture

Publié en ligne: 25 Sep 2018
Pages: 71 - 94

Résumé

Abstract

In this paper, we define the term Mathematical Sculpture, a task somehow complex. Also, we present a classification of mathematical sculptures as exhaustive and complete as possible. Our idea consists in establishing general groups for different branches of Mathematics, subdividing these groups according to the main mathematical concepts used in the sculpture design.

Mots clés

  • Mathematical sculpture
4 Articles
Accès libre

Optimal Rectangle Packing for the 70 Square

Publié en ligne: 25 Sep 2018
Pages: 5 - 47

Résumé

Abstract

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
Accès libre

Maximum Genus of the Jenga Like Configurations

Publié en ligne: 25 Sep 2018
Pages: 49 - 64

Résumé

Abstract

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
Accès libre

2 × 2 × 2 Color Cubes

Publié en ligne: 25 Sep 2018
Pages: 65 - 70

Résumé

Abstract

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
Accès libre

A Classification of Mathematical Sculpture

Publié en ligne: 25 Sep 2018
Pages: 71 - 94

Résumé

Abstract

In this paper, we define the term Mathematical Sculpture, a task somehow complex. Also, we present a classification of mathematical sculptures as exhaustive and complete as possible. Our idea consists in establishing general groups for different branches of Mathematics, subdividing these groups according to the main mathematical concepts used in the sculpture design.

Mots clés

  • Mathematical sculpture

Planifiez votre conférence à distance avec Sciendo