"polynomial basis" meaning in All languages combined

{
  "forms": [
    {
      "form": "polynomial bases",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "polynomial bases"
      },
      "expansion": "polynomial basis (plural polynomial bases)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "_dis1": "50 50",
      "word": "Bernstein basis polynomial"
    },
    {
      "_dis1": "50 50",
      "word": "dual basis"
    },
    {
      "_dis1": "50 50",
      "word": "monomial"
    },
    {
      "_dis1": "50 50",
      "word": "normal basis"
    }
  ],
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "61 39",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        }
      ],
      "examples": [
        {
          "text": "2007, Nicos Karcanias, Efstathios Milonidis, 2: Structural Methods for Linear Systems: An Introduction, Matthew C. Turner, Declan G. Bates (editors), Mathematical Methods for Robust and Nonlinear Control: EPSRC Summer School, Springer, Lecture Notes in Control and Information Sciences 367, page 89,\nIf T(s)=M(s)D(s)⁻¹ is a RCMFD of T(s), then M(s) is a polynomial basis for 𝔛_t. If Q(s) is a greatest right divisor of M(s) then T(s)=◌̅M(s)Q(s)D(s)⁻¹, where ◌̅M(s) is a least degree polynomial basis of 𝔛_t [15]."
        },
        {
          "ref": "2009, Jan Flusser, Barbara Zitova, Tomas Suk, Moments and Moment Invariants in Pattern Recognition, Wiley, page 166",
          "text": "When dealing with various polynomial bases up to a certain degree and with corresponding moments, any moment (with respect to any basis) can be expressed as a function of moments of the same or fewer orders with respect to an arbitrary basis.[…]As we already saw in Chapter 1, OG moments are, unlike geometric and all other moments, coordinates of f in the polynomial basis in the common sense used in linear algebra.",
          "type": "quotation"
        },
        {
          "ref": "2012, A. Kominek et al., “Ident. of Low-Compl. LPV-IO Models for Engine Control”, in Javad Mohammadpour, Carsten W. Scherer, editors, Control of Linear Parameter Varying Systems with Applications, Springer, page 452",
          "text": "For this purpose, a polynomial basis is used here, which consists of all monomials in the scheduling signals up to a fixed total order. Such a polynomial basis can be interpreted as the polynomial terms, which would appear in a multivariate Taylor approximation of the unknown scheduling function.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A basis of a polynomial ring (said ring being viewed either as a vector space over the field of coefficients or as a free module over the ring of coefficients)."
      ],
      "hyponyms": [
        {
          "_dis1": "79 21",
          "sense": "basis of a polynomial ring",
          "word": "Bernstein basis"
        },
        {
          "_dis1": "79 21",
          "sense": "basis of a polynomial ring",
          "word": "monomial basis"
        }
      ],
      "id": "en-polynomial_basis-en-noun-ugGHWvyO",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "basis",
          "basis"
        ],
        [
          "polynomial ring",
          "polynomial ring"
        ],
        [
          "vector space",
          "vector space"
        ],
        [
          "field",
          "field"
        ],
        [
          "free module",
          "free module"
        ],
        [
          "ring",
          "ring"
        ]
      ],
      "qualifier": "ring theory",
      "raw_glosses": [
        "(algebra, ring theory) A basis of a polynomial ring (said ring being viewed either as a vector space over the field of coefficients or as a free module over the ring of coefficients)."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Algebra",
          "orig": "en:Algebra",
          "parents": [
            "Mathematics",
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cryptography",
          "orig": "en:Cryptography",
          "parents": [
            "Computer science",
            "Formal sciences",
            "Mathematics",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "1999, I. Blake, G. Seroussi, N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, page 20",
          "text": "When using polynomial bases, the first stage in computing the product of two elements of #x5C;mathbbF#x5F;#x7B;2ⁿ#x7D; is the multiplication of two polynomials of degree at most n-1 in #x5C;mathbbF#x5F;2#x5B;x#x5D;.",
          "type": "quotation"
        },
        {
          "text": "2010, Vladimir Tujillo-Olaya, Jaime Velasco-Medina, Hardware Architectures for Elliptic Curve Cryptoprocessors Using Polynomial and Gaussian Normal Basis Over GF(2²³³), Marina L. Gravrilova, C. J. Kenneth Tan, Edward David Moreno (editors), Transactions on Computational Science XI: Special Issue on Security in Computing, Part 2, Springer, LNCS 6480, page 79,\nIn this case, the GF(2ᵐ) multiplication is implemented in hardware using three algorithms for polynomial basis (PB) and three for gaussian normal basis (GNB)."
        },
        {
          "ref": "2013, Gary L. Mullen, Daniel Panario, Handbook of Finite Fields, Taylor & Francis (Chapman & Hall / CRC Press), page 103",
          "text": "In contrast to the case of normal bases considered in Theorem 5.1.9, the dual basis of a polynomial basis is usually not a polynomial basis.\n[…]\n5.1.13 Theorem [1265, 1298] Let #x5C;theta be a root of a monic irreducible polynomial f of degree m over K#x3D;#x5C;mathbbF#x5F;q, and let B#x3D;#x5C;#x7B;1,#x5C;theta,#x5C;theta²,#x5C;dots#x5C;theta#x7B;m-1#x7D;#x5C;#x7D; be the corresponding polynomial basis of F#x3D;#x5C;mathbbF#x5F;#x7B;qᵐ#x7D; over K. Then the dual basis B#x2A; of B is a polynomial basis if and only if f is a binomial and m#x5C;equiv 1#x5C;#x21;#x5C;#x21;#x5C;#x21;#x5C;#x21;#x5C;pmodp, where q is a power of the prime p.\n5.1.14 Corollary There exists a dual pair of polynomial bases of #x5C;mathbbF#x5F;#x7B;qᵐ#x7D; over #x5C;mathbbF#x5F;q if and only if the following three conditions are satisfied:[…].",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Specifically, a basis, of the form {1, α, ..., αⁿ⁻¹}, of a finite extension F_(qⁿ) of a Galois field F_q, where α is a primitive element of F_(qⁿ) (i.e., a root of a degree-n primitive polynomial over F_q)."
      ],
      "id": "en-polynomial_basis-en-noun-ywb~xmRF",
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "extension",
          "extension field"
        ],
        [
          "Galois field",
          "Galois field"
        ],
        [
          "primitive element",
          "primitive element"
        ],
        [
          "root",
          "root"
        ],
        [
          "primitive polynomial",
          "primitive polynomial"
        ]
      ],
      "qualifier": "field theory",
      "raw_glosses": [
        "(algebra, field theory, cryptography, of a finite field) Specifically, a basis, of the form {1, α, ..., αⁿ⁻¹}, of a finite extension F_(qⁿ) of a Galois field F_q, where α is a primitive element of F_(qⁿ) (i.e., a root of a degree-n primitive polynomial over F_q)."
      ],
      "raw_tags": [
        "of a finite field"
      ],
      "topics": [
        "algebra",
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "polynomial basis"
}

