Search Results for ""

Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...

An exponential generating function for the integer sequence a_0, a_1, ... is a function E(x) such that E(x) = sum_(k=0)^(infty)a_k(x^k)/(k!) (1) = ...

The q-series identity product_(n=1)^(infty)((1-q^(2n))(1-q^(3n))(1-q^(8n))(1-q^(12n)))/((1-q^n)(1-q^(24n))) = ...

A set function mu is finitely additive if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union _(k=1)^nE_k)=sum_(k=1)^nmu(E_k).

Define G(a,n)=1/aint_0^infty[1-e^(aEi(-t))sum_(k=0)^(n-1)((-a)^k[Ei(-t)]^k)/(k!)]. Then the Flajolet-Odlyzko constant is defined as G(1/2,1)=0.757823011268... (OEIS A143297).

A vector norm defined for a vector x=[x_1; x_2; |; x_n], with complex entries by |x|_1=sum_(r=1)^n|x_r|. The L^1-norm |x|_1 of a vector x is implemented in the Wolfram ...

Also known as the alternating series test. Given a series sum_(n=1)^infty(-1)^(n+1)a_n with a_n>0, if a_n is monotonic decreasing as n->infty and lim_(n->infty)a_n=0, then ...

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

A method for finding roots which defines P_j(x)=(P(x))/((x-x_1)...(x-x_j)), (1) so the derivative is (2) One step of Newton's method can then be written as ...

A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...