TOPICS
Search

Search Results for ""


1851 - 1860 of 13134 for binomial theorySearch Results
If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...
A prime which does not divide the class number h(p) of the cyclotomic field obtained by adjoining a primitive pth root of unity to the field of rationals. A prime p is ...
Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...
The residue classes of a function f(x) mod n are all possible values of the residue f(x) (mod n). For example, the residue classes of x^2 (mod 6) are {0,1,3,4}, since 0^2=0 ...
Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...
The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...
In the directed graph above, pick any vertex and follow the arrows in sequence blue-red-red three times. You will finish at the green vertex. Similarly, follow the sequence ...
Robertson's apex graph is the 15-vertex graph illustrated above constructed by Neil Robertson as an example of an apex graph that is not YDeltaY-reducible. The graph may be ...
Let E be a Euclidean space, (beta,alpha) be the dot product, and denote the reflection in the hyperplane P_alpha={beta in E|(beta,alpha)=0} by ...
The so-called rule of three is an educational tool utilized historically to verbalize the process of solving basic linear equations with four terms where three of the terms ...
1 ... 183|184|185|186|187|188|189 ... 1314 Previous Next

...