Search Results for ""

A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...

The Pell-Lucas polynomials Q(x) are the w-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. The first few are Q_1(x) = 2x (1) Q_2(x) ...

A method to obtain a signal C_l(z) with a flat spectrum c(theta;z) (such as a pulse), but having a smaller amplitude than the pulse. ...

A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...

Quasirandom numbers are numbers selected from a quasirandom sequence. Such numbers are useful in computational problems such as quasi-Monte Carlo integration.

The bias of a series is defined as Q[a_i,a_(i+1),a_(i+2)]=(a_ia_(i+2)-a_(i+1)^2)/(a_ia_(i+1)a_(i+2)). A series is geometric iff Q=0. A series is artistic iff the bias is ...

A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...

The exact values of cos(pi/18) and sin(pi/18) can be given by infinite nested radicals sin(pi/(18))=1/2sqrt(2-sqrt(2+sqrt(2+sqrt(2-...)))), where the sequence of signs +, +, ...

A polynomial is called unimodal if the sequence of its coefficients is unimodal. If P(x) is log-convex and Q(x) is unimodal, then P(x)Q(x) is unimodal.

The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.