Search Results for ""

|_n]={n for n!=0; 1 for n=0. (1)

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

If any of the roots of a polynomial are increased, then all of the critical points increase.

The operation of taking an nth root of a number.

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

The root lattice of a semisimple Lie algebra is the discrete lattice generated by the Lie algebra roots in h^*, the dual vector space to the Cartan subalgebra.

The sum of the reciprocals of roots of an equation equals the negative coefficient of the linear term in the Maclaurin series.

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Kaps-Rentrop methods.