Search Results for ""

A cusp form is a modular form for which the coefficient c(0)=0 in the Fourier series f(tau)=sum_(n=0)^inftyc(n)e^(2piintau) (1) (Apostol 1997, p. 114). The only entire cusp ...

The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...

Let Q_i denote anything subject to weighting by a normalized linear scheme of weights that sum to unity in a set W. The Kolmogorov axioms state that 1. For every Q_i in W, ...

A nonuniform rational B-spline surface of degree (p,q) is defined by ...

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 maximum spanning tree is a spanning tree of a weighted graph having maximum weight. It can be computed by negating the weights for each edge and applying Kruskal's ...

A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

The ABC (atom-bond connectivity) matrix A_(ABC) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt((d_i+d_j-2)/(d_id_j)), (1) where d_i are the ...

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...