Search Results for ""

Given n points, find the line segments with the shortest possible total length which connect the points. The segments need not necessarily be straight from one point to ...

A stem-and-leaf diagram, also called a stem-and-leaf plot, is a diagram that quickly summarizes data while maintaining the individual data points. In such a diagram, the ...

Stern's diatomic series is the sequence 1, 1,2, 1,3,2,3, 1,4,3,5,2,5,3,4, (1) ... (OEIS A002487) which arises in the Calkin-Wilf tree. It is sometimes also known as the fusc ...

Polynomials S_k(x) which form the Sheffer sequence for g(t) = e^(-t) (1) f^(-1)(t) = ln(1/(1-e^(-t))), (2) where f^(-1)(t) is the inverse function of f(t), and have ...

A substitution system in which rules are used to operate on a string consisting of letters of a certain alphabet. String rewriting systems are also variously known as ...

A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...

A subgraph G^' of a graph G is a graph G^' whose vertex set and edge set are subsets of those of G. If G^' is a subgraph of G, then G is said to be a supergraph of G^' ...

For a particular format in the IEEE 754-2008 framework, a subnormal number is a nonzero floating-point number with magnitude less than the magnitude of that formatÕs smallest ...

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

For a graph vertex x of a graph, let Gamma_x and Delta_x denote the subgraphs of Gamma-x induced by the graph vertices adjacent to and nonadjacent to x, respectively. The ...