Search Results for ""

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

An antiprism graph is a graph corresponding to the skeleton of an antiprism. Antiprism graphs are therefore polyhedral and planar. The n-antiprism graph has 2n vertices and ...

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)|.

A determinant appearing in Padé approximant identities: C_(r/s)=|a_(r-s+1) a_(r-s+2) ... a_r; | | ... |; a_r a_(r+1) ... a_(r+s-1)|.

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

The number of empty neighbors of a cluster.

The order of the polynomial defining an algebraic curve.

The point of coincidence of P and P^' in Fagnano's theorem.

A polynomial function of the elements of a vector x can be uniquely decomposed into a sum of harmonic polynomials times powers of |x|.

The vertical length of an object from top to bottom.