Search Results for ""

The n-ladder graph can be defined as L_n=P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n ...

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.

A function whose value increases more slowly to infinity than any nonconstant polynomial is said to be a logarithmically increasing function. The prototypical example is the ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

If two square n×n matrices A and B are simultaneously upper triangularizable by similarity transforms, then there is an ordering a_1, ..., a_n of the eigenvalues of A and ...

An algebraic expression containing more than one term (cf., binomial). The term is also used to refer to a polynomial.

The vector field N_f(z)=-(f(z))/(f^'(z)) arising in the definition of the Newtonian graph of a complex univariate polynomial f (Smale 1985, Shub et al. 1988, Kozen and ...

The pentanacci constant is the limiting ratio of adjacent pentanacci numbers. It is the algebraic number P = (x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.96594823... (2) (OEIS A103814), ...

A sequence {mu_n}_(n=0)^infty is positive definite if the moment of every nonnegative polynomial which is not identically zero is greater than zero (Widder 1941, p. 132). ...

Given algebraic numbers a_1, ..., a_n it is always possible to find a single algebraic number b such that each of a_1, ..., a_n can be expressed as a polynomial in b with ...