Search Results for ""

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

A set of curvilinear coordinates defined by x = (asinhv)/(coshv-cosu) (1) y = (asinu)/(coshv-cosu) (2) z = z, (3) where u in [0,2pi), v in (-infty,infty), and z in ...

A pair of vertices (x,y) of a graph G is called an omega-critical pair if omega(G+xy)>omega(G), where G+xy denotes the graph obtained by adding the edge xy to G and omega(H) ...

Let S_n be the set of permutations of {1, 2, ..., n}, and let sigma_t be the continuous time random walk on S_n that results when randomly chosen transpositions are performed ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

One of the symbols { and } used in many different contexts in mathematics. Braces are used 1. To denote grouping of mathematical terms, usually as the outermost delimiter in ...

Various forms of opening and closing bracket-like delimiters are used for a number of distinct notational purposes in mathematics. The most common variants of bracket ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

If n=1,2 (mod 4), and the squarefree part of n is divisible by a prime p=3 (mod 4), then no difference set of order n exists. Equivalently, if a projective plane of order n ...