Search Results for ""

Eigenvectors are a special set of vectors associated with a linear system of equations (i.e., a matrix equation) that are sometimes also known as characteristic vectors, ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

A one-person game played on a rectangular lattice of lamps which can be turned on and off. A move consists of flipping a "switch" inside one of the squares, thereby toggling ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

Stellation is the process of constructing polyhedra by extending the facial planes past the polyhedron edges of a given polyhedron until they intersect (Wenninger 1989). The ...

An asymptotic series is a series expansion of a function in a variable x which may converge or diverge (Erdélyi 1987, p. 1), but whose partial sums can be made an arbitrarily ...

The partial differential equation u_t+u_x+uu_x-u_(xxt)=0 (Benjamin et al. 1972; Arvin and Goldstein 1985; Zwillinger 1997, p. 130). A generalized version is given by u_t-del ...

The partial differential equation u_t+uu_x=nuu_(xx) (Benton and Platzman 1972; Zwillinger 1995, p. 417; Zwillinger 1997, p. 130). The so-called nonplanar Burgers equation is ...

The symbol ^ which is used to denote partial conjunction in symbolic logic. It also appears in several other contexts in mathematics and is sometimes called a "wedge". In ...

Characteristic classes are cohomology classes in the base space of a vector bundle, defined through obstruction theory, which are (perhaps partial) obstructions to the ...