Search Results for ""

A theory of constructing initial conditions that provides safe convergence of a numerical root-finding algorithm for an equation f(z)=0. Point estimation theory treats ...

Trigonometric functions of npi/7 for n an integer cannot be expressed in terms of sums, products, and finite root extractions on real rational numbers because 7 is not a ...

A short theorem used in proving a larger theorem. Related concepts are the axiom, porism, postulate, principle, and theorem. The late mathematician P. Erdős has often been ...

Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...

The algebraic connectivity of a graph is the numerically second smallest eigenvalue (counting multiple eigenvalues separately) of the Laplacian matrix of a graph G. In other ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

The sum over all external (square) nodes of the lengths of the paths from the root of an extended binary tree to each node. For example, in the tree above, the external path ...

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

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...