Search Results for ""

Let N be an odd integer, and assume there exists a Lucas sequence {U_n} with associated Sylvester cyclotomic numbers {Q_n} such that there is an n>sqrt(N) (with n and N ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

A set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

Li's criterion states that the Riemann hypothesis is equivalent to the statement that, for lambda_n=1/((n-1)!)(d^n)/(ds^n)[s^(n-1)lnxi(s)]|_(s=1), (1) where xi(s) is the ...

A modified spherical Bessel function of the first kind (Abramowitz and Stegun 1972), also called a "spherical modified Bessel function of the first kind" (Arfken 1985), is ...

A modified spherical Bessel function of the second kind, also called a "spherical modified Bessel function of the first kind" (Arfken 1985) or (regrettably) a "modified ...

A primefree sequence is sequence whose terms are never prime. Graham (1964) proved that there exist relatively prime positive integers a and b such that the recurrence ...

A sequence which arises in the hypothetical reproduction of a population of rabbits. Let the substitution system map 0->1 correspond to young rabbits growing old, and 1->10 ...