Search Results for ""

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...

An auction in which the highest bidder wins but pays only the second-highest bid. This variation over the normal bidding procedure is supposed to encourage bidders to bid the ...

The nonnegative integers 0, 1, 2, ....

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

There are several versions of the Kaplan-Yorke conjecture, with many of the higher dimensional ones remaining unsettled. The original Kaplan-Yorke conjecture (Kaplan and ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), NaN (or "not a number") is a symbolic floating-point representation which is neither a signed infinity nor ...

Two losing gambling games can be set up so that when they are played one after the other, they become winning. There are many ways to construct such scenarios, the simplest ...

Given a function f(x_1,...,x_n) defined on a domain U, the graph of f is defined as the set of points (which often form a curve or surface) showing the values taken by f over ...

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 ...