License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2015.194
URN: urn:nbn:de:0030-drops-51975
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5197/
Go to the corresponding LIPIcs Volume Portal

Hellström, Lars

Network Rewriting II: Bi- and Hopf Algebras

pdf-format:
17.pdf (0.5 MB)

Abstract

Bialgebras and their specialisation Hopf algebras are algebraic
structures that challenge traditional mathematical notation, in that they sport two core operations that defy the basic functional
paradigm of taking zero or more operands as input and producing one
result as output. On the other hand, these peculiarities do not
prevent studying them using rewriting techniques, if one works within an appropriate network formalism rather than the traditional term formalism. This paper restates the traditional axioms as rewriting systems, demonstrating confluence in the case of bialgebras and finding the (infinite) completion in the case of Hopf algebras. A noteworthy minor problem solved along the way is that of constructing a quasi-order with respect to which the rules are compatible.

BibTeX - Entry

@InProceedings{hellstrm:LIPIcs:2015:5197,
  author =	{Lars Hellstr{\"o}m},
  title =	{{Network Rewriting II: Bi- and Hopf Algebras}},
  booktitle =	{26th International Conference on Rewriting Techniques and Applications (RTA 2015)},
  pages =	{194--208},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-85-9},
  ISSN =	{1868-8969},
  year =	{2015},
  volume =	{36},
  editor =	{Maribel Fern{\'a}ndez},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2015/5197},
  URN =		{urn:nbn:de:0030-drops-51975},
  doi =		{10.4230/LIPIcs.RTA.2015.194},
  annote =	{Keywords: confluence, network, PROP, Hopf algebra}
}

Keywords: confluence, network, PROP, Hopf algebra
Collection: 26th International Conference on Rewriting Techniques and Applications (RTA 2015)
Issue Date: 2015
Date of publication: 18.06.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI