TOPICS
Search

Search Results for ""


521 - 530 of 1299 for Equivalent and non-equivalent fractionsSearch Results
Let L be a nontrivial bounded lattice (or a nontrivial complemented lattice, etc.). If every nonconstant lattice homomorphism defined on L is 0,1-separating, then L is a ...
A measure lambda is absolutely continuous with respect to another measure mu if lambda(E)=0 for every set with mu(E)=0. This makes sense as long as mu is a positive measure, ...
The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...
The associahedron is the n-dimensional generalization of the pentagon. It was discovered by Stasheff in 1963 and it is also known as the Stasheff polytope. The number of ...
Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...
The axiom of Zermelo-Fraenkel set theory which asserts that sets formed by the same elements are equal, forall x(x in a=x in b)=>a=b. Note that some texts (e.g., Devlin ...
The axiom of Zermelo-Fraenkel set theory which asserts the existence for any set a and a formula A(y) of a set x consisting of all elements of a satisfying A(y), exists x ...
An Aztec diamond of order n is the region obtained from four staircase shapes of height n by gluing them together along the straight edges. It can therefore be defined as the ...
For a normed space (X,||·||), define X^~ to be the set of all equivalent classes of Cauchy sequences obtained by the relation {x_n}∼{y_n} if and only if lim_(n)||x_n-y_n||=0. ...
A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...
1 ... 50|51|52|53|54|55|56 ... 130 Previous Next

...