{
  "categories": [
    "English countable nouns",
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns"
  ],
  "forms": [
    {
      "form": "polynomial bases",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "polynomial bases"
      },
      "expansion": "polynomial basis (plural polynomial bases)",
      "name": "en-noun"
    }
  ],
  "hyponyms": [
    {
      "sense": "basis of a polynomial ring",
      "word": "Bernstein basis"
    },
    {
      "sense": "basis of a polynomial ring",
      "word": "monomial basis"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Bernstein basis polynomial"
    },
    {
      "word": "dual basis"
    },
    {
      "word": "monomial"
    },
    {
      "word": "normal basis"
    }
  ],
  "senses": [
    {
      "categories": [
        "English terms with quotations",
        "en:Algebra"
      ],
      "examples": [
        {
          "text": "2007, Nicos Karcanias, Efstathios Milonidis, 2: Structural Methods for Linear Systems: An Introduction, Matthew C. Turner, Declan G. Bates (editors), Mathematical Methods for Robust and Nonlinear Control: EPSRC Summer School, Springer, Lecture Notes in Control and Information Sciences 367, page 89,\nIf T(s)=M(s)D(s)⁻¹ is a RCMFD of T(s), then M(s) is a polynomial basis for 𝔛_t. If Q(s) is a greatest right divisor of M(s) then T(s)=◌̅M(s)Q(s)D(s)⁻¹, where ◌̅M(s) is a least degree polynomial basis of 𝔛_t [15]."
        },
        {
          "ref": "2009, Jan Flusser, Barbara Zitova, Tomas Suk, Moments and Moment Invariants in Pattern Recognition, Wiley, page 166",
          "text": "When dealing with various polynomial bases up to a certain degree and with corresponding moments, any moment (with respect to any basis) can be expressed as a function of moments of the same or fewer orders with respect to an arbitrary basis.[…]As we already saw in Chapter 1, OG moments are, unlike geometric and all other moments, coordinates of f in the polynomial basis in the common sense used in linear algebra.",
          "type": "quotation"
        },
        {
          "ref": "2012, A. Kominek et al., “Ident. of Low-Compl. LPV-IO Models for Engine Control”, in Javad Mohammadpour, Carsten W. Scherer, editors, Control of Linear Parameter Varying Systems with Applications, Springer, page 452",
          "text": "For this purpose, a polynomial basis is used here, which consists of all monomials in the scheduling signals up to a fixed total order. Such a polynomial basis can be interpreted as the polynomial terms, which would appear in a multivariate Taylor approximation of the unknown scheduling function.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A basis of a polynomial ring (said ring being viewed either as a vector space over the field of coefficients or as a free module over the ring of coefficients)."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "basis",
          "basis"
        ],
        [
          "polynomial ring",
          "polynomial ring"
        ],
        [
          "vector space",
          "vector space"
        ],
        [
          "field",
          "field"
        ],
        [
          "free module",
          "free module"
        ],
        [
          "ring",
          "ring"
        ]
      ],
      "qualifier": "ring theory",
      "raw_glosses": [
        "(algebra, ring theory) A basis of a polynomial ring (said ring being viewed either as a vector space over the field of coefficients or as a free module over the ring of coefficients)."
      ],
      "topics": [
        "algebra",
        "mathematics",
        "sciences"
      ]
    },
    {
      "categories": [
        "English terms with quotations",
        "en:Algebra",
        "en:Cryptography"
      ],
      "examples": [
        {
          "ref": "1999, I. Blake, G. Seroussi, N. Smart, Elliptic Curves in Cryptography, Cambridge University Press, page 20",
          "text": "When using polynomial bases, the first stage in computing the product of two elements of #x5C;mathbbF#x5F;#x7B;2ⁿ#x7D; is the multiplication of two polynomials of degree at most n-1 in #x5C;mathbbF#x5F;2#x5B;x#x5D;.",
          "type": "quotation"
        },
        {
          "text": "2010, Vladimir Tujillo-Olaya, Jaime Velasco-Medina, Hardware Architectures for Elliptic Curve Cryptoprocessors Using Polynomial and Gaussian Normal Basis Over GF(2²³³), Marina L. Gravrilova, C. J. Kenneth Tan, Edward David Moreno (editors), Transactions on Computational Science XI: Special Issue on Security in Computing, Part 2, Springer, LNCS 6480, page 79,\nIn this case, the GF(2ᵐ) multiplication is implemented in hardware using three algorithms for polynomial basis (PB) and three for gaussian normal basis (GNB)."
        },
        {
          "ref": "2013, Gary L. Mullen, Daniel Panario, Handbook of Finite Fields, Taylor & Francis (Chapman & Hall / CRC Press), page 103",
          "text": "In contrast to the case of normal bases considered in Theorem 5.1.9, the dual basis of a polynomial basis is usually not a polynomial basis.\n[…]\n5.1.13 Theorem [1265, 1298] Let #x5C;theta be a root of a monic irreducible polynomial f of degree m over K#x3D;#x5C;mathbbF#x5F;q, and let B#x3D;#x5C;#x7B;1,#x5C;theta,#x5C;theta²,#x5C;dots#x5C;theta#x7B;m-1#x7D;#x5C;#x7D; be the corresponding polynomial basis of F#x3D;#x5C;mathbbF#x5F;#x7B;qᵐ#x7D; over K. Then the dual basis B#x2A; of B is a polynomial basis if and only if f is a binomial and m#x5C;equiv 1#x5C;#x21;#x5C;#x21;#x5C;#x21;#x5C;#x21;#x5C;pmodp, where q is a power of the prime p.\n5.1.14 Corollary There exists a dual pair of polynomial bases of #x5C;mathbbF#x5F;#x7B;qᵐ#x7D; over #x5C;mathbbF#x5F;q if and only if the following three conditions are satisfied:[…].",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Specifically, a basis, of the form {1, α, ..., αⁿ⁻¹}, of a finite extension F_(qⁿ) of a Galois field F_q, where α is a primitive element of F_(qⁿ) (i.e., a root of a degree-n primitive polynomial over F_q)."
      ],
      "links": [
        [
          "algebra",
          "algebra"
        ],
        [
          "cryptography",
          "cryptography"
        ],
        [
          "extension",
          "extension field"
        ],
        [
          "Galois field",
          "Galois field"
        ],
        [
          "primitive element",
          "primitive element"
        ],
        [
          "root",
          "root"
        ],
        [
          "primitive polynomial",
          "primitive polynomial"
        ]
      ],
      "qualifier": "field theory",
      "raw_glosses": [
        "(algebra, field theory, cryptography, of a finite field) Specifically, a basis, of the form {1, α, ..., αⁿ⁻¹}, of a finite extension F_(qⁿ) of a Galois field F_q, where α is a primitive element of F_(qⁿ) (i.e., a root of a degree-n primitive polynomial over F_q)."
      ],
      "raw_tags": [
        "of a finite field"
      ],
      "topics": [
        "algebra",
        "computing",
        "cryptography",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "polynomial basis"
}