Zobrazeno 1 - 10
of 208
pro vyhledávání: '"Garside theory"'
Autor:
Lopatkin, Viktor
This paper shows how to obtain the key concepts and notations of Garside theory by using the Composition--Diamond lemma. We also show in some cases the greedy normal form is exactly a Gr\"obner--Shirshov normal form and a family of a left-cancellativ
Externí odkaz:
http://arxiv.org/abs/2109.07595
Autor:
Schleimer, Saul, Wiest, Bert
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid braids with a f
Externí odkaz:
http://arxiv.org/abs/1807.01500
Winner of the 2014 EMS Monograph Award! This text is a monograph in algebra, with connections toward geometry and low-dimensional topology. It mainly involves groups, monoids, and categories, and aims at providing a unified treatment for those situat
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.
Externí odkaz:
http://arxiv.org/abs/1412.5299
Publikováno v:
EMS Tracts in Mathematics 22 (2015)
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 unifi
Externí odkaz:
http://arxiv.org/abs/1309.0796
Autor:
Gonzalez-Meneses, Juan, Wiest, Bert
Publikováno v:
Algebr. Geom. Topol. 11 (2011) 2971-3010
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its conjugacy
Externí odkaz:
http://arxiv.org/abs/1008.0238
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Schleimer, Saul1 (AUTHOR) s.schleimer@warwick.ac.uk, Wiest, Bert2 (AUTHOR) bertold.wiest@univ-rennes1.fr
Publikováno v:
Groups Complexity Cryptology. Nov2019, Vol. 11 Issue 2, p61-75. 15p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bert Wiest, Saul Schleimer
Publikováno v:
Groups-Complexity-Cryptology
Groups-Complexity-Cryptology, De Gruyter, 2019, 11 (2), pp.61-75. ⟨10.1515/gcc-2019-2007⟩
journal of Groups, Complexity, Cryptology
journal of Groups, Complexity, Cryptology, 2019, 11 (2), pp.61-75. ⟨10.1515/gcc-2019-2007⟩
Groups-Complexity-Cryptology, De Gruyter, 2019, 11 (2), pp.61-75. ⟨10.1515/gcc-2019-2007⟩
journal of Groups, Complexity, Cryptology
journal of Groups, Complexity, Cryptology, 2019, 11 (2), pp.61-75. ⟨10.1515/gcc-2019-2007⟩
Garside-theoretical solutions to the conjugacy problem in braid groups depend on the determination of a characteristic subset of the conjugacy class of any given braid, e.g. the sliding circuit set. It is conjectured that, among rigid braids with a f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::205e8675e7ba35a51423538c67c8cc4f
http://arxiv.org/abs/1807.01500
http://arxiv.org/abs/1807.01500