Search Results for ""

The detour index omega(G) of a graph G is a graph invariant defined as half the sum of all off-diagonal matrix elements of the detour matrix of G. Unless otherwise stated, ...

A Fourier series is an expansion of a periodic function f(x) in terms of an infinite sum of sines and cosines. Fourier series make use of the orthogonality relationships of ...

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

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

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

For homogeneous polynomials P and Q of degree n, [P,Q]=sum_(i_1,...,i_n>=0)(i_1!...i_n!)(a_(i,...,i_n)b_(i_1,...,i_n)).

An operator Gamma=sum_(i=1)^me_i^Ru^(iR) on a representation R of a Lie algebra.

delta(x-t)=sum_(n=0)^inftyphi_n(x)phi_n(t), where delta(x) is the delta function.

For a finite group of h elements with an n_ith dimensional ith irreducible representation, sum_(i)n_i^2=h.