Search Results for ""

The Cunningham function, sometimes also called the Pearson-Cunningham function, can be expressed using Whittaker functions (Whittaker and Watson 1990, p. 353). ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

An implicit method for solving an ordinary differential equation that uses f(x_n,y_n) in y_(n+1). In the case of a heat equation, for example, this means that a linear system ...

An (n,k) fountain is an arrangement of n coins in rows such that exactly k coins are in the bottom row and each coin in the (i+1)st row touches exactly two in the ith row. ...

Let f(x) be a monic polynomial of degree d with discriminant Delta. Then an odd integer n with (n,f(0)Delta)=1 is called a Frobenius pseudoprime with respect to f(x) if it ...

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...

Gregory's formula is a formula that allows a definite integral of a function to be expressed by its sum and differences, or its sum by its integral and difference (Jordan ...

The intersection of two sets A and B is the set of elements common to A and B. This is written A intersection B, and is pronounced "A intersection B" or "A cap B." The ...

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...