Linear projections of the Vandermonde polynomial (Q2330107)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7119836
Language Label Description Also known as
default for all languages
No label defined
    English
    Linear projections of the Vandermonde polynomial
    scientific article; zbMATH DE number 7119836

      Statements

      Linear projections of the Vandermonde polynomial (English)
      0 references
      0 references
      0 references
      18 October 2019
      0 references
      An $n$-variate Vandermonde polynomial is the determinant of the $n\times n$ matrix where the $i$-th column is the vector $\langle 1, x_i, x^2_i, \dots, x^{n-1}_i \rangle^T$. In the paper, some structural and computational aspects of Vandermonde polynomial linear projections are studied. For a polynomial $f$ that is a product of linear factors, a deterministic polynomial time algorithm is constructed to test if $f$ is linearly equivalent to the Vandermonde polynomial. The group of symmetries of a Vandermonde polynomial is described. The arithmetic circuits built over projections of Vandermonde polynomials are studied.
      0 references
      algebraic complexity theory
      0 references
      Vandermonde polynomials
      0 references
      polynomial equivalence problem
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references