Search Results for ""

The nesting of two or more functions to form a single new function is known as composition. The composition of two functions f and g is denoted f degreesg, where f is a ...

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...

Elder's theorem is a generalization of Stanley's theorem which states that the total number of occurrences of an integer k among all unordered partitions of n is equal to the ...

A differential evolution method used to minimize functions of real variables. Evolution strategies are significantly faster at numerical optimization than traditional genetic ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...

The bandwidth of a connected graph G is the minimum matrix bandwidth among all possible adjacency matrices of graphs isomorphic to G. Equivalently, it is the minimum graph ...

A graphic sequence is a sequence of numbers which can be the degree sequence of some graph. A sequence can be checked to determine if it is graphic using GraphicQ[g] in the ...

Given a commutative ring R, an R-algebra H is a Hopf algebra if it has additional structure given by R-algebra homomorphisms Delta:H->H tensor _RH (1) (comultiplication) and ...

In combinatorial logic minimization, a device known as a Karnaugh map is frequently used. It is similar to a truth table, but the various variables are represented along two ...