Search Results for ""

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

The Jerabek hyperbola is a circumconic that is the isogonal conjugate of the Euler line (Kimberling 1998, p. 237). Since it is a circumconic passing through the orthocenter, ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a signaling NaN or sNaN is a NaN which is signaling in the sense of being most commonly returned in ...

A typesetting symbol which has several distinct meanings in mathematics. It is used for a number of purposes. 1. To denote Boundaries between elements in a list, as in ...

A topology is given by a collection of subsets of a topological space X. The smallest topology has two open sets, the empty set emptyset and X. The largest topology contains ...

Let a Gram point g_n be called "good" if (-1)^nZ(g_n)>0, and "bad" otherwise (Rosser et al. 1969; Edwards 2001, p. 180). Then the interval between two consecutive good Gram ...

Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...

A triangle center (sometimes simply called a center) is a point whose trilinear coordinates are defined in terms of the side lengths and angles of a triangle and for which a ...

The most general forced form of the Duffing equation is x^..+deltax^.+(betax^3+/-omega_0^2x)=gammacos(omegat+phi). (1) Depending on the parameters chosen, the equation can ...

The four-color theorem states that any map in a plane can be colored using four-colors in such a way that regions sharing a common boundary (other than a single point) do not ...