Semigroup Algebra
In abstract algebra, a monoid ring is a ring constructed from a ring and a monoid, just as a group ring is constructed from a ring and a group. Definition Let ''R'' be a ring and let ''G'' be a monoid. The monoid ring or monoid algebra of ''G'' over ''R'', denoted ''R'' 'G''or ''RG'', is the set of formal sums \sum_ r_g g, where r_g \in R for each g \in G and ''r''''g'' = 0 for all but finitely many ''g'', equipped with coefficient-wise addition, and the multiplication in which the elements of ''R'' commute with the elements of ''G''. More formally, ''R'' 'G''is the set of functions such that is finite, equipped with addition of functions, and with multiplication defined by : (\phi \psi)(g) = \sum_ \phi(k) \psi(\ell). If ''G'' is a group, then ''R'' 'G''is also called the group ring of ''G'' over ''R''. Universal property Given ''R'' and ''G'', there is a ring homomorphism sending each ''r'' to ''r''1 (where 1 is the identity element of ''G''), and a monoid homomorphism (wher ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Abstract Algebra
In mathematics, more specifically algebra, abstract algebra or modern algebra is the study of algebraic structures. Algebraic structures include groups, rings, fields, modules, vector spaces, lattices, and algebras over a field. The term ''abstract algebra'' was coined in the early 20th century to distinguish this area of study from older parts of algebra, and more specifically from elementary algebra, the use of variables to represent numbers in computation and reasoning. Algebraic structures, with their associated homomorphisms, form mathematical categories. Category theory is a formalism that allows a unified way for expressing properties and constructions that are similar for various structures. Universal algebra is a related subject that studies types of algebraic structures as single objects. For example, the structure of groups is a single object in universal algebra, which is called the ''variety of groups''. History Before the nineteenth century, algebra meant ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Module (mathematics)
In mathematics, a module is a generalization of the notion of vector space in which the field of scalars is replaced by a ring. The concept of ''module'' generalizes also the notion of abelian group, since the abelian groups are exactly the modules over the ring of integers. Like a vector space, a module is an additive abelian group, and scalar multiplication is distributive over the operation of addition between elements of the ring or module and is compatible with the ring multiplication. Modules are very closely related to the representation theory of groups. They are also one of the central notions of commutative algebra and homological algebra, and are used widely in algebraic geometry and algebraic topology. Introduction and definition Motivation In a vector space, the set of scalars is a field and acts on the vectors by scalar multiplication, subject to certain axioms such as the distributive law. In a module, the scalars need only be a ring, so the module conc ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Springer-Verlag
Springer Science+Business Media, commonly known as Springer, is a German multinational publishing company of books, e-books and peer-reviewed journals in science, humanities, technical and medical (STM) publishing. Originally founded in 1842 in Berlin, it expanded internationally in the 1960s, and through mergers in the 1990s and a sale to venture capitalists it fused with Wolters Kluwer and eventually became part of Springer Nature in 2015. Springer has major offices in Berlin, Heidelberg, Dordrecht, and New York City. History Julius Springer founded Springer-Verlag in Berlin in 1842 and his son Ferdinand Springer grew it from a small firm of 4 employees into Germany's then second largest academic publisher with 65 staff in 1872.Chronology ". Springer Science+Business Media. In 1964, Springer expanded its business internationally, o ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Puiseux Series
In mathematics, Puiseux series are a generalization of power series that allow for negative and fractional exponents of the indeterminate. For example, the series : \begin x^ &+ 2x^ + x^ + 2x^ + x^ + x^5 + \cdots\\ &=x^+ 2x^ + x^ + 2x^ + x^ + x^ + \cdots \end is a Puiseux series in the indeterminate . Puiseux series were first introduced by Isaac Newton in 1676 and rediscovered by Victor Puiseux in 1850.Puiseux (1850, 1851) The definition of a Puiseux series includes that the denominators of the exponents must be bounded. So, by reducing exponents to a common denominator , a Puiseux series becomes a Laurent series in a th root of the indeterminate. For example, the example above is a Laurent series in x^. Because a complex number has th roots, a convergent Puiseux series typically defines functions in a neighborhood of . Puiseux's theorem, sometimes also called the Newton–Puiseux theorem, asserts that, given a polynomial equation P(x,y)=0 with complex coefficient ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Free Algebra
In mathematics, especially in the area of abstract algebra known as ring theory, a free algebra is the noncommutative analogue of a polynomial ring since its elements may be described as "polynomials" with non-commuting variables. Likewise, the polynomial ring may be regarded as a free commutative algebra. Definition For ''R'' a commutative ring, the free (associative, unital) algebra on ''n'' indeterminates is the free ''R''-module with a basis consisting of all words over the alphabet (including the empty word, which is the unit of the free algebra). This ''R''-module becomes an ''R''-algebra by defining a multiplication as follows: the product of two basis elements is the concatenation of the corresponding words: :\left(X_X_ \cdots X_\right) \cdot \left(X_X_ \cdots X_\right) = X_X_ \cdots X_X_X_ \cdots X_, and the product of two arbitrary ''R''-module elements is thus uniquely determined (because the multiplication in an ''R''-algebra must be ''R''-bilinear). This ''R''- ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Semigroup
In mathematics, a semigroup is an algebraic structure consisting of a set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplicatively: ''x''·''y'', or simply ''xy'', denotes the result of applying the semigroup operation to the ordered pair . Associativity is formally expressed as that for all ''x'', ''y'' and ''z'' in the semigroup. Semigroups may be considered a special case of magmas, where the operation is associative, or as a generalization of groups, without requiring the existence of an identity element or inverses. The closure axiom is implied by the definition of a binary operation on a set. Some authors thus omit it and specify three axioms for a group and only one axiom (associativity) for a semigroup. As in the case of groups or magmas, the semigroup operation need not be commutative, so ''x''·''y'' is not necessarily equal to ''y''·''x''; a well-known example of an operation that is as ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Polynomial
In mathematics, a polynomial is an expression consisting of indeterminates (also called variables) and coefficients, that involves only the operations of addition, subtraction, multiplication, and positive-integer powers of variables. An example of a polynomial of a single indeterminate is . An example with three indeterminates is . Polynomials appear in many areas of mathematics and science. For example, they are used to form polynomial equations, which encode a wide range of problems, from elementary word problems to complicated scientific problems; they are used to define polynomial functions, which appear in settings ranging from basic chemistry and physics to economics and social science; they are used in calculus and numerical analysis to approximate other functions. In advanced mathematics, polynomials are used to construct polynomial rings and algebraic varieties, which are central concepts in algebra and algebraic geometry. Etymology The word ''polynomial'' join ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Natural Number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country"). Numbers used for counting are called ''Cardinal number, cardinal numbers'', and numbers used for ordering are called ''Ordinal number, ordinal numbers''. Natural numbers are sometimes used as labels, known as ''nominal numbers'', having none of the properties of numbers in a mathematical sense (e.g. sports Number (sports), jersey numbers). Some definitions, including the standard ISO/IEC 80000, ISO 80000-2, begin the natural numbers with , corresponding to the non-negative integers , whereas others start with , corresponding to the positive integers Texts that exclude zero from the natural numbers sometimes refer to the natural numbers together with zero as the whole numbers, while in other writings, that term is used instead for the integers (including negative integers). The natural ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Free Module
In mathematics, a free module is a module that has a basis – that is, a generating set consisting of linearly independent elements. Every vector space is a free module, but, if the ring of the coefficients is not a division ring (not a field in the commutative case), then there exist non-free modules. Given any set and ring , there is a free -module with basis , which is called the ''free module on'' or ''module of formal'' -''linear combinations'' of the elements of . A free abelian group is precisely a free module over the ring of integers. Definition For a ring R and an R-module M, the set E\subseteq M is a basis for M if: * E is a generating set for M; that is to say, every element of M is a finite sum of elements of E multiplied by coefficients in R; and * E is linearly independent, that is, for every subset \ of distinct elements of E, r_1 e_1 + r_2 e_2 + \cdots + r_n e_n = 0_M implies that r_1 = r_2 = \cdots = r_n = 0_R (where 0_M is the zero element of M and 0_R is t ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ring (algebra)
In mathematics, rings are algebraic structures that generalize fields: multiplication need not be commutative and multiplicative inverses need not exist. In other words, a ''ring'' is a Set (mathematics), set equipped with two binary operations satisfying properties analogous to those of addition and multiplication of integers. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, function (mathematics), functions, and power series. Formally, a ''ring'' is an abelian group whose operation is called ''addition'', with a second binary operation called ''multiplication'' that is Associative property, associative, is Distributive property, distributive over the addition operation, and has a multiplicative identity element. (Some authors use the term "rng (algebra), " with a missing i to refer to the more general structure that omits this last requirement; see .) Whether a ring is commutati ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Kernel (set Theory)
In set theory, the kernel of a function f (or equivalence kernel.) may be taken to be either * the equivalence relation on the function's domain that roughly expresses the idea of "equivalent as far as the function f can tell",. or * the corresponding partition of the domain. An unrelated notion is that of the kernel of a non-empty family of sets \mathcal, which by definition is the intersection of all its elements: \ker \mathcal ~=~ \bigcap_ \, B. This definition is used in the theory of filters to classify them as being free or principal. Definition For the formal definition, let f : X \to Y be a function between two sets. Elements x_1, x_2 \in X are ''equivalent'' if f\left(x_1\right) and f\left(x_2\right) are equal, that is, are the same element of Y. The kernel of f is the equivalence relation thus defined. The is \ker \mathcal ~:=~ \bigcap_ B. The kernel of \mathcal is also sometimes denoted by \cap \mathcal. The kernel of the empty set, \ker \varnothing, is ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Monoid Homomorphism
In abstract algebra, a branch of mathematics, a monoid is a set equipped with an associative binary operation and an identity element. For example, the nonnegative integers with addition form a monoid, the identity element being 0. Monoids are semigroups with identity. Such algebraic structures occur in several branches of mathematics. The functions from a set into itself form a monoid with respect to function composition. More generally, in category theory, the morphisms of an object to itself form a monoid, and, conversely, a monoid may be viewed as a category with a single object. In computer science and computer programming, the set of strings built from a given set of characters is a free monoid. Transition monoids and syntactic monoids are used in describing finite-state machines. Trace monoids and history monoids provide a foundation for process calculi and concurrent computing. In theoretical computer science, the study of monoids is fundamental for automata theo ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |