Search Results for ""
271 - 280 of 740 for Elementary Cellular AutomatonSearch Results
Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...
A set partition of the rational numbers into two nonempty subsets S_1 and S_2 such that all members of S_1 are less than those of S_2 and such that S_1 has no greatest ...
The operation of drilling a tubular neighborhood of a knot K in S^3 and then gluing in a solid torus so that its meridian curve goes to a (p,q)-curve on the torus boundary of ...
A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...
Two figures are said to be similar when all corresponding angles are equal, and are directly similar when all corresponding angles are equal and described in the same ...
The first solution to Lamé's differential equation, denoted E_n^m(x) for m=1, ..., 2n+1. They are also called Lamé functions. The product of two ellipsoidal harmonics of the ...
Ellipsoidal harmonics of the second kind, also known as Lamé functions of the second kind, are variously defined as F_m^p(x)=(2m+1)E_m^p(x) ...
The Enneper surfaces are a three-parameter family of surfaces with constant negative curvature (and nonconstant mean curvature). In general, they are described by elliptic ...
A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...
Let O and I be the circumcenter and incenter of a triangle with circumradius R and inradius r. Let d be the distance between O and I. Then d^2=R(R-2r) (Mackay 1886-1887; ...
...
View search results from all Wolfram sites (127389 matches)

