Search Results for ""

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

The Gewirtz graph, sometimes also called the Sims-Gewirtz graph (Brouwer), is an integral graph on 56 nodes and 280 edges that is also a regular graph of order 10. It is ...

The Tutte 12-cage, also called the Benson graph (Exoo and Jajcay 2008), is the unique 12-cage graph, equivalent to the generalized hexagon GH(2,2) and alternately called the ...

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

A circle that in internally tangent to two sides of a triangle and to the circumcircle is called a mixtilinear incircle. There are three mixtilinear incircles, one ...

A compactification of a topological space X is a larger space Y containing X which is also compact. The smallest compactification is the one-point compactification. For ...

Given a point P in the interior of a triangle DeltaA_1A_2A_3, draw the cevians through P from each polygon vertex which meet the opposite sides at P_1, P_2, and P_3. Now, ...

A mathematical property P holds locally if P is true near every point. In many different areas of mathematics, this notion is very useful. For instance, the sphere, and more ...

A multidimensional point process is a measurable function from a probability space (Omega,A,P) into (X,Sigma) where X is the set of all finite or countable subsets of R^d not ...

Consider a reference triangle DeltaABC with circumcenter O and orthocenter H, and let DeltaA^*B^*C^* be its reflection triangle. Then Musselman's theorem states that the ...