Search Results for ""

A set of moves which a player plans to follow while playing a game.

Two sets A_1 and A_2 are disjoint if their intersection A_1 intersection A_2=emptyset, where emptyset is the empty set. n sets A_1, A_2, ..., A_n are disjoint if A_i ...

Let f be a function defined on a set A and taking values in a set B. Then f is said to be a surjection (or surjective map) if, for any b in B, there exists an a in A for ...

Given a set A, let N(A) be the set of neighbors of A. Then the bipartite graph G with bipartitions X and Y has a perfect matching iff |N(A)|>=|A| for all subsets A of X.

The manipulation of Dehn surgery descriptions by a certain set of operations.

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A topology defined on a totally ordered set X whose open sets are all the finite intersections of subsets of the form {x in X|x>a} or {x in X|x<a}, where a in X. The order ...

For some range of r, the Mandelbrot set lemniscate L_3 in the iteration towards the Mandelbrot set is a pear-shaped curve. In Cartesian coordinates with a constant r, the ...

The set A^2 of all ordered pairs of complex numbers.

A set of values of similar meaning obtained in any manner.