词条 | Symmetric inverse semigroup |
释义 |
In abstract algebra, the set of all partial bijections on a set X ({{aka}} one-to-one partial transformations) forms an inverse semigroup, called the symmetric inverse semigroup[1] (actually a monoid) on X. The conventional notation for the symmetric inverse semigroup on a set X is [2] or [3] In general is not commutative. Details about the origin of the symmetric inverse semigroup are available in the discussion on the origins of the inverse semigroup. Finite symmetric inverse semigroupsWhen X is a finite set {1, ..., n}, the inverse semigroup of one-one partial transformations is denoted by Cn and its elements are called charts or partial symmetries.[4] The notion of chart generalizes the notion of permutation. A (famous) example of (sets of) charts are the hypomorphic mapping sets from the reconstruction conjecture in graph theory.[5] The cycle notation of classical, group-based permutations generalizes to symmetric inverse semigroups by the addition of a notion called a path, which (unlike a cycle) ends when it reaches the "undefined" element; the notation thus extended is called path notation.[6] See also
Notes1. ^{{cite book|author=Pierre A. Grillet|title=Semigroups: An Introduction to the Structure Theory|url=https://books.google.com/books?id=yM544W1N2UUC&pg=PA228|year=1995|publisher=CRC Press|isbn=978-0-8247-9662-4|page=228}} 2. ^Hollings 2014, p. 252 3. ^Ganyushkin and Mazorchuk 2008, p. v 4. ^Lipscomb 1997, p. 1 5. ^Lipscomb 1997, p. xiii 6. ^Lipscomb 1997, p. xiii References
2 : Semigroup theory|Algebraic structures |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。