Search Results for ""

A branch of game theory dealing with strategies to maximize the outcome of a given process in the face of uncertain conditions.

A shift-invariant operator Q for which Qx is a nonzero constant. 1. Qa=0 for every constant a. 2. If p(x) is a polynomial of degree n, Qp(x) is a polynomial of degree n-1. 3. ...

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

The term used by Hunter and Madachy (1975, p. 24) and Madachy (1979, p. 87) to refer to a panmagic square.

A piecewise regular function that 1. Has a finite number of finite discontinuities and 2. Has a finite number of extrema can be expanded in a Fourier series which converges ...

An edge automorphism of a graph G is a permutation of the edges of G that sends edges with common endpoint into edges with a common endpoint. The set of all edge ...

An n×n matrix A is an elementary matrix if it differs from the n×n identity I_n by a single elementary row or column operation.

Let A and B be two classes of positive integers. Let A(n) be the number of integers in A which are less than or equal to n, and let B(n) be the number of integers in B which ...

For any integers a_i with 1<=a_1<a_2<...<a_k<=n, the proportion of permutations in the symmetric group S_n whose cyclic decompositions contain no cycles of lengths a_1, a_2, ...

The Euclidean metric is the function d:R^n×R^n->R that assigns to any two vectors in Euclidean n-space x=(x_1,...,x_n) and y=(y_1,...,y_n) the number ...