Periodic balanced binary triangles
From MaRDI portal
Abstract: A binary triangle of size is a triangle of zeroes and ones, with rows, built with the same local rule as the standard Pascal triangle modulo . 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 . In this paper, the existence of balanced binary triangles of size , for all positive integers , 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.
Recommendations
Cited in
(6)- Boolean analogues of the Pascal triangle with maximal possible number of ones
- Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs
- Balancing in direction (1,-1) in Pascal's triangle.
- Extreme weights in Steinhaus triangles
- scientific article; zbMATH DE number 2214404 (Why is no real title available?)
- A universal sequence of integers generating balanced Steinhaus figures modulo an odd number
This page was built for publication: Periodic balanced binary triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560214)