Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting

DOI10.4204/EPTCS.380.7arXiv2209.09509MaRDI QIDQ6150149FDOQ6150149

Authors: Amar Hadzihasanovic 

Publication date: 5 March 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Abstract: We present a computational implementation of diagrammatic sets, a model of higher-dimensional diagram rewriting that is "topologically sound": diagrams admit a functorial interpretation as homotopies in cell complexes. This has potential applications both in the formalisation of higher algebra and category theory and in computational algebraic topology. We describe data structures for well-formed shapes of diagrams of arbitrary dimensions and provide a solution to their isomorphism problem in time $O(n^{3}logn)$. On top of this, we define a type theory for rewriting in diagrammatic sets and provide a semantic characterisation of its syntactic category. All data structures and algorithms are implemented in the Python library rewalt, which also supports various visualisations of diagrams.

Full work available at URL: https://arxiv.org/abs/2209.09509

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Higher-dimensional word problems with applications to equational logic
• Graph isomorphism, general remarks
• Graph isomorphism in quasipolynomial time [extended abstract]
• The algebra of directed complexes
• Polygraphic programs and polynomial-time functions
• Data structures for quasistrict higher categories

This page was built for publication: Data Structures for Topologically Sound Higher-Dimensional Diagram Rewriting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150149)