Search Results for ""

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...

In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...

Inversion is the process of transforming points P to a corresponding set of points P^' known as their inverse points. Two points P and P^' are said to be inverses with ...

An irrational number is a number that cannot be expressed as a fraction p/q for any integers p and q. Irrational numbers have decimal expansions that neither terminate nor ...

The Legendre polynomials, sometimes called Legendre functions of the first kind, Legendre coefficients, or zonal harmonics (Whittaker and Watson 1990, p. 302), are solutions ...

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 ...

Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...