• Title of article

    How symmetric can a function be? Original Research Article

  • Author/Authors

    D. C. van Leijenhorst، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 1998
  • Pages
    10
  • From page
    1
  • To page
    10
  • Abstract
    The symmetric complexity of a polynomial in n variables is defined as the number of times the fundamental theorem on symmetric functions is applicable. In this paper a sharp upper bound on this measure is derived by a matrix method.
  • Keywords
    symmetric functions , Term orderings , Recursions , Matrix spectra , complexity
  • Journal title
    Linear Algebra and its Applications
  • Serial Year
    1998
  • Journal title
    Linear Algebra and its Applications
  • Record number

    822497

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=822497