Skip to main content
Conference Proceedings

Garside and quadratic normalisation: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 9168 14-45
DOI: 10.1007/978-3-319-21500-6_2
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Starting from the seminal example of the greedy normal norm in braid monoids, we analyze the mechanism of the normal form in a Garside monoid and explain how it extends to the more general framework of Garside families. Extending the viewpoint even more, we then consider general quadratic normalisation procedures and characterise Garside normalisation among them.

Author supplied keywords

Cite

CITATION STYLE

APA

Dehornoy, P. (2015). Garside and quadratic normalisation: A survey. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9168, pp. 14–45). Springer Verlag. https://doi.org/10.1007/978-3-319-21500-6_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free