Search Results for ""

The circumcircle of the Fuhrmann triangle. It has the line HNa, where H is the orthocenter and Na is the Nagel point, as its diameter. In fact, these points (Kimberling ...

Two mathematical objects are said to be homotopic if one can be continuously deformed into the other. For example, the real line is homotopic to a single point, as is any ...

A non-Euclidean geometry, also called Lobachevsky-Bolyai-Gauss geometry, having constant sectional curvature -1. This geometry satisfies all of Euclid's postulates except the ...

Given a function f(x), its inverse f^(-1)(x) is defined by f(f^(-1)(x))=f^(-1)(f(x))=x. (1) Therefore, f(x) and f^(-1)(x) are reflections about the line y=x. In the Wolfram ...

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

The topology on the Cartesian product X×Y of two topological spaces whose open sets are the unions of subsets A×B, where A and B are open subsets of X and Y, respectively. ...

There are at least two distinct notions of when a point process is stationary. The most commonly utilized terminology is as follows: Intuitively, a point process X defined on ...

A 1-factor of a graph G with n graph vertices is a set of n/2 separate graph edges which collectively contain all n of the graph vertices of G among their endpoints.

A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.

The clique polynomial C_G(x) for the graph G is defined as the polynomial C_G(x)=1+sum_(k=1)^(omega(G))c_kx^k, (1) where omega(G) is the clique number of G, the coefficient ...