All other products are evidently of degree n - 2 in at most.

Sq is the cup square on classes of degree n.

More formally, let G be a permutation group of order m and degree n.

Let be a univariate polynomial of degree n with real or complex coefficients.

A Newton-Cotes formula of any degree n can be constructed.

Bézier curves can be defined for any degree n.

In fact, by starting with any polynomial of degree n, the column number n + 1 will always be constant.

A rational Chebyshev function of degree n is defined as:

If, as is often the case, you're also factorizing a polynomial of degree n, then:

Notice that the running time of the algorithm depends only on degree n and not on the number of points p.