Search Results for ""

The ordinal number of a value in a list arranged in a specified order (usually decreasing).

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

Let y_n be a complex number for 1<=n<=N and let y_n=0 if n<1 or n>N. Then (Montgomery 2001).

For any ordinal number alpha, the successor of alpha is alpha union {alpha} (Ciesielski 1997, p. 46). The successor of an ordinal number alpha is therefore the next ordinal, ...

The pentagonal hexecontahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal hexecontahedron. It is implemented in the Wolfram Language as ...

The pentagonal icositetrahedral graph is the Archimedean dual graph which is the skeleton of the pentagonal icositetrahedron. It is implemented in the Wolfram Language as ...

A group in which any decreasing chain of distinct subgroups terminates after a finite number.

If the average number of envelopes per pigeonhole is a, then some pigeonhole will have at least a envelopes. Similarly, there must be a pigeonhole with at most a envelopes.

The number of inward directed graph edges from a given graph vertex in a directed graph.

The word "spectrum" confusingly has a number of unrelated meanings in various branches of mathematics.