Search Results for ""

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

The Bernoulli distribution is a discrete distribution having two possible outcomes labelled by n=0 and n=1 in which n=1 ("success") occurs with probability p and n=0 ...

The Bernoulli inequality states (1+x)^n>1+nx, (1) where x>-1!=0 is a real number and n>1 an integer. This inequality can be proven by taking a Maclaurin series of (1+x)^n, ...

A series of the form sum_(n=0)^inftya_nJ_(nu+n)(z), (1) where nu is a real and J_(nu+n)(z) is a Bessel function of the first kind. Special cases are ...

The boustrophedon ("ox-plowing") transform b of a sequence a is given by b_n = sum_(k=0)^(n)(n; k)a_kE_(n-k) (1) a_n = sum_(k=0)^(n)(-1)^(n-k)(n; k)b_kE_(n-k) (2) for n>=0, ...

Contracting tensors lambda with nu in the Bianchi identities R_(lambdamunukappa;eta)+R_(lambdamuetanu;kappa)+R_(lambdamukappaeta;nu)=0 (1) gives ...

1 0 1 0 1 1 0 1 2 2 0 2 4 5 5 (1) The Entringer numbers E(n,k) (OEIS A008281) are the number of permutations of {1,2,...,n+1}, starting with k+1, which, after initially ...

The solution to the differential equation [D^(2v)+alphaD^v+betaD^0]y(t)=0 (1) is y(t)={e_alpha(t)-e_beta(t) for alpha!=beta; ...

Given a short exact sequence of modules 0->A->B->C->0, (1) let ...->P_2->^(d_2)P_1->^(d_1)P_0->^(d_0)A->0 (2) ...->Q_2->^(f_2)Q_1->^(f_1)Q_0->^(f_0)C->0 (3) be projective ...

An approximation for the gamma function Gamma(z+1) with R[z]>0 is given by Gamma(z+1)=sqrt(2pi)(z+sigma+1/2)^(z+1/2)e^(-(z+sigma+1/2))sum_(k=0)^inftyg_kH_k(z), (1) where ...