Search Results for ""

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

For P and Q polynomials in n variables, |P·Q|_2^2=sum_(i_1,...,i_n>=0)(|P^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n)|_2^2)/(i_1!...i_n!), where D_i=partial/partialx_i, |X|_2 ...

A riffle shuffle, also called the Faro shuffle, is a shuffle in which a deck of 2n cards is divided into two halves. The top half of the deck is placed in the left hand, and ...

The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...

|_n]={n for n!=0; 1 for n=0. (1)

sum_(k=0)^dr_k^B(d-k)!x^k=sum_(k=0)^d(-1)^kr_k^(B^_)(d-k)!x^k(x+1)^(d-k).

If any of the roots of a polynomial are increased, then all of the critical points increase.

If the matrices A, X, B, and C satisfy AX-XB=C, then [I X; 0 I][A C; 0 B][I -X; 0 I]=[A 0; 0 B], where I is the identity matrix.

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z], is said to be Saalschützian if it is k-balanced with k=1, ...

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.