Search Results for ""

Given a polynomial in a single complex variable with complex coefficients p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, the reciprocal polynomial is defined by ...

Let m and m+h be two consecutive critical indices of f and let F be (m+h)-normal. If the polynomials p^~_k^((n)) are defined by p^~_0^((n))(u) = 1 (1) p^~_(k+1)^((n))(u) = ...

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

Recall the definition of the autocorrelation function C(t) of a function E(t), C(t)=int_(-infty)^inftyE^_(tau)E(t+tau)dtau. (1) Also recall that the Fourier transform of E(t) ...

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

A shorthand name for a series with the variable k taken to a negative exponent, e.g., sum_(k=1)^(infty)k^(-p), where p>1. p-series are given in closed form by the Riemann ...

The Fibonacci numbers are the sequence of numbers {F_n}_(n=1)^infty defined by the linear recurrence equation F_n=F_(n-1)+F_(n-2) (1) with F_1=F_2=1. As a result of the ...

A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly identified.

A Ramsey number of the form R(k,k;2).