Search Results for ""

A universal differential equation (UDE) is a nontrivial differential-algebraic equation with the property that its solutions approximate to arbitrary accuracy any continuous ...

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The vertex degrees are illustrated above for a random graph. The vertex degree is also ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

Let L be a finite-dimensional split semisimple Lie algebra over a field of field characteristic 0, H a splitting Cartan subalgebra, and Lambda a weight of H in a ...

A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...

sum_(n=0)^(infty)[(q)_infty-(q)_n] = g(q)+(q)_inftysum_(k=1)^(infty)(q^k)/(1-q^k) (1) = g(q)+(q)_inftyL(q) (2) = g(q)+(q)_infty(psi_q(1)+ln(1-q))/(lnq) (3) = ...

The nth root (or "nth radical") of a quantity z is a value r such that z=r^n, and therefore is the inverse function to the taking of a power. The nth root is denoted ...

The cubic formula is the closed-form solution for a cubic equation, i.e., the roots of a cubic polynomial. A general cubic equation is of the form z^3+a_2z^2+a_1z+a_0=0 (1) ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...