Search Results for ""

The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...

A right strophoid is the strophoid of a line L with pole O not on L and fixed point O^' being the point where the perpendicular from O to L cuts L is called a right ...

A ruled surface is a surface that can be swept out by moving a line in space. It therefore has a parameterization of the form x(u,v)=b(u)+vdelta(u), (1) where b is called the ...

Simpson's rule is a Newton-Cotes formula for approximating the integral of a function f using quadratic polynomials (i.e., parabolic arcs instead of the straight line ...

A hyperboloid is a quadratic surface which may be one- or two-sheeted. The two-sheeted hyperboloid is a surface of revolution obtained by rotating a hyperbola about the line ...

A universal differential equation (UDE) is a nontrivial differential-algebraic equation with the property that its solutions approximate to arbitrary accuracy any continuous ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...

An octic graph is a regular graph of degree eight. The numbers of simple octic graphs on n=9, 10, 11, ... nodes are 1, 6, 94, 10786, 3459386, ... (OEIS A014378). Examples are ...

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...