Search Results for ""
4021 - 4030 of 13134 for Graph TheorySearch Results
A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.
A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...
The pseudo-tangent cone P_S(x) of a subset S subset R^n at a point x in S is the set P_S(x)=convK_S^_, where K_S is the contingent cone of S and where conv(A) is the smallest ...
A function f defined on a subset S subset R^n is said to be pseudoconcave if -f is pseudoconvex.
A recurrence relation between the function Q arising in quota systems, Q(n,r)=Q(n-1,r-1)+Q(n-1,r).
int_(-infty)^infty(J_(mu+xi)(x))/(x^(mu+xi))(J_(nu-xi)(y))/(y^(nu-xi))e^(itxi)dxi =[(2cos(1/2t))/(x^2e^(-it/2)+y^2e^(it/2))]^((mu+nu)/2) ...
The space of currents arising from rectifiable sets by integrating a differential form is called the space of two-dimensional rectifiable currents. For C a closed bounded ...
A type of error-correcting code that is related to Hadamard matrices.
In a complete metric space, a countable union of nowhere dense sets is said to be meager; the complement of such a set is a residual set.
sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).
...
View search results from all Wolfram sites (33872 matches)

