Polygraphs: From Rewriting to Higher Categories
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916932318396416 |
|---|---|
| author | Ara, Dimitri Burroni, Albert Guiraud, Yves Malbos, Philippe Métayer, François Mimram, Samuel |
| author_facet | Ara, Dimitri Burroni, Albert Guiraud, Yves Malbos, Philippe Métayer, François Mimram, Samuel |
| contents | Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the abstract point of view offered by homotopical algebra. The first half explores the theory of polygraphs in low dimensions and its applications to the computation of the coherence of algebraic structures. It is meant to be progressive, with little requirements on the background of the reader, apart from basic category theory, and is illustrated with algorithmic computations on algebraic structures. The second half introduces and studies the general notion of n-polygraph, dealing with the homotopy theory of those. It constructs the folk model structure on the category of strict higher categories and exhibits polygraphs as cofibrant objects. This allows extending to higher dimensional structures the coherence results developed in the first half. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_00429 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Polygraphs: From Rewriting to Higher Categories Ara, Dimitri Burroni, Albert Guiraud, Yves Malbos, Philippe Métayer, François Mimram, Samuel Category Theory Logic in Computer Science 18N30 (Primary) 18-00, 18C10, 18N40, 68Q42 (Secondary) F.4.2; A.1 Polygraphs are a higher-dimensional generalization of the notion of directed graph. Based on those as unifying concept, this monograph on polygraphs revisits the theory of rewriting in the context of strict higher categories, adopting the abstract point of view offered by homotopical algebra. The first half explores the theory of polygraphs in low dimensions and its applications to the computation of the coherence of algebraic structures. It is meant to be progressive, with little requirements on the background of the reader, apart from basic category theory, and is illustrated with algorithmic computations on algebraic structures. The second half introduces and studies the general notion of n-polygraph, dealing with the homotopy theory of those. It constructs the folk model structure on the category of strict higher categories and exhibits polygraphs as cofibrant objects. This allows extending to higher dimensional structures the coherence results developed in the first half. |
| title | Polygraphs: From Rewriting to Higher Categories |
| topic | Category Theory Logic in Computer Science 18N30 (Primary) 18-00, 18C10, 18N40, 68Q42 (Secondary) F.4.2; A.1 |
| url | https://arxiv.org/abs/2312.00429 |