Revista y Edición

Volumen 9 (2022): Edición 16 (June 2022)

Volumen 8 (2021): Edición 15 (November 2021)

Volumen 8 (2021): Edición 14 (October 2021)

Volumen 7 (2020): Edición 13 (November 2020)

Volumen 6 (2019): Edición 12 (December 2019)

Volumen 6 (2019): Edición 11 (September 2019)

Volumen 5 (2018): Edición 10 (December 2018)

Volumen 5 (2018): Edición 9 (September 2018)

Volumen 4 (2017): Edición 8 (December 2017)

Volumen 4 (2017): Edición 7 (May 2017)

Volumen 3 (2016): Edición 6 (December 2016)

Volumen 3 (2016): Edición 5 (March 2016)

Detalles de la revista
Formato
Revista
eISSN
2182-1976
Publicado por primera vez
16 Apr 2016
Periodo de publicación
2 veces al año
Idiomas
Inglés

Buscar

Volumen 5 (2018): Edición 9 (September 2018)

Detalles de la revista
Formato
Revista
eISSN
2182-1976
Publicado por primera vez
16 Apr 2016
Periodo de publicación
2 veces al año
Idiomas
Inglés

Buscar

4 Artículos
Acceso abierto

Optimal Rectangle Packing for the 70 Square

Publicado en línea: 25 Sep 2018
Páginas: 5 - 47

Resumen

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.

Palabras clave

  • packing problems
  • 70 × 70 square
Acceso abierto

Maximum Genus of the Jenga Like Configurations

Publicado en línea: 25 Sep 2018
Páginas: 49 - 64

Resumen

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.

Palabras clave

  • Jenga
  • combinatorics
  • geometric topology
Acceso abierto

2 × 2 × 2 Color Cubes

Publicado en línea: 25 Sep 2018
Páginas: 65 - 70

Resumen

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.

Palabras clave

  • coloring problems
  • 30 color cubes
Acceso abierto

A Classification of Mathematical Sculpture

Publicado en línea: 25 Sep 2018
Páginas: 71 - 94

Resumen

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.

Palabras clave

  • Mathematical sculpture
4 Artículos
Acceso abierto

Optimal Rectangle Packing for the 70 Square

Publicado en línea: 25 Sep 2018
Páginas: 5 - 47

Resumen

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.

Palabras clave

  • packing problems
  • 70 × 70 square
Acceso abierto

Maximum Genus of the Jenga Like Configurations

Publicado en línea: 25 Sep 2018
Páginas: 49 - 64

Resumen

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.

Palabras clave

  • Jenga
  • combinatorics
  • geometric topology
Acceso abierto

2 × 2 × 2 Color Cubes

Publicado en línea: 25 Sep 2018
Páginas: 65 - 70

Resumen

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.

Palabras clave

  • coloring problems
  • 30 color cubes
Acceso abierto

A Classification of Mathematical Sculpture

Publicado en línea: 25 Sep 2018
Páginas: 71 - 94

Resumen

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.

Palabras clave

  • Mathematical sculpture

Planifique su conferencia remota con Sciendo