Mathematical analysis reveals bounds on edge counts and minimum sizes of Greechie diagrams in quantum structures, indicating constraints on algebraic models of quantum events.
We study the maximum possible number of edges in certain classes of hypergraphs with a given number of vertices. Our approach uses a generalized notion of a path, which need not consist solely of a sequence of vertices and may terminate in an edge. Certain hypergraphs, known as Greechie diagrams, are used to model events in quantum experiments described by orthoalgebras, orthomodular posets, and orthomodular lattices. Previous work has investigated Greechie diagrams with “many” edges. We apply our method to estimate the minimum possible size of such examples.
No takes yet. Share an insight, caveat, or question.
Bubák et al. (2026) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: