Search Results for ""

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

The quadratic embedding constant QEC(G) of a finite simple connected graph G on n vertices is defined as the maximum of the product vDv over all real n-vectors v satisfying ...

A repeating decimal, also called a recurring decimal, is a number whose decimal representation eventually becomes periodic (i.e., the same sequence of digits repeats ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

Consider a game, first proposed by Nicolaus Bernoulli, in which a player bets on how many tosses of a coin will be needed before it first turns up heads. The player pays a ...

The score sequence of a tournament is a monotonic nondecreasing sequence of the outdegrees of the graph vertices of the corresponding tournament graph. Elements of a score ...

A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...

Stratton (1935), Chu and Stratton (1941), and Rhodes (1970) define the spheroidal functions as those solutions of the differential equation (1) that remain finite at the ...

The standard deviation sigma of a probability distribution is defined as the square root of the variance sigma^2, sigma = sqrt(<x^2>-<x>^2) (1) = sqrt(mu_2^'-mu^2), (2) where ...

The asymptotic series for the gamma function is given by (1) (OEIS A001163 and A001164). The coefficient a_n of z^(-n) can given explicitly by ...