Search Results for ""

A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...

Possessing more than one mode. A set of values having a single unique mode is said to be unimodal, one with two modes is called bimodal, and one with three modes is called ...

A multinomial series is generalization of the binomial series discovered by Johann Bernoulli and Leibniz. The multinomial series arises in a generalization of the binomial ...

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 ...

Multisection of a mathematical quantity or figure is division of it into a number of (usually) equal parts. Division of a quantity into two equal parts is known as bisection, ...

A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...

Given an original knot K, the knots produced by mutations together with K itself are called mutant knots. Mutant knots are often difficult to distinguish. For instance, ...

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 ...

A branch of mathematics which attempts to formalize the nature of the set using a minimal collection of independent axioms. Unfortunately, as discovered by its earliest ...