Search Results for ""

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...

If two square n×n matrices A and B are simultaneously upper triangularizable by similarity transforms, then there is an ordering a_1, ..., a_n of the eigenvalues of A and ...

Let a function h:U->R be continuous on an open set U subset= C. Then h is said to have the epsilon_(z_0)-property if, for each z_0 in U, there exists an epsilon_(z_0)>0 such ...

A mensuration formula is simply a formula for computing the length-related properties of an object (such as area, circumradius, etc., of a polygon) based on other known ...

Let f be analytic on a domain U subset= C, and assume that f never vanishes. Then if there is a point z_0 in U such that |f(z_0)|<=|f(z)| for all z in U, then f is constant. ...

A partial derivative of second or greater order with respect to two or more different variables, for example f_(xy)=(partial^2f)/(partialxpartialy). If the mixed partial ...

A tiling in which all tiles are congruent.

A regression giving conditional expectation values of a given variable in terms of two or more other variables.

A multiple root is a root with multiplicity n>=2, also called a multiple point or repeated root. For example, in the equation (x-1)^2=0, 1 is multiple (double) root. If a ...

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...