Algorithms for Greechie Diagrams

Simple item page
dc.creatorMcKay, Brendan D.
dc.creatorMegill, Norman D.
dc.creatorPavicic, Mladen
dc.date2000-09-09
dc.date2001-01-21
dc.date.accessioned2026-07-07T06:00:47Z
dc.date.available2026-07-07T06:00:47Z
dc.descriptionWe 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.
dc.description23 pages, AMSLaTeX; This version: journal pages updated. Web page: http://m3k.grad.hr/pavicic
dc.identifierhttps://arxiv.org/abs/quant-ph/0009039
dc.identifierhttp://arxiv.org/abs/quant-ph/0009039
dc.identifierInternational Journal of Theoretical Physics, 39, 2381-2406 (2000)
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/89068
dc.subjectQuantum Physics
dc.subjectMathematical Physics
dc.subjectCombinatorics
dc.subjectQuantum Algebra
dc.titleAlgorithms for Greechie Diagrams
dc.typetext

Files

Collections

arXiv