Search Results for ""
5681 - 5690 of 13134 for complexity theorySearch Results
The integral transform defined by g(x)=int_1^inftyt^(1/4-nu/2)(t-1)^(1/4-nu/2)P_(-1/2+ix)^(nu-1/2)(2t-1)f(t)dt (Samko et al. 1993, p. 761) or ...
Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...
An inequality which implies the correctness of the Robertson conjecture (Milin 1964). de Branges (1985) proved this conjecture, which led to the proof of the full Bieberbach ...
Let a module M in an integral domain D_1 for R(sqrt(D)) be expressed using a two-element basis as M=[xi_1,xi_2], where xi_1 and xi_2 are in D_1. Then the different of the ...
The unique 8_3 configuration. It is transitive and self-dual, but cannot be realized in the real projective plane. Its Levi graph is the Möbius-Kantor graph.
The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...
Let f(z) be an analytic function of z, regular in the half-strip S defined by a<x<b and y>0. If f(z) is bounded in S and tends to a limit l as y->infty for a certain fixed ...
Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...
The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...
The number of multisets of length k on n symbols is sometimes termed "n multichoose k," denoted ((n; k)) by analogy with the binomial coefficient (n; k). n multichoose k is ...
...
View search results from all Wolfram sites (28442 matches)

