Combinatorial polynomials, such as the Tutte, U‐ and Schubert polynomials, complement this by systematically organising information about graphs and posets into polynomial expressions.

A polynomial function is an expression which consists of a single independent variable, where the variable can occur in the equation more than one time with a different degree of the exponent.

For polynomials of this type orthogonal with respect to a state, we prove a Favard-type recursion relation. On the other hand, free Sheffer polynomials are a polynomial family in non-commuting ...

Inspired by Rearick's work on logarithm and exponential functions of arithmetic functions, we introduce two new operators, LOG and EXP. The LOG operates on generalized Fibonacci polynomials giving ...

Solving polynomials We solve polynomials algebraically in order to determine the roots - where a curve cuts the x -axis. A root of a polynomial function, f (x), is a value for x for which f (x) = 0.

Dividing and factorising polynomial expressions What is a polynomial? A polynomial is an algebraic expression involving many terms and can be factorised using long division or synthetic division.