Search Results for ""
6791 - 6800 of 7050 for 3Search Results
![](/common/images/search/spacer.gif)
The Klein bottle is a closed nonorientable surface of Euler characteristic 0 (Dodson and Parker 1997, p. 125) that has no inside or outside, originally described by Felix ...
A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...
The term Mandelbrot set is used to refer both to a general class of fractal sets and to a particular instance of such a set. In general, a Mandelbrot set marks the set of ...
The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...
Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...
Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...
The odd graph O_n of order n is a graph having vertices given by the (n-1)-subsets of {1,...,2n-1} such that two vertices are connected by an edge iff the associated subsets ...
The path graph P_n is a tree with two nodes of vertex degree 1, and the other n-2 nodes of vertex degree 2. A path graph is therefore a graph that can be drawn so that all of ...
A perfect magic cube is a magic cube for which the rows, columns, pillars, space diagonals, and diagonals of each n×n orthogonal slice sum to the same number (i.e., the magic ...
A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...
![](/common/images/search/spacer.gif)
...