REVIEW 1 cited by
Algorithms for Greechie Diagrams
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Forward citations
Cited by 1 Pith paper
-
Chromatic Quantum Contextuality
A 3D quantum configuration (Yu-Oh) is shown to need four colors in any consistent coloring even though every measurement context has three outcomes, giving a chromatic analogue of Kochen-Specker contextuality.
Discussion (0). Continue with ORCID to comment.