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 3 (2016): Edición 6 (December 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

5 Artículos
Acceso abierto

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Publicado en línea: 08 Dec 2016
Páginas: 5 - 42

Resumen

Abstract

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

Palabras clave

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Acceso abierto

Where are (Pseudo)Science Fool’s Hoax Articles in April From?

Publicado en línea: 08 Dec 2016
Páginas: 43 - 74

Resumen

Abstract

In this paper, we discuss in detail what is behind April Fool’s Day

Palabras clave

  • April fool’s day
Acceso abierto

Finding the Year’s Share in Day-of-Week Calculations

Publicado en línea: 08 Dec 2016
Páginas: 75 - 86

Resumen

Abstract

The dominant part in the mental calculation of the day of the week for any given date is to determine the year share, that is, the contribution of the two-digit year part of the date. This paper describes a number of year share computation methods, some well-known and some new. The “Parity Minus 3” method, in particular, is a new alternative to the popular “Odd+11” method. The paper categorizes the methods of year share computation, and presents simpler proofs of their correctness than usually provided.

Palabras clave

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Acceso abierto

Quantum Distribution of a Sudoku Key

Publicado en línea: 08 Dec 2016
Páginas: 87 - 94

Resumen

Abstract

Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Palabras clave

  • sudoku
  • quantum key distribution methods
Acceso abierto

The Maximum Queens Problem with Pawns

Publicado en línea: 08 Dec 2016
Páginas: 95 - 102

Resumen

Abstract

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Palabras clave

  • chess
  • n-queens problem
  • combinatorics
5 Artículos
Acceso abierto

Construction and Enumeration of Circuits Capable of Guiding a Miniature Vehicle

Publicado en línea: 08 Dec 2016
Páginas: 5 - 42

Resumen

Abstract

In contrast to traditional toy tracks, a patented system allows the creation of a large number of tracks with a minimal number of pieces, and whose loops always close properly. These circuits strongly resemble traditional self-avoiding polygons (whose explicit enumeration has not yet been resolved for an arbitrary number of squares) yet there are numerous differences, notably the fact that the geometric constraints are different than those of self-avoiding polygons. We present the methodology allowing the construction and enumeration of all of the possible tracks containing a given number of pieces. For small numbers of pieces, the exact enumeration will be treated. For greater numbers of pieces, only an estimation will be offered. In the latter case, a randomly construction of circuits is also given. We will give some routes for generalizations for similar problems.

Palabras clave

  • closed paths
  • toy tracks
  • combinatorics
  • exact and asymptotic enumeration
Acceso abierto

Where are (Pseudo)Science Fool’s Hoax Articles in April From?

Publicado en línea: 08 Dec 2016
Páginas: 43 - 74

Resumen

Abstract

In this paper, we discuss in detail what is behind April Fool’s Day

Palabras clave

  • April fool’s day
Acceso abierto

Finding the Year’s Share in Day-of-Week Calculations

Publicado en línea: 08 Dec 2016
Páginas: 75 - 86

Resumen

Abstract

The dominant part in the mental calculation of the day of the week for any given date is to determine the year share, that is, the contribution of the two-digit year part of the date. This paper describes a number of year share computation methods, some well-known and some new. The “Parity Minus 3” method, in particular, is a new alternative to the popular “Odd+11” method. The paper categorizes the methods of year share computation, and presents simpler proofs of their correctness than usually provided.

Palabras clave

  • day of the week
  • calendar algorithms
  • doomsday method
  • first Sunday algorithm
  • mental arithmetic
  • year share
Acceso abierto

Quantum Distribution of a Sudoku Key

Publicado en línea: 08 Dec 2016
Páginas: 87 - 94

Resumen

Abstract

Sudoku grids are often cited as being useful in cryptography as a key for some encryption process. Historically transporting keys over an alternate channel has been very difficult. This article describes how a Sudoku grid key can be secretly transported using quantum key distribution methods whereby partial grid (or puzzle) can be received and the full key can be recreated by solving the puzzle.

Palabras clave

  • sudoku
  • quantum key distribution methods
Acceso abierto

The Maximum Queens Problem with Pawns

Publicado en línea: 08 Dec 2016
Páginas: 95 - 102

Resumen

Abstract

The classic n-queens problem asks for placements of just n mutually non-attacking queens on an n × n board. By adding enough pawns, we can arrange to fill roughly one-quarter of the board with mutually non-attacking queens. How many pawns do we need? We discuss that question for square boards as well as rectangular m × n boards.

Palabras clave

  • chess
  • n-queens problem
  • combinatorics

Planifique su conferencia remota con Sciendo