The square patterns represent Boolean functions with white representing 0.
Decimal numbers are the interpretation of the corresponding bit-pattern as a little-endian binary number.
The red matrix on the left is the family matrix of the Boolean function in its top row.
For each Boolean function (red row) the corresponding green row represents its ANF,
and the green integer is its Zhegalkin index. (The smallest one is highlighted with a thin border.)
The blue matrix is to the green one, as the green matrix is to the red one.
All its entries are determined by its top row, which is equal to that of the green matrix.
Its possible entries are those of a top left Sierpinski triangle.
The entries within that are equal to the top row entry in the same anti-diagonal.
Source
Own work
Author
Watchduck You can name the author as "T. Piesk", "Tilman Piesk" or "Watchduck".
Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License.http://www.gnu.org/copyleft/fdl.htmlGFDLGNU Free Documentation Licensetruetrue
to share – to copy, distribute and transmit the work
to remix – to adapt the work
Under the following conditions:
attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
https://creativecommons.org/licenses/by/4.0CC BY 4.0 Creative Commons Attribution 4.0 truetrue
