Search Results for ""

Let G be a simple connected graph, and take 0<=i<=d(G), where d(G) is the graph diameter. Then G has global parameters c_i (respectively a_i, b_i) if the number of vertices ...

The sum I over all internal (circular) nodes of the paths from the root of an extended binary tree to each node. For example, in the tree above, the internal path length is ...

A theorem about (or providing an equivalent definition of) compact sets, originally due to Georg Cantor. Given a decreasing sequence of bounded nonempty closed sets C_1 ...

A real-valued univariate function f=f(x) has a jump discontinuity at a point x_0 in its domain provided that lim_(x->x_0-)f(x)=L_1<infty (1) and lim_(x->x_0+)f(x)=L_2<infty ...

A Pythagorean triangle is a right triangle with integer side lengths (i.e., whose side lengths (a,b,c) form a Pythagorean triple). A Pythagorean triangle with GCD(a,b,c)=1 is ...

The large Witt graph, also called the octad graph (Brouwer) or Witt graph (DistanceRegular.org), is the graph whose vertices are the 759 blocks of a Steiner system S(5,8,24) ...

A function built up of a finite combination of constant functions, field operations (addition, multiplication, division, and root extractions--the elementary operations)--and ...

Let M^n be a compact n-dimensional oriented Riemannian manifold without boundary, let O be a group representation of pi_1(M) by orthogonal matrices, and let E(O) be the ...

Informally, the term asymptotic means approaching a value or curve arbitrarily closely (i.e., as some sort of limit is taken). A line or curve A that is asymptotic to given ...

The dual vector space to a real vector space V is the vector space of linear functions f:V->R, denoted V^*. In the dual of a complex vector space, the linear functions take ...