Algorithms for Greechie Diagrams |
| |
| Authors: | Brendan D Mckay Norman D Megill Mladen Pavičic |
| |
| Institution: | (1) Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia;(2) Boston Informaton Group, Belmont, Massachusetts, 02478;(3) Department of Physics, University of Maryland Baltimore Country, Baltimore, Maryland, 21250;(4) Gradjevinski Fakultet, University OF zAGREB, Ka 26, HR-1000 Zagreb, Crotia |
| |
| Abstract: | We give a new algorithm for generating Greechie diagrams with arbitrary chosennumber of atoms or blocks (with 2, 3, 4, . . . atoms) and provide a computerprogram for generating the diagrams. The results show that the previous algorithmdoes not produce every diagram and that it is atleast 105 times slower. We alsoprovide an algorithm and programs for checking Greechie diagram passage byequations defining varieties of orthomodular lattices and give examples fromHilbert lattices. We also discuss some additional characteristics of Greechiediagrams. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
