Je was op zoek naar: polynomials (Portugees - Engels)

"matrix polynomials".
"matrix polynomials".

com estas funções você pode calcular polynomials de taylor (série), por exemplo.
with these functions you can calculate taylor polynomials (series), for example.

== polynomial multiplication ==all the above multiplication algorithms can also be expanded to multiply polynomials.
== polynomial multiplication ==all the above multiplication algorithms can also be expanded to multiply polynomials.

it also remains an unsolved problem to characterize graphs which have the same chromatic polynomial and to determine which polynomials are chromatic.
it also remains an unsolved problem to characterize graphs which have the same chromatic polynomial and to determine which polynomials are chromatic.

seu livro "fourier series and orthogonal polynomials" (publicado em 1941) foi reimpresso em 2004.
his book "fourier series and orthogonal polynomials" (dated 1941) was reprinted in 2004.

his work on knot polynomials, with the discovery of what is now called the jones polynomial, was from an unexpected direction with origins in the theory of von neumann algebras, an area of analysis already much developed by alain connes.
his work on knot polynomials, with the discovery of what is now called the jones polynomial, was from an unexpected direction with origins in the theory of von neumann algebras, an area of analysis already much developed by alain connes.

outside of this he proved turán's inequalities relating the values of the legendre polynomials for different indices, and, together with paul erdős, the erdős–turán equidistribution inequality.
outside of this he proved turán's inequalities relating the values of the legendre polynomials for different indices, and, together with paul erdős, the erdős–turán equidistribution inequality.

" 13)== external links ==* "graph coloring page" by joseph culberson (graph coloring programs)* "coloration" by jim andrews and mike fellows is a graph coloring puzzle* links to graph coloring source codes* code for efficiently computing tutte, chromatic and flow polynomials by gary haggard, david j. pearce and gordon royle
== external links ==* "graph coloring page" by joseph culberson (graph coloring programs)* "coloration" by jim andrews and mike fellows is a graph coloring puzzle* links to graph coloring source codes* code for efficiently computing tutte, chromatic and flow polynomials by gary haggard, david j. pearce and gordon royle