Search Results for ""
8431 - 8440 of 13134 for complexity theorySearch Results
A simple pole of an analytic function f is a pole of order one. That is, (z-z_0)f(z) is an analytic function at the pole z=z_0. Alternatively, its principal part is c/(z-z_0) ...
A root having multiplicity n=1 is called a simple root. For example, f(z)=(z-1)(z-2) has a simple root at z_0=1, but g=(z-1)^2 has a root of multiplicity 2 at z_0=1, which is ...
Let f:K^((0))->L^((0)) be a bijective correspondence such that the vertices v_0, ..., v_n of K span a simplex of K iff f(v_0), ..., f(v_n) span a simplex of L. Then the ...
Let K and L be simplicial complexes, and let f:K^((0))->L^((0)) be a map. Suppose that whenever the vertices v_0, ..., v_n of K span a simplex of K, the points f(v_0), ..., ...
The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...
If a line L is the Simson line of a point P on the circumcircle of a triangle, then P is called the pole of L (Honsberger 1995, p. 128).
A finite set of equations in the same unknowns of which the common solutions have to be determined. Solution of simultaneous equations in implemented in the Wolfram Language ...
Sinai billiards is the reflection of a ray of light by an arrangement of perfectly reflecting circles in the plane (Trott 2004, pp. 28-30). The path is extremely sensitive to ...
The surface given by the parametric equations x = asinu (1) y = asinv (2) z = asin(u+v). (3) It is a sextic surface with algebraic equation (4) The coefficients of the first ...
The function from a given nonempty set X to the power set P(X) that maps every element x of X to the set {x}.
...
View search results from all Wolfram sites (28442 matches)

