Search Results for ""

Let P be a polynomial of degree n with derivative P^'. Then ||P^'||_infty<=n||P||_infty, where ||P||_infty=max_(|z|=1)|P(z)|.

For homogeneous polynomials P and Q of degree n, [P,Q]=sum_(i_1,...,i_n>=0)(i_1!...i_n!)(a_(i,...,i_n)b_(i_1,...,i_n)).

A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian cycle.

The number of inward directed graph edges from a given graph vertex in a directed graph.

The Lagrange interpolating polynomial is the polynomial P(x) of degree <=(n-1) that passes through the n points (x_1,y_1=f(x_1)), (x_2,y_2=f(x_2)), ..., (x_n,y_n=f(x_n)), and ...

An algebraic surface of degree 9. Enneper's minimal surface is an example of a nonic surface.

A sequence of polynomials p_i(x), for i=0, 1, 2, ..., where p_i(x) is exactly of degree i for all i.

There are several related theorems involving Hamiltonian cycles of graphs that are associated with Pósa. Let G be a simple graph with n graph vertices. 1. If, for every k in ...

An m-ary n-ic polynomial (i.e., a homogeneous polynomial with constant coefficients of degree n in m independent variables).

The modular equation of degree five can be written (u/v)^3+(v/u)^3=2(u^2v^2-1/(u^2v^2)).