Periodic balanced binary triangles

Abstract : A binary triangle of size $n$ is a triangle of zeroes and ones, with $n$ rows, built with the same local rule as the standard Pascal triangle modulo $2$. A binary triangle is said to be balanced if the absolute difference between the numbers of zeroes and ones that constitute this triangle is at most $1$. In this paper, the existence of balanced binary triangles of size $n$, for all positive integers $n$, is shown. This is achieved by considering periodic balanced binary triangles, that are balanced binary triangles where each row, column or diagonal is a periodic sequence.
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01463665
Contributeur : Jonathan Chappelon <>
Soumis le : vendredi 3 novembre 2017 - 15:29:15
Dernière modification le : mardi 7 novembre 2017 - 01:16:26

Fichiers

article_rev.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01463665, version 2
  • ARXIV : 1702.03236

Citation

Jonathan Chappelon. Periodic balanced binary triangles. 2017. 〈hal-01463665v2〉

Partager

Métriques

Consultations de la notice

33

Téléchargements de fichiers

6