Search Results for ""

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

A sequence {x_1,x_2,...} is equidistributed iff lim_(N->infty)1/Nsum_(n<N)e^(2piimx_n)=0 for each m=1, 2, .... A consequence of this result is that the sequence {frac(nx)} is ...

The Whittaker functions arise as solutions to the Whittaker differential equation. The linearly independent solutions to this equation are M_(k,m)(z) = ...

The Wigner 9j-symbols are a generalization of Clebsch-Gordan coefficients and Wigner 3j- and 6j-symbols which arises in the coupling of four angular momenta. They can be ...

Let a piecewise smooth function f with only finitely many discontinuities (which are all jumps) be defined on [-pi,pi] with Fourier series a_k = 1/piint_(-pi)^pif(t)cos(kt)dt ...

The "witch of Agnesi" is a curve studied by Maria Agnesi in 1748 in her book Instituzioni analitiche ad uso della gioventù italiana (the first surviving mathematical work ...

A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph (Skiena 1990, p. 177). The maximum edge connectivity of a given ...

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

A phenomenological law also called the first digit law, first digit phenomenon, or leading digit phenomenon. Benford's law states that in listings, tables of statistics, ...

The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...