principal ideal domain

  • 91Local ring — In abstract algebra, more particularly in ring theory, local rings are certain rings that are comparatively simple, and serve to describe what is called local behaviour , in the sense of functions defined on varieties or manifolds, or of… …

    Wikipedia

  • 92Serial module — Chain ring redirects here. For the bicycle part, see Chainring. In abstract algebra, a uniserial module M is a module over a ring R, whose submodules are totally ordered by inclusion. This means simply that for any two submodules N1 and N2 of M,… …

    Wikipedia

  • 93Cyclic code — In coding theory, cyclic codes are linear block error correcting codes that have convenient algebraic structures for efficient error detection and correction. Contents 1 Definition 2 Algebraic structure 3 Examples …

    Wikipedia

  • 94Integral element — In commutative algebra, an element b of a commutative ring B is said to be integral over its subring A if there are such that That is to say, b is a root of a monic polynomial over A.[1] If B consists of elements that are integral over A, then B… …

    Wikipedia

  • 95Gauss's lemma (polynomial) — This article is about Gauss s lemma for polynomials. See also Gauss s lemma. In algebra, in the theory of polynomials, Gauss s lemma, named after Carl Friedrich Gauss, is either of two related statements about polynomials with integral… …

    Wikipedia

  • 96Ore condition — In mathematics, especially in the area of algebra known as ring theory, the Ore condition is a condition introduced by Øystein Ore, in connection with the question of extending beyond commutative rings the construction of a field of fractions, or …

    Wikipedia

  • 97Stone duality — In mathematics, there is an ample supply of categorical dualities between certain categories of topological spaces and categories of partially ordered sets. Today, these dualities are usually collected under the label Stone duality, since they… …

    Wikipedia

  • 98Inverse semigroup — In mathematics, an inverse semigroup S is a semigroup in which every element x in S has a unique inverse y in S in the sense that x = xyx and y = yxy. Inverse semigroups appear in a range of contexts; for example, they can be employed in the… …

    Wikipedia

  • 99Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… …

    Wikipedia

  • 100List of theorems — This is a list of theorems, by Wikipedia page. See also *list of fundamental theorems *list of lemmas *list of conjectures *list of inequalities *list of mathematical proofs *list of misnamed theorems *Existence theorem *Classification of finite… …

    Wikipedia