Search Results for ""

An ordinary differential equation (frequently called an "ODE," "diff eq," or "diffy Q") is an equality involving a function and its derivatives. An ODE of order n is an ...

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

Kontsevich's integral is a far-reaching generalization of the Gauss integral for the linking number, and provides a tool to construct the universal Vassiliev invariant of a ...

A square which can be dissected into a number of smaller squares with no two equal is called a perfect square dissection (or a squared square). Square dissections in which ...

A polygon can be defined (as illustrated above) as a geometric object "consisting of a number of points (called vertices) and an equal number of line segments (called sides), ...

A regular polygon is an n-sided polygon in which the sides are all the same length and are symmetrically placed about a common center (i.e., the polygon is both equiangular ...

Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...

There are four varieties of Airy functions: Ai(z), Bi(z), Gi(z), and Hi(z). Of these, Ai(z) and Bi(z) are by far the most common, with Gi(z) and Hi(z) being encountered much ...