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 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.
Property | Value |
---|---|
dbo:abstract |
|
dbo:wikiPageID |
|
dbo:wikiPageLength |
|
dbo:wikiPageRevisionID |
|
dbo:wikiPageWikiLink | |
dbp:wikiPageUsesTemplate | |
dcterms:subject | |
gold:hypernym | |
rdf:type | |
rdfs:comment |
|
rdfs:label |
|
owl:sameAs | |
prov:wasDerivedFrom | |
foaf:isPrimaryTopicOf | |
is dbo:wikiPageDisambiguates of | |
is dbo:wikiPageRedirects of | |
is dbo:wikiPageWikiLink of | |
is foaf:primaryTopic of |