Search Results for ""

A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A hash function H projects a value from a set with many (or even an infinite number of) members to a value from a set with a fixed number of (fewer) members. Hash functions ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...

The Laplace transform is an integral transform perhaps second only to the Fourier transform in its utility in solving physical problems. The Laplace transform is particularly ...

A manifold is a topological space that is locally Euclidean (i.e., around every point, there is a neighborhood that is topologically the same as the open unit ball in R^n). ...

The Paulus graphs are the 15 strongly regular graphs on 25 nodes with parameters (nu,k,lambda,mu)=(25,12,5,6) and the 10 strongly regular graphs on 26 nodes with parameters ...

The Penrose tiles are a pair of shapes that tile the plane only aperiodically (when the markings are constrained to match at borders). These two tiles, illustrated above, are ...

A special function mostly commonly denoted psi_n(z), psi^((n))(z), or F_n(z-1) which is given by the (n+1)st derivative of the logarithm of the gamma function Gamma(z) (or, ...

A quadratic map is a quadratic recurrence equation of the form x_(n+1)=a_2x_n^2+a_1x_n+a_0. (1) While some quadratic maps are solvable in closed form (for example, the three ...