Search Results for ""

"The" H graph is the tree on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["HGraph"]. The term "H-graph" is also used to refer to a ...

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

A type of integral named after Henstock and Kurzweil. Every Lebesgue integrable function is HK integrable with the same value.

A 2-variable oriented knot polynomial P_L(a,z) motivated by the Jones polynomial (Freyd et al. 1985). Its name is an acronym for the last names of its co-discoverers: Hoste, ...

A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...

Define psi(x)={1 0<=x<1/2; -1 1/2<x<=1; 0 otherwise (1) and psi_(jk)(x)=psi(2^jx-k) (2) for j a nonnegative integer and 0<=k<=2^j-1. So, for example, the first few values of ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

The integral associated with the Haar measure.

Any locally compact Hausdorff topological group has a unique (up to scalars) nonzero left invariant measure which is finite on compact sets. If the group is Abelian or ...

A one-dimensional transform which makes use of the Haar functions.