Daan Krammer
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Daan Krammer has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Eddy Godelle2 shared publications
- François Digne
Laboratoire Amiénois de Mathématique Fondamentale et Appliquée, Université de Picardie-Jules Verne, CNRS, Amiens, France
2 shared publications - Jean Michel
Univ Paris 07, CNRS UMR 7586, Inst Math Jussieu, F-75013 Paris, France
2 shared publications - Patrick Dehornoy
Université de Caen
2 shared publications
Latest Publications
- Open Access
Addenda to "Foundations of Garside Theory"
This text consists of additions to the book "Foundations of Garside Theory", EMS Tracts in Mathematics, vol. 22 (2015) -- see introduction and table of contents in arXiv:1309.0796 -- namely skipped proofs and solutions to selected exercises.
Open AccessAddenda to "Foundations of Garside Theory"
This text consists of additions to the book "Foundations of Garside Theory", EMS Tracts in Mathematics, vol. 22 (2015) -- see introduction and table of contents in arXiv:1309.0796 -- namely skipped proofs and solutions to selected exercises.
- Open Access
Foundations of Garside Theory
This text consists of the introduction, table of contents, and bibliography of a long manuscript (703 pages) that is currently submitted for publication. This manuscript develops an extension of Garside's approach to braid groups and provides a unified treatment for the various algebraic structures that appear in this context. The complete text can be found at http://www.math.unicaen.fr/~garside/Garside.pdf.
Open AccessFoundations of Garside Theory
This text consists of the introduction, table of contents, and bibliography of a long manuscript (703 pages) that is currently submitted for publication. This manuscript develops an extension of Garside's approach to braid groups and provides a unified treatment for the various algebraic structures that appear in this context. The complete text can be found at http://www.math.unicaen.fr/~garside/Garside.pdf.
- 1 January 2013
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 5 (2)
An asymmetric generalisation of Artin monoids
.We propose a slight weakening of the definitions of Artin monoids and Coxeter monoids. We study one `infinite series' in detail.
- 1 January 2013
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 5 (2)
An asymmetric generalisation of Artin monoids
.We propose a slight weakening of the definitions of Artin monoids and Coxeter monoids. We study one `infinite series' in detail.
- 28 September 2007
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 76 (2) , 293-312
The braid group of ℤ n
- 28 September 2007
- Published by Wiley in Journal of the London Mathematical Society
- Vol. 76 (2) , 293-312
The braid group of ℤ n
- Open Access
Generalisations of the Tits representation
We construct a group K_n with properties similar to infinite Coxeter groups. In particular, it has a geometric representation featuring hyperplanes and simplicial chambers. The generators of K_n are given by 2-element subsets of {0, .., n}. We give some easy combinatorial results on the finite residues of K_n.
Open AccessGeneralisations of the Tits representation
We construct a group K_n with properties similar to infinite Coxeter groups. In particular, it has a geometric representation featuring hyperplanes and simplicial chambers. The generators of K_n are given by 2-element subsets of {0, .., n}. We give some easy combinatorial results on the finite residues of K_n.
- Open Access
The braid group of Z^n
We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n) which we call the braid group of Z^n, and which bears some vague resemblance to mapping class groups. It is to GL(n,Z) what the braid group is to the symmetric group S_n. We prove that B is a pseudo-Garside group. We give a small presentation for B(Z^n) assuming one for B(Z^3) is given.
Open AccessThe braid group of Z^n
We define pseudo-Garside groups and prove a theorem about them parallel to Garside's result on the word problem for the usual braid groups. The main novelty is that the set of simple elements can be infinite. We introduce a group B=B(Z^n) which we call the braid group of Z^n, and which bears some vague resemblance to mapping class groups. It is to GL(n,Z) what the braid group is to the symmetric group S_n. We prove that B is a pseudo-Garside group. We give a small presentation for B(Z^n) assuming one for B(Z^3) is given.