Symmetric binary Steinhaus triangles and parity-regular Steinhaus graphs
Jonathan Chappelon (IMAG)

TL;DR
This paper studies symmetric binary Steinhaus triangles and graphs, providing explicit bases for their linear subspaces, and explores their algebraic structures and symmetries, including isomorphisms with parity-regular Steinhaus graphs.
Contribution
It introduces explicit bases for symmetric Steinhaus triangles and graphs, and establishes isomorphisms between even Steinhaus graphs and dihedrally symmetric triangles, advancing understanding of their algebraic properties.
Findings
Explicit bases for symmetric Steinhaus triangles derived
Isomorphism between even Steinhaus graphs and dihedrally symmetric triangles established
Bases for parity-regular Steinhaus graphs constructed
Abstract
A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule as the Pascal triangle modulo 2. A binary Steinhaus triangle is said to be rotationally symmetric, horizontally symmetric or dihedrally symmetric if it is invariant under the 120 degrees rotation, the horizontal reflection or both, respectively. The first part of this paper is devoted to the study of linear subspaces of rotationally symmetric, horizontally symmetric and dihedrally symmetric binary Steinhaus triangles. We obtain simple explicit bases for each of them by using elementary properties of the binomial coefficients. A Steinhaus graph is a simple graph with an adjacency matrix whose upper-triangular part is a binary Steinhaus triangle. A Steinhaus graph is said to be even or odd if all its vertex degrees are even or odd, respectively. One of the main results of this paper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
