Search Results for ""

A problem related to the continuum hypothesis which was solved by Solovay (1970) using the inaccessible cardinals axiom. It has been proven by Shelah and Woodin (1990) that ...

Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...

A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...

The Lucas polynomials are the w-polynomials obtained by setting p(x)=x and q(x)=1 in the Lucas polynomial sequence. It is given explicitly by ...

A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...

All Mathieu functions have the form e^(irz)f(z), where f(z) has period 2pi and r is known as the Mathieu characteristic exponent. This exponent is returned by the Wolfram ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The nested radical constant is the constant defined by C = sqrt(1+sqrt(2+sqrt(3+sqrt(4+sqrt(5+...))))) (1) = 1.75793275... (2) (OEIS A072449). No closed-form expression is ...

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...

A vector space V with a ring structure and a vector norm such that for all v,W in V, ||vw||<=||v||||w||. If V has a multiplicative identity 1, it is also required that ...