Rewriting with Frobenius

DOI10.1145/3209108.3209137zbMATH Open1497.68238OpenAlexW2799039080MaRDI QIDQ5145289FDOQ5145289

Fabio Gadducci, Filippo Bonchi, Fabio Zanasi, Paweł Sobociński, Aleks Kissinger

Publication date: 20 January 2021

Published in: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3209108.3209137

Recommendations

• scientific article; zbMATH DE number 522832
• Rewriting as a special case of non-commutative Gröbner basis theory
• Computations with Frobenius Powers
• Applying rewriting methods to special monoids
• Realization of Frobenius functions
• Computing Frobenius maps and factoring polynomials
• Algebra and geometry of rewriting
• Ext and Frobenius
• Rewriting modulo symmetric monoidal structure
• Verschiebung and Frobenius operators

zbMATH Keywords

symmetric monoidal categoryFrobenius algebraPROPDPO graph rewriting

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) String diagrams and graphical calculi (18M30)

Cited In (5)

• String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
• Title not available (Why is that?)
• Title not available (Why is that?)
• String diagram rewrite theory II: Rewriting with symmetric monoidal structure
• String diagram rewrite theory III: Confluence with and without Frobenius

Uses Software

• Quantomatic

This page was built for publication: Rewriting with Frobenius

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