Periodic balanced binary triangles - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2017

Periodic balanced binary triangles

Résumé

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.
Fichier principal
Vignette du fichier
article.pdf (2.39 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01463665 , version 1 (09-02-2017)
hal-01463665 , version 2 (03-11-2017)
hal-01463665 , version 3 (23-11-2017)

Identifiants

Citer

Jonathan Chappelon. Periodic balanced binary triangles. 2017. ⟨hal-01463665v1⟩
260 Consultations
762 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More