Search Results for ""

A constant appearing in formulas for the efficiency of the Euclidean algorithm, B = (12ln2)/(pi^2)[-1/2+6/(pi^2)zeta^'(2)]+C-1/2 (1) = 0.06535142... (2) (OEIS A143304), where ...

An estimation technique which is insensitive to small departures from the idealized assumptions which have been used to optimize the algorithm. Classes of such techniques ...

The objective of global optimization is to find the globally best solution of (possibly nonlinear) models, in the (possible or known) presence of multiple local optima. ...

Let m>=3 be an integer and let f(x)=sum_(k=0)^na_kx^(n-k) be an integer polynomial that has at least one real root. Then f(x) has infinitely many prime divisors that are not ...

The Laplacian polynomial is the characteristic polynomial of the Laplacian matrix. The second smallest root of the Laplacian polynomial of a graph g (counting multiple values ...

The tetranacci constant is ratio to which adjacent tetranacci numbers tend, and is given by T = (x^4-x^3-x^2-x-1)_2 (1) = 1.92756... (2) (OEIS A086088), where (P(x))_n ...

The height of a tree g is defined as the vertex height of its root vertex, where the vertex height of a vertex v in a tree g is the number of edges on the longest downward ...

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

The Barnes-Wall lattice is a d-dimensional lattice that exists when d is a power of 2. It is implemented in the Wolfram Language as LatticeData[{"BarnesWall", n}]. Special ...

The mean triangle area of a triangle picked inside a regular n-gon of unit area is A^__n=(9cos^2omega+52cosomega+44)/(36n^2sin^2omega), (1) where omega=2pi/n (Alikoski 1939; ...