An operator-theory construction on geometric lattices
Thomas Sinclair

TL;DR
This paper introduces an operator-theoretic framework for finite geometric lattices, linking lattice structures to orthogonal polynomial systems via a novel nonassociative product and explicit combinatorial formulas.
Contribution
It presents a new construction that associates geometric lattices with orthogonal polynomials, extending to various lattice types without symmetry constraints.
Findings
Centered Krawtchouk Jacobi matrix for Boolean lattices
q-deformations for projective geometries
Explicit combinatorial formulas for Jacobi coefficients
Abstract
We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a corresponding self-adjoint Hamiltonian on . A key structural feature is that the Hamiltonian changes rank by at most one, so that its compression to the rank-radial subspace is a Jacobi matrix. In this way, geometric lattices give rise in a direct and uniform manner to finite orthogonal polynomial systems. The Jacobi coefficients admit explicit combinatorial formulas. For Boolean lattices one obtains the centered Krawtchouk Jacobi matrix, while for projective geometries one obtains natural -deformations consistent with the -Hahn family. The construction applies to arbitrary geometric lattices and requires no symmetry assumptions.
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.
