Search Results for ""

A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

An array of "trees" of unit height located at integer-coordinate points in a point lattice. When viewed from a corner along the line y=x in normal perspective, a quadrant of ...

The number of alternating permutations for n elements is sometimes called an Euler zigzag number. Denote the number of alternating permutations on n elements for which the ...

The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in ...

A graph vertex in a graph is said to be an even node if its vertex degree is even.

10^(18) bytes. Unfortunately, the term is sometimes also used to mean 2^(60)=1024^6 bytes. However, the latter usage is deprecated, and the term exbibyte is preferred for ...

2^(60)=1024^6 bytes. Although the term exabyte is sometimes used to refer to 1024^6 bytes, such usage is deprecated in favor of the standard SI naming convention of 1 exabyte ...

A binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...