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 {\displaystyle 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 {\displaystyle k} -cell may consist of an entire path of elements of ( k {\displaystyle k} -1)-cells, but a globular set restricts this to singular elements of ( k {\displaystyle k} -1)-cells.
References
