狗舍
发表于 2025-3-28 17:31:00
https://doi.org/10.1007/978-3-658-13126-5 aim is to introduce a specific combinatorial technique, called word reversing, which is needed in Chapter III to extend the braid action of Chapter I on LD-systems. The third aim is to develop the techinque of word reversing in a general framework, so as to be able to apply it to a certain group.in Chapter VIII.
受辱
发表于 2025-3-28 18:47:21
http://reply.papertrans.cn/20/1902/190123/190123_42.png
indices
发表于 2025-3-29 02:49:09
http://reply.papertrans.cn/20/1902/190123/190123_43.png
Tinea-Capitis
发表于 2025-3-29 04:05:31
http://reply.papertrans.cn/20/1902/190123/190123_44.png
完成
发表于 2025-3-29 11:03:08
http://reply.papertrans.cn/20/1902/190123/190123_45.png
无表情
发表于 2025-3-29 15:27:08
Braids vs. Self-Distributive Systemss based on the concrete idea of colouring the strands of a braid, and left selfdistributivity arises as a natural compatibility condition. At this early stage, some of the constructions may look artificial or strange: it will be one of the aims of the subsequent chapters, in particular in Part B of
侵略主义
发表于 2025-3-29 16:00:20
Word Reversing aim is to introduce a specific combinatorial technique, called word reversing, which is needed in Chapter III to extend the braid action of Chapter I on LD-systems. The third aim is to develop the techinque of word reversing in a general framework, so as to be able to apply it to a certain group.in
Insufficient
发表于 2025-3-29 20:18:17
The Braid Orderarger than 1 are characterized as those braids admitting an expression where the generator with smaller index appears positively only.where some letter . occurs, but the letter σ.does not, nor does any letter σ. with .i. The order is decidable.there exists an effective algorithm that compares any tw
侵略主义
发表于 2025-3-30 03:49:59
http://reply.papertrans.cn/20/1902/190123/190123_49.png
煤渣
发表于 2025-3-30 05:50:33
Normal Formsequivalent. Here, we prove normal form results: we construct several families of distinguished terms such that every term is LD-equivalent to exactly one term in the family. This gives alternative solutions to the word problem, as two terms are LD-equivalent if and only if their normal forms are equ