Subspaces, subsets, and Motzkin paths

2024/07/09 by Jonathan David Farley, Farley, Jonathan D., Murali K. Srinivasan +1
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.2407.06559

openalex publication_date 2024/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We define a map from subspaces to Motzkin paths and show that the inverse image of every path is a disjoint union of symmetric Boolean subsets yielding an explicit symmetric Boolean decomposition of the subspace lattice.

Related

• A Note on Boolean Lattices and Farey Sequences III
• A negative solution to the complemented subspace problem in Banach lattices
• Duality Between Uniform Spaces and Boolean Algebras
• Ultrafilters: Where topological dynamics = algebra = combinatorics
• Subspaces and Quotients of Banach Symmetric Spaces