{
  "annotation_id": "df81d1ea-f8d9-43d1-9ea7-20f5fcde8fe9",
  "date_created": "2026-03-02T18:01:38.856000Z",
  "date_modified": "2026-03-02T18:01:38.856000Z",
  "file_hash": "accf12a5fa1fe4023448bcacaded100bda0e1d436caa8bee3139f882bcffe609",
  "private": false,
  "record": {
    "abstract": "We give a new algorithm for generating Greechie diagrams with arbitrary\nchosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer\nprogram for generating the diagrams. The results show that the previous\nalgorithm does not produce every diagram and that it is at least 100,000 times\nslower. We also provide an algorithm and programs for checking of Greechie\ndiagram passage by equations defining varieties of orthomodular lattices and\ngive examples from Hilbert lattices. At the end we discuss some additional\ncharacteristics of Greechie diagrams.",
    "arxiv_id": "quant-ph/0009039",
    "authors": [
      "Brendan D. McKay",
      "Norman D. Megill",
      "Mladen Pavicic"
    ],
    "categories": [
      "quant-ph",
      "math-ph",
      "math.CO",
      "math.MP",
      "math.QA"
    ],
    "journal_ref": "International Journal of Theoretical Physics, 39, 2381-2406 (2000)",
    "title": "Algorithms for Greechie Diagrams",
    "url": "https://arxiv.org/abs/quant-ph/0009039"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f8f74371-512e-4cdd-8d19-0a37f93eb3f3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}