Search Results for ""

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...

An algorithm for finding roots for quartic equations with complex roots.

This is proven in Rademacher and Toeplitz (1957).

A list is a data structure consisting of an ordered set of elements, each of which may be a number, another list, etc. A list is usually denoted (a_1, a_2, ..., a_n) or ...

A statement letter or a negation of a statement letter (Mendelson 1997, p. 30).

A roll of 4 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a little Joe" is 1/12, or 8.333...%. A roll of "4 the hard ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

The conjecture that the maximum local density is given by rho_(dodecahedron).