Search Results for ""

A polynomial Z_G(q,v) in two variables for abstract graphs. A graph with one graph vertex has Z=q. Adding a graph vertex not attached by any graph edges multiplies the Z by ...

Let G be a group of group order h and D be a set of k elements of G. If the set of differences d_i-d_j contains every nonzero element of G exactly lambda times, then D is a ...

Differential entropy differs from normal or absolute entropy in that the random variable need not be discrete. Given a continuous random variable X with a probability density ...

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

Consider the process of taking a number, taking its digit sum, then adding the digits of numbers derived from it, etc., until the remaining number has only one digit. The ...

A local sink is a node of a directed graph with no exiting edges, also called a terminal (Borowski and Borwein 1991, p. 401; left figure). A global sink (often simply called ...

An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...

The dihedral angle is the angle theta between two planes. The dihedral angle between the planes a_1x+b_1y+c_1z+d_1 = 0 (1) a_2x+b_2y+c_2z+d_2 = 0 (2) which have normal ...

The dihedral group D_4 is one of the two non-Abelian groups of the five groups total of group order 8. It is sometimes called the octic group. An example of D_4 is the ...

The group D_5 is one of the two groups of order 10. Unlike the cyclic group C_(10), D_5 is non-Abelian. The molecule ruthenocene (C_5H_5)_2Ru belongs to the group D_(5h), ...