Search Results for ""
311 - 320 of 13135 for Discrete SetSearch Results
A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...
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.
In common usage, a cardinal number is a number used in counting (a counting number), such as 1, 2, 3, .... In formal set theory, a cardinal number (also called "the ...
A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...
Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...
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 ...
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 ...
The set theory symbol aleph_0 refers to a set having the same cardinal number as the "small" infinite set of integers. The symbol aleph_0 is often pronounced "aleph-null" ...
The set A^2 of all ordered pairs of complex numbers.
A set of values of similar meaning obtained in any manner.
...
View search results from all Wolfram sites (47352 matches)

