1. Preliminaries and Notational Conventions
2. A 2D Perspective on Higher Dimensional Discrete Hypercubes and the Power Sets of Finite Sets
3. Vertex Decompositions in Hypercube Graphs, and Dehn–Sommerville Type Relations
4. Vertex Decompositions in Hypercube Graphs, and Orthogonality Relations
5. Distinguished Symmetric Cycles in Hypercube Graphs and Computation-free Vertex Decompositions
6. Distinguished Symmetric Cycles in Hypercube Graphs and Pairwise Decompositions of Vertices: Two-member Families of Disjoint Sets
7. Distinguished Symmetric Cycles in Hypercube Graphs and Pairwise Decompositions of Vertices: Arbitrary Two-member Clutters
8. Vertices, Their Relabeled Opposites, and Distinguished Symmetric Cycles in Hypercube Graphs
9. Set Families, Blocking Sets, Blockers, and Distinguished Symmetric Cycles in Hypercube Graphs
10. Vertex Decompositions and Subtope Decompositions in Hypercube Graphs
Biography
Dr. Andrey O. Matveev is the author of the research monographs Pattern Recognition on Oriented Matroids and Farey Sequences: Duality and Maps Between Subsequences (De Gruyter, 2017).
