Search Results for ""

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 look and say sequence generated from a starting digit of 3, as given by Vardi (1991).

The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...

The closed cyclic self-intersecting hexagon formed by joining the adjacent antiparallels in the construction of the cosine circle. The sides of this hexagon have the property ...

Extend the symmedians of a triangle DeltaA_1A_2A_3 to meet the circumcircle at P_1, P_2, P_3. Then the symmedian point K of DeltaA_1A_2A_3 is also the symmedian point of ...

Two non-coincident plane angles alpha and beta in angle standard position are said to be coterminal if the terminal side of alpha is identically the same as the terminal side ...

The cotree T^* of a spanning tree T in a connected graph G is the spacing subgraph of G containing exactly those edges of G which are not in T (Harary 1994, p. 39).

A countable set is a set that is either finite or denumerable. However, some authors (e.g., Ciesielski 1997, p. 64) use the definition "equipollent to the finite ordinals," ...

Given n sets of variates denoted {X_1}, ..., {X_n} , the first-order covariance matrix is defined by V_(ij)=cov(x_i,x_j)=<(x_i-mu_i)(x_j-mu_j)>, where mu_i is the mean. ...

A functor F is called covariant if it preserves the directions of arrows, i.e., every arrow f:A-->B is mapped to an arrow F(f):F(A)-->F(B).