Skip to main content
SpringerLink
Log in

Garside and Quadratic Normalisation: A Survey

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9168))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adyan, S.I.: Fragments of the word Delta in a braid group. Mat. Zam. Acad. Sci. SSSR 36–1, 25–34 (1984); translated Math. Notes of the Acad. Sci. USSR 36–1, 505–510 (1984)

    Google Scholar 

  2. Albenque, M., Nadeau, P.: Growth function for a class of monoids 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2538 Discrete Math. Theor. Comput. Sci. Proc., AK, Assoc. Discrete Math. Theor. Comput. Sci., Nancy (2009)

    Google Scholar 

  3. Artin, E.: Theory of braids. Ann. of Math. 48, 101–126 (1947)

    Article  MathSciNet  Google Scholar 

  4. Bessis, D., Digne, F., Michel, M.: Springer theory in braid groups and the Birman-Ko-Lee monoid. Pacific J. Math. 205, 287–309 (2002)

    Article  MathSciNet  Google Scholar 

  5. Bokut, L., Chen, Y., Chen, W., Li, J.: New approaches to plactic monoid via Gröbner-Shirshov bases. J. Algebra 423, 301–317 (2015)

    Article  MathSciNet  Google Scholar 

  6. Cain, A., Gray, R., Malheiro, A.: Finite Gröbner-Shirshov bases for Plactic algebras and biautomatic structures for Plactic monoids. J. Algebra 423, 37–52 (2015)

    Article  MathSciNet  Google Scholar 

  7. Birman, J.: Braids, Links, and Mapping Class Groups. Ann. of Math. Studies, 82 (1975). Princeton Univ. Press

    Google Scholar 

  8. Birman, J., Ko, K.H., Lee, S.J.: A new approach to the word problem in the braid groups. Adv. in Math. 139–2, 322–353 (1998)

    Article  MathSciNet  Google Scholar 

  9. Bjorner, A., Brenti, F.: Combinatorics of Coxeter Groups. Graduate Texts in Mathematics, vol. 231, Springer (2005)

    Google Scholar 

  10. Brieskorn, E., Saito, K.: Artin-Gruppen und Coxeter-Gruppen. Invent. Math. 17, 245–271 (1972)

    Article  MathSciNet  Google Scholar 

  11. Cassaigne, J., Espie, M., Krob, D., Novelli, J.C., Hivert, F.: The Chinese monoid. Internat. J. Algebra Comput. 11, 301–334 (2001)

    Article  MathSciNet  Google Scholar 

  12. Charney, R.: Artin groups of finite type are biautomatic. Math. Ann. 292–4, 671–683 (1992)

    Article  MathSciNet  Google Scholar 

  13. Dehornoy, P.: Groupes de Garside. Ann. Sci. Éc. Norm. Supér. 35, 267–306 (2002)

    MathSciNet  Google Scholar 

  14. Dehornoy, P., Paris, L.: Gaussian groups and Garside groups, two generalizations of Artin groups. Proc. London Math. Soc. 79–3, 569–604 (1999)

    Article  MathSciNet  Google Scholar 

  15. Dehornoy, P., Digne, F., Michel, J.: Garside families and Garside germs. J. Algebra 380, 109–145 (2013)

    Article  MathSciNet  Google Scholar 

  16. Dehornoy, P., Gebhardt, V.: Algorithms for Garside calculus. J. Symbolic Comput. 63, 68–116 (2014)

    Article  MathSciNet  Google Scholar 

  17. Dehornoy, P., Digne, F., Godelle, E., Krammer, D., Michel, J.: Foundations of Garside Theory. EMS Tracts in Mathematics, 22 (2015)

    Google Scholar 

  18. Dehornoy, P., Dynnikov, I., Rolfsen, D., Wiest, B.: Ordering Braids Mathematical Surveys and Monographs. Amer. Math. Soc. 148 (2008)

    Google Scholar 

  19. Dehornoy, P., Guiraud, Y.: Quadratic normalisation in monoids. arXiv:1504.02717

  20. Dehornoy, P., Dyer, M., Hohlweg, C.: Garside families in Artin-Tits monoids and low elements in Coxeter groups. Comptes-Rendus Math. 353, 403–408 (2015)

    Article  MathSciNet  Google Scholar 

  21. Dershowitz, N., Jouannaud, J.P.: Rewrite Systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science B: Formal Methods and Semantics, Chap. 6, pp. 243–320. North-Holland (1990)

    Google Scholar 

  22. El-Rifai, E.A., Morton, H.R.: Algorithms for positive braids. Quart. J. Math. Oxford 45–2, 479–497 (1994)

    Article  MathSciNet  Google Scholar 

  23. Epstein, D., Cannon, J., Holt, D., Levy, S., Paterson, M., Thurston, W.: Word Processing in Groups. Jones and Bartlett Publishers (1992)

    Google Scholar 

  24. Garside, F.A.: The braid group and other groups. Quart. J. Math. Oxford 20, 235–254 (1969)

    Article  MathSciNet  Google Scholar 

  25. Gaussent, S., Guiraud, Y., Malbos, P.: Coherent presentations of Artin monoids Compos. Math. (to appear). arXiv:1203.5358

  26. Hess, A., Ozornova, V.: Factorability, string rewriting and discrete Morse theory. arXiv:1412.3025

  27. Hoffmann, M., Thomas, R.M.: A geometric characterisation of automatic semigroups. Theoret. Comput. Sci. 369, 300–313 (2006)

    Article  MathSciNet  Google Scholar 

  28. Howie, J.M.: Fundamentals of Semigroup Theory. Clarendon, Oxford (1995)

    Google Scholar 

  29. Klop, J.W.: Term Rewriting Systems. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol. 2, Chap. 1, pp. 1–117. Oxford University Press (1992)

    Google Scholar 

  30. Krammer, D.: An asymmetric generalisation of Artin monoids Groups Complex. Cryptol. 5, 141–168 (2013)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Mathématiques Nicolas Oresme, CNRS UMR 6139, Université de Caen, 14032, Caen cedex, France

    Patrick Dehornoy

  2. Institut Universitaire de France, Paris, France

    Patrick Dehornoy

Authors
  1. Patrick Dehornoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrick Dehornoy .

Editor information

Editors and Affiliations

  1. University of Liverpool, Liverpool, United Kingdom

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Dehornoy, P. (2015). Garside and Quadratic Normalisation: A Survey. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21500-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21499-3

  • Online ISBN: 978-3-319-21500-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation