Algorithms for Greechie Diagrams
Quantum Physics
2007-05-23 v3 Mathematical Physics
Combinatorics
math.MP
Quantum Algebra
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.
Cite
@article{arxiv.quant-ph/0009039,
title = {Algorithms for Greechie Diagrams},
author = {Brendan D. McKay and Norman D. Megill and Mladen Pavicic},
journal= {arXiv preprint arXiv:quant-ph/0009039},
year = {2007}
}
Comments
23 pages, AMSLaTeX; This version: journal pages updated. Web page: http://m3k.grad.hr/pavicic