Search Results for ""

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

A Nash equilibrium of a strategic game is a profile of strategies (s_1^*,...,s_n^*), where s_i^* in S_i (S_i is the strategy set of player i), such that for each player i, ...

A patch (also called a local surface) is a differentiable mapping x:U->R^n, where U is an open subset of R^2. More generally, if A is any subset of R^2, then a map x:A->R^n ...

Let A be a C^*-algebra. An element a in A is called positive if a=a* and sp(a) subset= R^+, or equivalently if there exists an element b in A such that a=bb^*. For example, ...

A short set of data that proves the primality of a number. A certificate can, in general, be checked much more quickly than the time required to generate the certificate. ...

A method for fitting a curve (not necessarily a straight line) through a set of points using some goodness-of-fit criterion. The most common type of regression is linear ...

Given a set P with |P|=p elements consisting of c_1 numbers 1, c_2 numbers 2, ..., and c_n numbers n and c_1+c_2+...+c_n=p, find the number of permutations with k-1 rises ...

A dissection fallacy discovered by Dudeney (1958). The same set of tangram pieces can apparently produce two different figures, one of which is a proper subset of the other. ...

A convex polyhedron is defined as the set of solutions to a system of linear inequalities mx<=b (i.e., a matrix inequality), where m is a real s×d matrix and b is a real ...

Let sum_(n=1)^(infty)u_n(x) be a series of functions all defined for a set E of values of x. If there is a convergent series of constants sum_(n=1)^inftyM_n, such that ...