Search Results for ""

Let K be the knot above, and let the homomorphism h taking a knot K_1 to its companion knot K_2 be faithful (i.e., taking the preferred longitude and meridian of the original ...

A metatheorem stating that every theorem on partially ordered sets remains true if all inequalities are reversed. In this operation, supremum must be replaced by infimum, ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G). If a graph G has no isolated points, then nu(G)+rho(G)=|G|, where nu(G) ...

A family of functors H_n(·) from the category of pairs of topological spaces and continuous maps, to the category of Abelian groups and group homomorphisms satisfies the ...

An equalizer of a pair of maps f,g:X->Y in a category is a map e:E->X such that 1. f degreese=g degreese, where degrees denotes composition. 2. For any other map e^':E^'->X ...

An equivalence class is defined as a subset of the form {x in X:xRa}, where a is an element of X and the notation "xRy" is used to mean that there is an equivalence relation ...

An equivalence relation on a set X is a subset of X×X, i.e., a collection R of ordered pairs of elements of X, satisfying certain properties. Write "xRy" to mean (x,y) is an ...

A deeper result than the Hardy-Ramanujan theorem. Let N(x,a,b) be the number of integers in [n,x] such that inequality a<=(omega(n)-lnlnn)/(sqrt(lnlnn))<=b (1) holds, where ...

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...