Search results
Jump to navigation
Jump to search
Page title matches
- ...ar to but less stringent than those of a group. A motivating example of a semigroup is the set of positive [[integer]]s with [[multiplication]] as the operatio Formally, a semigroup is a set ''S'' with a binary operation <math>\star</math> satisfying the fo3 KB (405 words) - 16:21, 13 November 2008
- 96 bytes (11 words) - 02:19, 9 November 2008
- #REDIRECT [[Semigroup#Free semigroup]]38 bytes (4 words) - 15:08, 13 November 2008
- * {{cite book | author=John M. Howie | title=Fundamentals of Semigroup Theory | publisher=[[Oxford University Press]] | year=1995 | isbn=0-19-8511166 bytes (21 words) - 16:04, 13 November 2008
- #REDIRECT [[Semigroup#Congruences]]35 bytes (3 words) - 16:19, 13 November 2008
- 714 bytes (111 words) - 02:44, 9 November 2008
Page text matches
- #REDIRECT [[Semigroup#Free semigroup]]38 bytes (4 words) - 15:08, 13 November 2008
- ...ar to but less stringent than those of a group. A motivating example of a semigroup is the set of positive [[integer]]s with [[multiplication]] as the operatio Formally, a semigroup is a set ''S'' with a binary operation <math>\star</math> satisfying the fo3 KB (405 words) - 16:21, 13 November 2008
- #REDIRECT [[Semigroup#Congruences]]35 bytes (3 words) - 16:19, 13 November 2008
- * {{cite book | author=John M. Howie | title=Fundamentals of Semigroup Theory | publisher=[[Oxford University Press]] | year=1995 | isbn=0-19-8511166 bytes (21 words) - 16:04, 13 November 2008
- {{r|Quotient semigroup}}355 bytes (52 words) - 05:46, 9 January 2024
- * Subsemigroups of a [[semigroup]] ''S''. The semigroup generated by a subset ''A'' may also be obtained as the set of all finite p2 KB (414 words) - 03:00, 14 February 2010
- {{r|Semigroup}}654 bytes (81 words) - 13:36, 29 November 2008
- {{r|Semigroup}}969 bytes (124 words) - 18:42, 11 January 2010
- {{r|Semigroup}}843 bytes (135 words) - 02:16, 9 November 2008
- {{r|Free semigroup}}910 bytes (146 words) - 16:55, 13 November 2008
- {{r|Semigroup}}1 KB (187 words) - 19:18, 11 January 2010
- {{r|Semigroup}}2 KB (247 words) - 06:00, 7 November 2010
- {{r|Semigroup}}2 KB (247 words) - 17:28, 11 January 2010
- Notes: This definition makes sense when ''R'' is any commutative [[semigroup]], but virtually the only time divisors are discussed is when this semi-gro2 KB (359 words) - 18:39, 2 December 2008
- ...omain of ''X''. One says that the operator ''-iX'' is the [[generator of a semigroup|generator]] of the group ''U'' and writes: <math>\scriptstyle U_t=e^{-itX},4 KB (709 words) - 06:58, 23 December 2008
- ...inary operation, but might not have an identity element. A [[monoid]] is a semigroup that does have an identity but might not have an inverse for every element.18 KB (2,669 words) - 08:38, 17 April 2024
- <math> (\mathbb N,+) </math> is a semigroup with neutral element 0. It is: <math> (\mathbb N \setminus\{0\},\cdot) </math> is a semigroup with neutral element 1. It is:16 KB (2,562 words) - 00:45, 13 October 2009
- ...xioms define other useful algebraic structures — e.g., [[groupoid]]s and [[semigroup]]s. * If we additionally do not require an identity either, then we get a [[semigroup]].19 KB (3,074 words) - 11:11, 13 February 2009