Search Results for ""

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

The term "recursive function" is often used informally to describe any function that is defined with recursion. There are several formal counterparts to this informal ...

Every smooth nonzero vector field on the 3-sphere has at least one closed orbit. The conjecture was proposed in 1950 and proved true for Hopf maps. The conjecture was ...

A sequent is an expression Gamma|-Lambda, where Gamma and Lambda are (possibly empty) sequences of formulas. Here, Gamma is called the antecedent and Lambda is called the ...

A short exact sequence of groups 0-->A-->B-->C-->0 (1) is called split if it essentially presents B as the direct sum of the groups A and C. More precisely, one can construct ...

In logic, the term "homomorphism" is used in a manner similar to but a bit different from its usage in abstract algebra. The usage in logic is a special case of a "morphism" ...

Let (K,L) be a pair consisting of finite, connected CW-complexes where L is a subcomplex of K. Define the associated chain complex C(K,L) group-wise for each p by setting ...

A self-intersecting minimal surface which can be generated using the Enneper-Weierstrass parameterization with f(z) = 1 (1) g(z) = zeta. (2) Letting z=re^(iphi) and taking ...

Let E_1(x) be the En-function with n=1, E_1(x) = int_1^infty(e^(-tx)dt)/t (1) = int_x^infty(e^(-u)du)/u. (2) Then define the exponential integral Ei(x) by E_1(x)=-Ei(-x), (3) ...

The Fox H-function is a very general function defined by where 0<=m<=q, 0<=n<=p, alpha_j,beta_j>0, and a_j,b_j are complex numbers such that no pole of Gamma(b_j-beta_js) for ...