TOPICS
Search

Search Results for ""


5521 - 5530 of 13134 for Extremal graph theorySearch Results
A formula is called satisfiable if it takes at least one true value in some interpretation.
S(nu,z) = int_0^infty(1+t)^(-nu)e^(-zt)dt (1) = z^(nu-1)e^zint_z^inftyu^(-nu)e^(-u)du (2) = z^(nu/2-1)e^(z/2)W_(-nu/2,(1-nu)/2)(z), (3) where W_(k,m)(z) is the Whittaker ...
A space-filling function.
The Schur number S(k) is the largest integer n for which the interval [1,n] can be partitioned into k sum-free sets (Fredricksen and Sweet 2000). S(k) is guaranteed to exist ...
The Schur polynomials are a class of orthogonal polynomials. They are a special case of the Jack polynomials corresponding to the case alpha=1.
A spherical harmonic of the form sin(mphi)P_m^m(costheta) or cos(mphi)P_m^m(costheta).
An action with G=R^+.
The probability that a statistical test will be positive for a true statistic.
A translation without rotation or distortion.
The edge of a polygon or face of a polyhedron are sometimes called sides.
1 ... 550|551|552|553|554|555|556 ... 1314 Previous Next

...