Search Results for ""

The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.

The gamma product (e.g., Prudnikov et al. 1986, pp. 22 and 792), is defined by Gamma[a_1,...,a_m; b_1,...,b_n]=(Gamma(a_1)...Gamma(a_m))/(Gamma(b_1)...Gamma(b_n)), where ...

The partial differential equation w_t-6(w+epsilon^2w^2)w_x+w_(xxx)=0, which can also be rewritten (w)_t+(-3w^2-2epsilon^2w^3+w_(xx))_x=0.

Consider two closed oriented space curves f_1:C_1->R^3 and f_2:C_2->R^3, where C_1 and C_2 are distinct circles, f_1 and f_2 are differentiable C^1 functions, and f_1(C_1) ...

Let p be an odd prime and b a positive integer not divisible by p. Then for each positive odd integer 2k-1<p, let r_k be r_k=(2k-1)b (mod p) with 0<r_k<p, and let t be the ...

For even h, (1) (Nagell 1951, p. 176). Writing out symbolically, sum_(n=0)^h((-1)^nproduct_(k=0)^(n-1)(1-x^(h-k)))/(product_(k=1)^(n)(1-x^k))=product_(k=0)^(h/2-1)1-x^(2k+1), ...

A geodesic mapping f:M->N between two Riemannian manifolds is a diffeomorphism sending geodesics of M into geodesics of N, whose inverse also sends geodesics to geodesics ...

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

An algebraic ring which appears in treatments of duality in algebraic geometry. Let A be a local Artinian ring with m subset A its maximal ideal. Then A is a Gorenstein ring ...