標(biāo)題: Titlebook: Braids and Self-Distributivity; Patrick Dehornoy Book 2000 Springer Basel AG 2000 Group theory.Gruppentheorie.Knot theory.algebra.algebrai [打印本頁] 作者: inroad 時間: 2025-3-21 17:12
書目名稱Braids and Self-Distributivity影響因子(影響力)
書目名稱Braids and Self-Distributivity影響因子(影響力)學(xué)科排名
書目名稱Braids and Self-Distributivity網(wǎng)絡(luò)公開度
書目名稱Braids and Self-Distributivity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Braids and Self-Distributivity被引頻次
書目名稱Braids and Self-Distributivity被引頻次學(xué)科排名
書目名稱Braids and Self-Distributivity年度引用
書目名稱Braids and Self-Distributivity年度引用學(xué)科排名
書目名稱Braids and Self-Distributivity讀者反饋
書目名稱Braids and Self-Distributivity讀者反饋學(xué)科排名
作者: corporate 時間: 2025-3-21 22:41
0743-1643 d in low dimensional topology for more than twenty years, in particular in work by Joyce, Brieskorn, Kauffman and their students. Brieskorn mentions that the co978-3-0348-9568-2978-3-0348-8442-6Series ISSN 0743-1643 Series E-ISSN 2296-505X 作者: 教義 時間: 2025-3-22 04:20
The Geometry Monoiding on terms, so that the LD-equivalence class of a term is its orbit under the action. The aim of this chapter is to study the monoid G.involved in this action, which we call the geometry monoid of.as it captures a number of geometrical relations involving left self-distributivity.作者: LITHE 時間: 2025-3-22 04:54 作者: CHANT 時間: 2025-3-22 10:31
LD-Monoids the structure, and that adding an associative product is essentially trivial. However, the case of braid exponentiation is not so simple, and applying the above mentioned completion scheme requires considering the extended braids of Section I.4.作者: 古代 時間: 2025-3-22 16:05
Elementary Embeddingsnly consists in one more example but one that has played a crucial role in the subject, and still does, as some of the algebraic results it leads to have so far received no alternative proof, as we shall see in Chapter XIII.作者: 極小量 時間: 2025-3-22 20:06 作者: ingestion 時間: 2025-3-22 22:55 作者: 有抱負者 時間: 2025-3-23 04:54 作者: 解開 時間: 2025-3-23 08:42
The Group of Left Self-Distributivitycise content of our slogan: “The geometry of left self-distributivity is an extension of the geometry of braids.” Many results about. and .originate in this connection. In particular, braid exponentiation and braid ordering come from an operation and a relation on . that somehow explain them and make their construction natural.作者: 干涉 時間: 2025-3-23 10:45
0743-1643 called LD- systems), which are sets equipped with a binary operation satisfying the left self-distributivity identity x(yz) = (xy)(xz). (LD) Such connections appeared in set theory in the 1980s and led to the discovery in 1991 of a left invariant linear order on the braid groups. Braids and self-dis作者: Outwit 時間: 2025-3-23 15:25 作者: 冰雹 時間: 2025-3-23 19:13
L?schmittel in der Brandbek?mpfungr . occurs, but the letter σ.does not, nor does any letter σ. with .i. The order is decidable.there exists an effective algorithm that compares any two given braid words, it is compatible with multiplication on one side, and the set. of all braids is order isomorphic to the rationals.作者: 獎牌 時間: 2025-3-24 01:27 作者: 吹牛需要藝術(shù) 時間: 2025-3-24 05:40
Braids vs. Self-Distributive Systemsly 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 this book, to explain them and hopefully make all of them natural.作者: 純樸 時間: 2025-3-24 09:32 作者: 腐蝕 時間: 2025-3-24 13:31
The Order on Positive Braidsociates with every positive braid a normal form consisting in a finite tree; the order of positive braids is then a lexicographical ordering for the associated trees, and one deduces that the order type of . is the ordinal ..作者: 劇毒 時間: 2025-3-24 16:00 作者: Assemble 時間: 2025-3-24 19:52 作者: arrhythmic 時間: 2025-3-25 00:24
,L?sungen zu den Situationsaufgaben, the structure, and that adding an associative product is essentially trivial. However, the case of braid exponentiation is not so simple, and applying the above mentioned completion scheme requires considering the extended braids of Section I.4.作者: Strength 時間: 2025-3-25 04:47 作者: 怪物 時間: 2025-3-25 11:19
Gerhard Lagaly,F. Horst Müller,Armin Weiss previous argument is not a proof in the usual sense, and another proof has to be found, typically a combinatorial argument involving only intrinsically finite objects. Unfortunately (or fortunately...), no such proof is known to date, and it is only known that such a proof, if it exists, has to be very complicated in some sense.作者: 無政府主義者 時間: 2025-3-25 14:55 作者: Ibd810 時間: 2025-3-25 19:33
Entwicklung des Containerverkehrs,So far we have described several examples of LD-systems: conjugacy of a group, braid exponentiation, injection bracket. . this chapter, we give new examples, and mention some general results about LD-systems, and about those special families obtained by prescribing additional identities.作者: ACRID 時間: 2025-3-25 20:13
Orders on Free LD-systemsHere, we begin our study of free LD-systems, which will be continued in the following four chapters. The main result of this chapter is that every free LD-system admits a canonical linear ordering. We deduce a solution for the word problem of left self-distributivity, and a simple criterion for recognizing free LD-systems.作者: anaphylaxis 時間: 2025-3-26 03:31
More LD-SystemsSo far we have described several examples of LD-systems: conjugacy of a group, braid exponentiation, injection bracket. . this chapter, we give new examples, and mention some general results about LD-systems, and about those special families obtained by prescribing additional identities.作者: 多產(chǎn)子 時間: 2025-3-26 04:24
,Das Poincarésche Randwertproblem,s 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-26 10:06
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作者: wangle 時間: 2025-3-26 15:04
L?schmittel in der Brandbek?mpfungarger 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-26 20:04
Was ist Feuer? Was ist ein Brand?,o letter σ.occurs. The main result is Laver’s theorem that the restriction of <. to . is a well ordering. Here we follow Burckel’s approach, which associates with every positive braid a normal form consisting in a finite tree; the order of positive braids is then a lexicographical ordering for the a作者: 不能妥協(xié) 時間: 2025-3-26 22:29 作者: 天真 時間: 2025-3-27 02:35 作者: Limousine 時間: 2025-3-27 08:35
https://doi.org/10.1007/978-3-662-31559-0vity, we cannot obtain a group by merely using a projection. However, we know a family of relations holding in.namely these LD-relations that define Ξ+, and we have observed that many properties of. can be established by using these relations exclusively. In this chapter, we investigate the abstract作者: aquatic 時間: 2025-3-27 11:09 作者: ETCH 時間: 2025-3-27 14:14
,L?sungen zu den Situationsaufgaben,Here we study such double structures, called LD-monoids. In particular, we discuss the question of completing a given LD-system into an LD-monoid. We give two solutions, and deduce a complete description of free LD-monoids. The global conclusion is that the self-distributive operation is the core of作者: 耕種 時間: 2025-3-27 20:57
,L?sungen: Zusatzaufgaben Kassenbericht,give a self-contained exposition of the subject by extracting those minimal results necessary for the construction, and assuming no knowledge of set theory. However, the chapter can be used as a black box leading to exportable results like Proposition 4.11. Actually, it can even be skipped, for it o作者: Panther 時間: 2025-3-28 00:29
Gerhard Lagaly,F. Horst Müller,Armin WeissII gives new properties of A. in particular the result that the period in the first row of A. goes to infinity with.The unusual point here is that the result is established using the existence of a self-similar rank as an hypothesis, and we know that this is an unprovable logical statement. Thus the作者: 粗俗人 時間: 2025-3-28 05:54
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 Chapter VIII.作者: 意外 時間: 2025-3-28 08:10
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 equal, but also new applications.作者: 外向者 時間: 2025-3-28 12:25
Braids and Self-Distributivity978-3-0348-8442-6Series ISSN 0743-1643 Series E-ISSN 2296-505X 作者: 狗舍 時間: 2025-3-28 17:31
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 作者: indices 時間: 2025-3-29 02:49 作者: Tinea-Capitis 時間: 2025-3-29 04:05 作者: 完成 時間: 2025-3-29 11:03 作者: 無表情 時間: 2025-3-29 15:27
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
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
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 作者: 煤渣 時間: 2025-3-30 05:50
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作者: habitat 時間: 2025-3-30 08:44 作者: 慟哭 時間: 2025-3-30 13:29 作者: 偉大 時間: 2025-3-30 19:38
