Search Results for ""

A function f defined on a subset S subset R^n is said to be pseudoconcave if -f is pseudoconvex.

Let L(n,d) be the smallest tour length for n points in a d-D hypercube. Then there exists a smallest constant alpha(d) such that for all optimal tours in the hypercube, lim ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

Synergetics deals with systems composed of many subsystems which may each be of a very different nature. In particular, synergetics treats systems in which cooperation among ...

A circle-preserving transformation composed of an even number of inversions.

The product of any number of perspectivities.

A perspective collineation in which the center and axis are incident.