- totally irreducible
- мат. вполне неприводимый
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Irreducible complexity — This article covers irreducible complexity as used by those who argue for intelligent design. For information on irreducible complexity as used in Systems Theory, see Irreducible complexity (Emergence). Irreducible complexity (IC) is an argument… … Wikipedia
Totally real number field — In number theory, a number field K is called totally real if for each embedding of K into the complex numbers the image lies inside the real numbers. Equivalent conditions on K , a finite extension of the rational number field Q, are that K is… … Wikipedia
Eisenstein's criterion — In mathematics, Eisenstein s criterion gives sufficient conditions for a polynomial to be irreducible over the rational numbers (or equivalently, over the integers; see Gauss s lemma). Suppose we have the following polynomial with integer… … Wikipedia
Matroid — In combinatorics, a branch of mathematics, a matroid ( /ˈmeɪ … Wikipedia
Dualism (philosophy of mind) — René Descartes s illustration of dualism. Inputs are passed on by the sensory organs to the epiphysis in the brain and from there to the immaterial spirit. In philosophy of mind, dualism is a set of views about the relationship between mind and… … Wikipedia
Cubic field — In mathematics, specifically the area of algebraic number theory, a cubic field is an algebraic number field of degree three. Contents 1 Definition 2 Examples 3 Galois closure 4 … Wikipedia
Intelligent design — This article is about intelligent design as promulgated by the Discovery Institute. For other uses, see Intelligent design (disambiguation). For the philosophical argument from design , see Teleological argument … Wikipedia
Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… … Wikipedia
Young tableau — In mathematics, a Young tableau (pl.: tableaux ) is a combinatorial object useful in representation theory. It provides a convenient way to describe the group representations of the symmetric and general linear groups and to study their… … Wikipedia
Symmetric group — Not to be confused with Symmetry group. A Cayley graph of the symmetric group S4 … Wikipedia
System of imprimitivity — The concept of system of imprimitivity is used in mathematics, particularly in algebra and analysis, both within the context of the theory of group representations. It was used by George Mackey as the basis for his theory of induced unitary… … Wikipedia