TOPICS
Search

Search Results for ""


3451 - 3460 of 13134 for binomial theorySearch Results
Stochastic optimization refers to the minimization (or maximization) of a function in the presence of randomness in the optimization process. The randomness may be present as ...
X subset= R^n is subanalytic if, for all x in R^n, there is an open set U and a bounded semianalytic set Y subset R^(n+m) such that X intersection U is the projection of Y ...
Two integers (m,n) form a super unitary amicable pair if sigma^*(sigma^*(m))=sigma^*(sigma^*(n))=m+n, where sigma^*(n) is the unitary divisor function. The first few pairs ...
Let f be a function defined on a set A and taking values in a set B. Then f is said to be a surjection (or surjective map) if, for any b in B, there exists an a in A for ...
A catastrophe which can occur for three control factors and one behavior axis. The swallowtail catastrophe is the universal unfolding of singularity f(x)=x^5 with codimension ...
A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...
When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...
The Taniyama-Shimura conjecture, since its proof now sometimes known as the modularity theorem, is very general and important conjecture (and now theorem) connecting topology ...
A special case of a quartic Kummer surface.
In the notation of Watson (1966), theta=zd/(dz).
1 ... 343|344|345|346|347|348|349 ... 1314 Previous Next

...