Search Results for ""
3641 - 3650 of 13134 for Extremal graph theorySearch Results
Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...
A series suma(n)e^(-lambda(n)z), where a(n) and z are complex and {lambda(n)} is a monotonic increasing sequence of real numbers. The numbers lambda(n) are called the ...
To divide is to perform the operation of division, i.e., to see how many times a divisor d goes into another number n. n divided by d is written n/d or n÷d. The result need ...
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, ...
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 ...
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 ...
...
View search results from all Wolfram sites (34319 matches)

