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 monoid is the set of positive [[integer]]s with [[multiplication]] as the operatio Formally, a monoid is set ''M'' with a binary operation <math>\star</math> satisfying the foll
    3 KB (526 words) - 11:02, 23 December 2008
  • 120 bytes (15 words) - 02:21, 9 November 2008
  • #REDIRECT [[Monoid#Free monoid]]
    32 bytes (4 words) - 15:36, 13 November 2008
  • #REDIRECT [[Monoid]]
    20 bytes (2 words) - 15:41, 13 November 2008
  • 171 bytes (21 words) - 17:11, 13 November 2008
  • 843 bytes (135 words) - 02:16, 9 November 2008

Page text matches

  • #REDIRECT [[Monoid#Free monoid]]
    32 bytes (4 words) - 15:36, 13 November 2008
  • #REDIRECT [[Monoid]]
    20 bytes (2 words) - 12:11, 23 December 2008
  • #REDIRECT [[Monoid]]
    20 bytes (2 words) - 15:41, 13 November 2008
  • ...ar to but less stringent than those of a group. A motivating example of a monoid is the set of positive [[integer]]s with [[multiplication]] as the operatio Formally, a monoid is set ''M'' with a binary operation <math>\star</math> satisfying the foll
    3 KB (526 words) - 11:02, 23 December 2008
  • Algebraic structure with two operations, combining an abelian group with a monoid.
    118 bytes (15 words) - 07:43, 15 June 2008
  • ...e generator. The functions of finite support on a monoid ''M'' form the [[monoid ring]] ''R''[''M'']. ...tion as taking the [[free monoid]] ''S'' on the set Λ and then forming the monoid ring ''R''[''S''].
    4 KB (604 words) - 23:54, 20 February 2010
  • {{r|Monoid}}
    749 bytes (92 words) - 16:43, 11 January 2010
  • ...sition form a [[monoid]]. With ''N'' functions, then one may visualize the monoid as a full [[k-ary tree|N-ary tree]] or a [[Cayley tree]].
    2 KB (327 words) - 15:52, 27 October 2008
  • {{r|Monoid}}
    714 bytes (111 words) - 02:44, 9 November 2008
  • {{r|Monoid}}
    965 bytes (124 words) - 17:23, 11 January 2010
  • {{r|Monoid}}
    654 bytes (81 words) - 13:36, 29 November 2008
  • {{r|Monoid}}
    969 bytes (124 words) - 18:42, 11 January 2010
  • {{r|Free monoid}}
    910 bytes (146 words) - 16:55, 13 November 2008
  • ...y element is one of the properties of a [[group (mathematics)|group]] or [[monoid]].
    927 bytes (140 words) - 15:33, 8 December 2008
  • * Many algebraic structures such as a [[monoid]], [[group (mathematics)|group]] or [[vector space]] have a distinguished e
    1 KB (168 words) - 12:06, 22 November 2008
  • {{r|Monoid}}
    1 KB (187 words) - 20:18, 11 January 2010
  • {{r|Monoid}}
    2 KB (247 words) - 06:00, 7 November 2010
  • {{r|Monoid}}
    2 KB (247 words) - 17:28, 11 January 2010
  • ...ime divisors are discussed is when this semi-group is the multiplicative [[monoid]] of a commutative ring with identity. Also, divisors are also occasionall
    2 KB (359 words) - 18:39, 2 December 2008
  • ...this operation is the empty string. (So far we have described the [[free monoid]] on the alphabet.) We define the inverse of a word to be the word obtaine
    2 KB (436 words) - 02:56, 15 November 2008
  • * Every [[monoid]] is a semigroup, by "forgetting" the identity element.
    3 KB (405 words) - 16:21, 13 November 2008
  • | [[monoid]] | [[monoid]]
    18 KB (2,669 words) - 08:38, 17 April 2024
  • == Matrix monoid <math>\mathit{SO}(\mathbb{Z}_+, 2)</math> == ...Furthermore,&nbsp; <math>\mathit{SO}(\mathbb{Z}_+, 2)</math>&nbsp; is a [[monoid]] with respect to the matrix multiplication.
    35 KB (5,836 words) - 08:40, 15 March 2021
  • ...ing classes of fuzzy subalgebras. In such a case a fuzzy subset ''s'' of a monoid (M,•,'''u''') is a fuzzy submonoid if and only if
    4 KB (725 words) - 01:25, 12 December 2008
  • ...',·) is ''not'' a group. The most we can say is that it is a commutative [[monoid]]. ...minate the requirement that every element have an inverse, then we get a [[monoid]].
    19 KB (3,074 words) - 11:11, 13 February 2009
  • ...or multiplication say that '''Z''' under multiplication is a [[commutative monoid]]. However, note that not every integer has a multiplicative inverse; e.g.
    10 KB (1,566 words) - 08:34, 2 March 2024
  • ...For instance, they can be defined as the [[convolution algebra]] of the [[monoid]] of non-negative powers of the generator ''X'' of a cyclic group. This me
    10 KB (1,741 words) - 10:04, 3 January 2009