Search Results for ""
351 - 360 of 1283 for Polynomial DiscriminantSearch Results
Algebra
(1-x^2)(d^2y)/(dx^2)-x(dy)/(dx)+alpha^2y=0 (1) for |x|<1. The Chebyshev differential equation has regular singular points at -1, 1, and infty. It can be solved by series ...
A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
Serre's problem, also called Serre's conjecture, asserts that the implication "free module ==> projective module" can be reversed for every module over the polynomial ring ...
A technical mathematical object defined in terms of a polynomial ring of n variables over a field k. Syzygies occur in tensors at rank 5, 7, 8, and all higher ranks, and play ...
A variable is a symbol on whose value a function, polynomial, etc., depends. For example, the variables in the function f(x,y) are x and y. A function having a single ...
A sequence s_n^((lambda))(x)=[h(t)]^lambdas_n(x), where s_n(x) is a Sheffer sequence, h(t) is invertible, and lambda ranges over the real numbers is called a Steffensen ...
The Bombieri p-norm of a polynomial Q(x)=sum_(i=0)^na_ix^i (1) is defined by [Q]_p=[sum_(i=0)^n(n; i)^(1-p)|a_i|^p]^(1/p), (2) where (n; i) is a binomial coefficient. The ...
Using a Chebyshev polynomial of the first kind T(x), define c_j = 2/Nsum_(k=1)^(N)f(x_k)T_j(x_k) (1) = 2/Nsum_(k=1)^(N)f[cos{(pi(k-1/2))/N}]cos{(pij(k-1/2))/N}. (2) Then f(x) ...
...
View search results from all Wolfram sites (8188 matches)

