idempotent
101Relational algebra — Not to be confused with Relation algebra. Relational algebra, an offshoot of first order logic (and of algebra of sets), deals with a set of finitary relations (see also relation (database)) that is closed under certain operators. These operators …
102Projective module — In mathematics, particularly in abstract algebra and homological algebra, the concept of projective module over a ring R is a more flexible generalisation of the idea of a free module (that is, a module with basis vectors). Various equivalent… …
103Motive (algebraic geometry) — For other uses, see Motive (disambiguation). In algebraic geometry, a motive (or sometimes motif, following French usage) denotes some essential part of an algebraic variety . To date, pure motives have been defined, while conjectural mixed… …
104Glossary of order theory — This is a glossary of some terms used in various branches of mathematics that are related to the fields of order, lattice, and domain theory. Note that there is a structured list of order topics available as well. Other helpful resources might be …
105Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… …
106Linear least squares — is an important computational problem, that arises primarily in applications when it is desired to fit a linear mathematical model to measurements obtained from experiments. The goals of linear least squares are to extract predictions from the… …
107Free monoid — In abstract algebra, the free monoid on a set A is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from A , with the binary operation of concatenation. It is usually denoted A lowast;. The identity… …
108Monad (functional programming) — In functional programming, a monad is a programming structure that represents computations. Monads are a kind of abstract data type constructor that encapsulate program logic instead of data in the domain model. A defined monad allows the… …
109Indecomposable module — In abstract algebra, a module is indecomposable if it is non zero and cannot be written as a direct sum of two non zero submodules.Indecomposable is a weaker notion than simple module:simple means no proper submodule N < M,while indecomposable… …
110Bicyclic semigroup — In mathematics, the bicyclic semigroup is an algebraic object important for the structure theory of semigroups. Although it is in fact a monoid, it is usually referred to as simply a semigroup. The first published description of this object was… …
