Search Results for ""

A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...

The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...

The regular octagon is the regular polygon with eight sides, as illustrated above. The inradius r, circumradius R, and area A of the regular octagon can be computed directly ...

An analytic function f(z) whose Laurent series is given by f(z)=sum_(n=-infty)^inftya_n(z-z_0)^n, (1) can be integrated term by term using a closed contour gamma encircling ...

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

A standard basis, also called a natural basis, is a special orthonormal vector basis in which each basis vector has a single nonzero entry with value 1. In n-dimensional ...

In each of the ten cases with zero or unit mass, the finite part of the scalar 3-loop tetrahedral vacuum Feynman diagram reduces to four-letter "words" that represent ...

Let x and y be vectors. Then the triangle inequality is given by |x|-|y|<=|x+y|<=|x|+|y|. (1) Equivalently, for complex numbers z_1 and z_2, ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

A unicyclic graph is a connected graph containing exactly one cycle (Harary 1994, p. 41). A connected unicyclic graph is therefore a pseudotree that is not a tree. ...