Search Results for ""

An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

delta(r)=sqrt(r)-2alpha(r), where alpha(r) is the elliptic alpha function.

For any real alpha and beta such that beta>alpha, let p(alpha)!=0 and p(beta)!=0 be real polynomials of degree n, and v(x) denote the number of sign changes in the sequence ...

A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...

A likelihood function L(a) is the probability or probability density for the occurrence of a sample configuration x_1, ..., x_n given that the probability density f(x;a) with ...

For a two-dimensional map with sigma_2>sigma_1, d_(Lya)=1-(sigma_1)/(sigma_2), where sigma_n are the Lyapunov characteristic exponents.

A maximum likelihood estimator is a value of the parameter a such that the likelihood function is a maximum (Harris and Stocket 1998, p. 824).

The set lambda of linear Möbius transformations w which satisfy w(t)=(at+b)/(ct+d), where a and d are odd and b and c are even. lambda is a subgroup of the modular group ...