Search Results for ""

Given the functional (1) find in a class of arcs satisfying p differential and q finite equations phi_alpha(y_1,...,y_n;y_1^',...,y_n^')=0 for alpha=1,...,p ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...

The Jacobi symbol (a/y)=chi(y) as a number theoretic character can be extended to the Kronecker symbol (f(a)/y)=chi^*(y) so that chi^*(y)=chi(y) whenever chi(y)!=0. When y is ...

The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...

If f is a continuous function that satisfies the Lipschitz condition |f(x,t)-f(y,t)|<=L|x-y| (1) in a surrounding of (x_0,t_0) in Omega subset ...

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...

The function psi(x)={x(1-(x^2)/(c^2))^2 for |x|<c; 0 for |x|>c (1) sometimes used in robust estimation. It has a minimum at x=-c/sqrt(5) and a maximum at x=c/sqrt(5), where ...

A point lattice which can be constructed from an arbitrary parallelogram of unit area. For any such planar lattice, the minimum distance c between any two points is a ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...