{
  "id": "enwiki-001292664226",
  "slug": "polygraph-mathematics",
  "title": "Polygraph (mathematics)",
  "qid": "",
  "lead": "In mathematics, and particularly in category theory, a polygraph is a generalisation of a directed graph. It is also known as a computad. They were introduced as \"polygraphs\" by Albert Burroni and as \"computads\" by Ross Street. In the same way that a directed multigraph can freely generate a category, an n-computad is the \"most general\" structure which can generate a free n-category. In the context of a graph, each dimension is represented as a set of k -cells. Vertices would make up the 0-cells, edges connecting vertices would be 1-cells, and then each dimension higher connects groups of the dimension beneath it. For 2-cells and up, which connect edges themselves, a source or target may consist of multiple edges of the dimension below it, as long as each set of elements are composites, i.e., are paths connected tip-to-tail. A globular set can be seen as a specific instance of a polygraph. In a polygraph, a source or target of a k -cell may consist of an entire path of elements of ( k -1)-cells, but a globular set restricts this to singular elements of ( k -1)-cells.",
  "body": "In mathematics, and particularly in category theory, a polygraph is a generalisation of a directed graph. It is also known as a computad. They were introduced as \"polygraphs\" by Albert Burroni and as \"computads\" by Ross Street. In the same way that a directed multigraph can freely generate a category, an n-computad is the \"most general\" structure which can generate a free n-category. In the context of a graph, each dimension is represented as a set of k -cells. Vertices would make up the 0-cells, edges connecting vertices would be 1-cells, and then each dimension higher connects groups of the dimension beneath it. For 2-cells and up, which connect edges themselves, a source or target may consist of multiple edges of the dimension below it, as long as each set of elements are composites, i.e., are paths connected tip-to-tail. A globular set can be seen as a specific instance of a polygraph. In a polygraph, a source or target of a k -cell may consist of an entire path of elements of ( k -1)-cells, but a globular set restricts this to singular elements of ( k -1)-cells.",
  "categories": [
    "20341319",
    "20476421",
    "23118434",
    "23468805",
    "23603337",
    "29176295"
  ],
  "license": "CC BY-SA 4.0",
  "source_uri": "https://en.wikipedia.org/w/index.php?oldid=1292664226",
  "content_hash": "",
  "created_at": null,
  "updated_at": 1748401704.0,
  "claims": [],
  "contradictions": [],
  "confidence": 0.6,
  "csl": {
    "id": "enwiki-001292664226",
    "type": "webpage",
    "title": "Polygraph (mathematics)",
    "author": [
      {
        "family": "Anticloud FZ LLE",
        "literal": "Anticloud FZ LLE"
      }
    ],
    "container-title": "encyclopegia.org",
    "publisher": "Anticloud FZ LLE",
    "publisher-place": "Dubai, United Arab Emirates",
    "URL": "https://encyclopegia.org/a/polygraph-mathematics",
    "issued": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "accessed": {
      "date-parts": [
        [
          2026,
          11,
          20
        ]
      ]
    },
    "license": "CC BY-SA 4.0",
    "DOI": "eo1:enwiki-001292664226",
    "isBasedOn": "https://en.wikipedia.org/w/index.php?oldid=1292664226",
    "note": "Immutable snapshot enwiki-001292664226"
  }
}