Search Results for ""

The Pell graph Pi_n is the graph defined as follows. Consider n-tuples of (0,1,2) such that maximal blocks of an odd number of 2's are forbidden. Take these as the vertices ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...

A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...

A test used to determine the statistical significance of an observation. Two main types of error can occur: 1. A type I error occurs when a false negative result is obtained ...

The Struve function, denoted H_n(z) or occasionally H_n(z), is defined as H_nu(z)=(1/2z)^(nu+1)sum_(k=0)^infty((-1)^k(1/2z)^(2k))/(Gamma(k+3/2)Gamma(k+nu+3/2)), (1) where ...

The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total distance) Hamiltonian cycle a salesman can take through each of n ...

Two lattice points (x,y) and (x^',y^') are mutually visible if the line segment joining them contains no further lattice points. This corresponds to the requirement that ...

The Walsh functions consist of trains of square pulses (with the allowed states being -1 and 1) such that transitions may only occur at fixed intervals of a unit time step, ...

A general n-gonal antiprism is a polyhedron consisting of identical top and bottom n-gonal faces whose periphery is bounded by a band of 2n triangles with alternating up-down ...

An equilateral triangle is a triangle with all three sides of equal length a, corresponding to what could also be known as a "regular" triangle. An equilateral triangle is ...