Search Results for ""

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A Lie groupoid over B is a groupoid G for which G and B are differentiable manifolds and alpha,beta and multiplication are differentiable maps. Furthermore, the derivatives ...

The mixtilinear triangle is the triangle connecting the centers of the mixtilinear incircles. It has trilinear vertex matrix (1) In has area (2) where Delta is the area of ...

A theorem which specifies the structure of the generic unitary representation of the Weyl relations and thus establishes the equivalence of Heisenberg's matrix mechanics and ...

The third Brocard triangle is Gibert's term for the isogonal conjugate of the first Brocard triangle. It has trilinear vertex matrix [b^2c^2 ab^3 ac^3; a^3b a^2c^2 bc^3; a^3c ...

Let f(x) be a positive definite, measurable function on the interval (-infty,infty). Then there exists a monotone increasing, real-valued bounded function alpha(t) such that ...

Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...

A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...

A triangle-free graph is a graph containing no graph cycles of length three. A simple graph is triangle-free iff Tr(A^3)=0, where A is the adjacency matrix of the graph and ...

The matrix product of a square set of data d and a matrix of basis vectors consisting of Walsh functions. By taking advantage of the nested structure of the natural ordering ...