- unique factorization
- мат. однозначное разложение (на множители)
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Unique factorization domain — In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element, with special exceptions, can be uniquely written as a product of prime elements, analogous to the fundamental theorem of… … Wikipedia
Noncommutative unique factorization domain — In mathematics, the noncommutative unique factorization domain is the noncommutative counterpart of the commutative or classical unique factorization domain (UFD). Example The ring of integral quaternions. If the coefficients a0, a1, a2, a3 are… … Wikipedia
Factorization — This article is about the mathematical concept. For other uses, see Factor and Integer factorization. A visual illustration of the polynomial x2 + cx + d = (x + a)(x + b) where… … Wikipedia
unique — adjective Etymology: French, from Latin unicus, from unus one more at one Date: 1602 1. being the only one ; sole < his unique concern was his own comfort > < I can t walk away with a unique copy. Suppose I lost it? Kingsley Amis > < the unique… … New Collegiate Dictionary
Factorization system — In mathematics, it can be shown that every function can be written as the composite of a surjective function followed by an injective function. Factorization systems are a generalization of this situation in category theory.DefinitionA… … Wikipedia
Unique prime — In mathematics, a unique prime is a certain kind of prime number. A prime p ≠ 2, 5 is called unique if there is no other prime q such that the period length of the decimal expansion of its reciprocal, 1 / p , is equivalent to the period length of … Wikipedia
Non-negative matrix factorization — NMF redirects here. For the bridge convention, see new minor forcing. Non negative matrix factorization (NMF) is a group of algorithms in multivariate analysis and linear algebra where a matrix, , is factorized into (usually) two matrices, and… … Wikipedia
Polynomial factorization — In mathematics and computer algebra, polynomial factorization typically refers to factoring a polynomial into irreducible polynomials over a given field. Formulation of the questionOther factorizations, such as square free factorization exist,… … Wikipedia
Invariant factorization of LPDOs — IntroductionFactorization of linear ordinary differential operators (LODOs) is known to be unique and in general, it finally reduces to the solution of a Riccati equation [http://en.wikipedia.org/wiki/Riccati equation] , i.e. factorization of… … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of … Wikipedia