Search Results for ""

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.

Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...

A map projection in which the distances between one or two points and every other point on the map differ from the corresponding distances on the sphere by only a constant ...

The difference of a quantity from some fixed value, usually the "correct" or "expected" one.

If one looks inside a flat origami without unfolding it, one sees a zigzagged profile, determined by an alternation of "mountain-creases" and "valley-creases." The numbers of ...

A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...

Suppose for every point x in a manifold M, an inner product <·,·>_x is defined on a tangent space T_xM of M at x. Then the collection of all these inner products is called ...

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