TOPICS
Search

Search Results for ""


501 - 510 of 968 for Proof without wordsSearch Results
The Hermite constant is defined for dimension n as the value gamma_n=(sup_(f)min_(x_i)f(x_1,x_2,...,x_n))/([discriminant(f)]^(1/n)) (1) (Le Lionnais 1983). In other words, ...
A homeomorphism, also called a continuous transformation, is an equivalence relation and one-to-one correspondence between points in two geometric figures or topological ...
Let f be a function defined on a set A and taking values in a set B. Then f is said to be an injection (or injective map, or embedding) if, whenever f(x)=f(y), it must be the ...
If A and B are commutative unit rings, and A is a subring of B, then A is called integrally closed in B if every element of B which is integral over A belongs to A; in other ...
The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...
The q-hypergeometric function identity _rphi_s^'[a,qsqrt(a),-qsqrt(a),1/b,1/c,1/d,1/e,1/f; sqrt(a),-sqrt(a),abq,acq,adq,aeq,afq] ...
The composition quotient groups belonging to two composition series of a finite group G are, apart from their sequence, isomorphic in pairs. In other words, if I subset H_s ...
A complex manifold for which the exterior derivative of the fundamental form Omega associated with the given Hermitian metric vanishes, so dOmega=0. In other words, it is a ...
A knot invariant is a function from the set of all knots to any other set such that the function does not change as the knot is changed (up to isotopy). In other words, a ...
König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...
1 ... 48|49|50|51|52|53|54 ... 97 Previous Next

...