Search Results for ""

An n×n array is called a square array. Considered as a matrix, a square array is called a square matrix.

A function f(x) is said to be square integrable if int_(-infty)^infty|f(x)|^2dx is finite.

A subspace A of X is called a strong deformation retract of X if there is a homotopy F:X×I->X (called a retract) such that for all x in X, a in A, and t in I, 1. F(x,0)=x, 2. ...

The symmedial circle is the circumcircle of the symmedial triangle. It has circle function l=(bc(a^4-a^2b^2-b^4-a^2c^2-b^2c^2-c^4))/(2(a^2+b^2)(a^2+c^2)(b^2+c^2)), (1) which ...

One trillion (10^(12)) bytes. Unfortunately, the term is sometimes also used to mean 2^(40)=1024^4=1099511627776 bytes. However, this usage is deprecated, and the term ...

The set of all centroid points in a weighted tree (Harary 1994, p. 36).

The triangle coefficient is function of three variables written Delta(abc)=Delta(a,b,c) and defined by Delta(abc)=((a+b-c)!(a-b+c)!(-a+b+c)!)/((a+b+c+1)!), (Shore and Menzel ...

The triangle transformation principle gives rules for transforming equations involving an incircle to equations about excircles.

Every real number is negative, 0, or positive. The law is sometimes stated as "For arbitrary real numbers a and b, exactly one of the relations a<b, a=b, a>b holds" (Apostol ...

Let a cotree of a spanning tree T in a connected graph G be denoted T^*. Then the edges of G which are not in T^* are called its twigs (Harary 1994, p. 39).