Search Results for ""

A skewed distribution which is similar to the binomial distribution when p!=q (Abramowitz and Stegun 1972, p. 930). y=k(t+A)^(A^2-1)e^(-At), (1) for t in [0,infty) where A = ...

Suppose that in some neighborhood of x=0, F(x)=sum_(k=0)^infty(phi(k)(-x)^k)/(k!) (1) for some function (say analytic or integrable) phi(k). Then ...

A series expansion is a representation of a particular function as a sum of powers in one of its variables, or by a sum of powers of another (usually elementary) function ...

A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...

A second-order ordinary differential equation d/(dx)[p(x)(dy)/(dx)]+[lambdaw(x)-q(x)]y=0, where lambda is a constant and w(x) is a known function called either the density or ...

Let B_n(r) be the n-dimensional closed ball of radius r>1 centered at the origin. A function which is defined on B(r) is called an extension to B(r) of a function f defined ...

The term "bundle" is an abbreviated form of the full term fiber bundle. Depending on context, it may mean one of the special cases of fiber bundles, such as a vector bundle ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...