Search Results for ""

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

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

There are least two Bang's theorems, one concerning tetrahedra (Bang 1897), and the other with widths of convex domains (Bang 1951). The theorem of Bang (1897) states that ...

A Gaussian quadrature-like formula over the interval [-1,1] which has weighting function W(x)=x. The general formula is int_(-1)^1xf(x)dx=sum_(i=1)^nw_i[f(x_i)-f(-x_i)]. n ...

The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...

Let f be a finite real-valued function defined on an interval [a,b]. Then at every point in [a,b] except on a set of Lebesgue measure zero, either: 1. There is a finite ...

An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).

A point about which inversion of two circles produced concentric circles. Every pair of distinct circles has two limiting points. The limiting points correspond to the point ...

The study of manifolds having a complete Riemannian metric. Riemannian geometry is a general space based on the line element ds=F(x^1,...,x^n;dx^1,...,dx^n), with F(x,y)>0 ...

The d-dimensional rigidity matrix M(G) of a graph G with vertex count n, edge count m in the variables v_i=(x_1,...,x_d) is the m×(dn) matrix with rows indexed by the edges ...