Search Results for ""

The functions theta_s(u) = (H(u))/(H^'(0)) (1) theta_d(u) = (Theta(u+K))/(Theta(k)) (2) theta_c(u) = (H(u))/(H(K)) (3) theta_n(u) = (Theta(u))/(Theta(0)), (4) where H(u) and ...

Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Then ...

The term "null graph" is used both to refer to any empty graph and to the empty graph on 0 nodes. Because of the conflicting usage, it is probably best to avoid use of the ...

Given a set S of n nonnegative integers, the number partitioning problem requires the division of S into two subsets such that the sums of number in each subset are as close ...

The Ochoa curve is the elliptic curve 3Y^2=2X^3+386X^2+256X-58195, given in Weierstrass form as y^2=x^3-440067x+106074110. The complete set of 23 integer solutions (where ...

The octahemioctahedron, also called the octatetrahedron, is the uniform polyhedron with Maeder index 3 (Maeder 1997), Wenninger index 68 (Wenninger 1989), Coxeter index 37 ...

An oriented graph is a directed graph having no symmetric pair of directed edges. A complete oriented graph is called a tournament. The numbers of oriented graphs on n=1, 2, ...

A problem is assigned to the P (polynomial time) class if there exists at least one algorithm to solve that problem, such that the number of steps of the algorithm is bounded ...

A linkage invented in 1630 by Christoph Scheiner for making a scaled copy of a given figure. The linkage is pivoted at O; hinges are denoted circledot . By placing a pencil ...

The Patterson graph is the graph whose vertices are the 22880 centers of the Sylow 3-groups of the Suzuki group and in which two vertices are adjacent whenever they generate ...