Search Results for ""

Let K subset= C be compact, let f be analytic on a neighborhood of K, and let P subset= C^*\K contain at least one point from each connected component of C^*\K. Then for any ...

There are at least two Siegel's theorems. The first states that an elliptic curve can have only a finite number of points with integer coordinates. The second states that if ...

Let G(V,E) be a graph with graph vertices V and graph edges E on n graph vertices without a (k+1)-clique. Then t(n,k)<=((k-1)n^2)/(2k), where t(n,k) is the edge count. (Note ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

where _3F_2(a,b,c;d,e;z) is a generalized hypergeometric function and Gamma(z) is the gamma function (Bailey 1935, p. 16; Koepf 1998, p. 32).

A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...

Four circles c_1, c_2, c_3, and c_4 are tangent to a fifth circle or a straight line iff T_(12)T_(34)+/-T_(13)T_(42)+/-T_(14)T_(23)=0. (1) where T_(ij) is the length of a ...

The longstanding conjecture that the nonimaginary solutions E_n of zeta(1/2+iE_n)=0, (1) where zeta(z) is the Riemann zeta function, are the eigenvalues of an "appropriate" ...

The Montgomery-Odlyzko law (which is a law in the sense of empirical observation instead of through mathematical proof) states that the distribution of the spacing between ...

An analytic refinement of results from complex analysis such as those codified by Picard's little theorem, Picard's great theorem, and the Weierstrass-Casorati theorem.