Search Results for ""

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

Consider an arbitrary one-dimensional map x_(n+1)=F(x_n) (1) (with implicit parameter r) at the onset of chaos. After a suitable rescaling, the Feigenbaum function ...

The determination of a test for the equality of means for two normal distributions with different variances given samples from each. There exists an exact test which, ...

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...

The Smale horseshoe map consists of a sequence of operations on the unit square. First, stretch in the y direction by more than a factor of two, then compress in the x ...

The tetragonal antiwedge is the topological class of hexahedron. It has 10 edges and 6 vertices and its faces consist of 4 triangles and 2 quadrilaterals. A tetragonal ...

The tensor product of two vector spaces V and W, denoted V tensor W and also called the tensor direct product, is a way of creating a new vector space analogous to ...