Search Results for ""

The elliptic modulus k is a quantity used in elliptic integrals and elliptic functions defined to be k=sqrt(m), where m is the parameter. An elliptic integral is written ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

The Hungarian algorithm finds a maximum independent edge set on a graph. The algorithm starts with any matching M and constructs a tree via a breadth-first search to find an ...

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...

An integral embedding of a graph, not to be confused with an integral graph, is a graph drawn such that vertices are distinct points and all graph edges have integer lengths. ...

The logistic equation (sometimes called the Verhulst model or logistic growth curve) is a model of population growth first published by Pierre Verhulst (1845, 1847). The ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

By asking a small number of innocent-sounding questions about an unknown number, it is possible to reconstruct the number with absolute certainty (assuming that the questions ...

Every totally ordered set (A,<=) is associated with a so-called order type. Two sets A and B are said to have the same order type iff they are order isomorphic (Ciesielski ...

A set of four points, one of which is the orthocenter of the other three. In an orthocentric system, each point is the orthocenter of the triangle of the other three, as ...