- monomial representation
- мономиальное представление
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Monomial representation — In mathematics, a linear representation ρ of a group G is a monomial representation if there is a finite index subgroup H and a one dimensional linear representation σ of H, such that ρ is equivalent to the induced representation IndHGσ.… … Wikipedia
Monomial — In mathematics, in the context of polynomials, the word monomial can have one of two different meanings: The first is a product of powers of variables, or formally any value obtained by finitely many multiplications of a variable. If only a… … Wikipedia
Induced representation — In mathematics, and in particular group representation theory, the induced representation is one of the major general operations for passing from a representation of a subgroup H to a representation of the (whole) group G itself. It was initially … Wikipedia
Generalized permutation matrix — In mathematics, a generalized permutation matrix (or monomial matrix) is a matrix with the same nonzero pattern as a permutation matrix, i.e. there is exactly one nonzero entry in each row and each column. Unlike a permutation matrix, where the… … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
Littelmann path model — In mathematics, the Littelmann path model is a combinatorial device due to Peter Littelmann for computing multiplicities without overcounting in the representation theory of symmetrisable Kac Moody algebras. Its most important application is to… … Wikipedia
Symmetric polynomial — This article is about individual symmetric polynomials. For the ring of symmetric polynomials, see ring of symmetric functions. In mathematics, a symmetric polynomial is a polynomial P(X1, X2, …, Xn) in n variables, such that if any of the… … Wikipedia
Elementary symmetric polynomial — In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial P can be expressed as a polynomial in elementary… … Wikipedia
Horner scheme — In numerical analysis, the Horner scheme or Horner algorithm, named after William George Horner, is an algorithm for the efficient evaluation of polynomials in monomial form. Horner s method describes a manual process by which one may approximate … Wikipedia
Spinor — In mathematics and physics, in particular in the theory of the orthogonal groups (such as the rotation or the Lorentz groups), spinors are elements of a complex vector space introduced to expand the notion of spatial vector. Unlike tensors, the… … Wikipedia
Complete homogeneous symmetric polynomial — In mathematics, specifically in algebraic combinatorics and commutative algebra, the complete homogeneous symmetric polynomials are a specific kind of symmetric polynomials. Every symmetric polynomial can be expressed as a polynomial expression… … Wikipedia