Search Results for ""

A graph that is not finite is called infinite.

In a category C, an initial object is an object I in Ob(C) such that for any other object X in Ob(C), there is one and only one morphism from I to X.

A type of plot invented by M. Trott that shows the behavior of a function near and far from the origin simultaneously. Inside a given radius, the plot shows the actual value ...

A discrete subset of R^s which is closed under addition and subtraction and which contains Z^s as a subset.

A definition of a set by mentioning a defining property.

Interest is a fee (or payment) made for the borrowing (or lending) of money. The two most common types of interest are simple interest, for which interest is paid only on the ...

One of the "knots" t_(p+1), ..., t_(m-p-1) of a B-spline with control points P_0, ..., P_n and knot vector T={t_0,t_1,...,t_m}, where p=m-n-1.

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

The use of three prior points in a root-finding algorithm to estimate the zero crossing.

The Ionin-Kharaghani graph is a strongly regular graph on 765 vertices and 73440 edges. It has regular parameters (nu,k,lambda,mu)=(765,192,48,48). It is implemented in the ...