Search Results for ""

A function is said to be piecewise constant if it is locally constant in connected regions separated by a possibly infinite number of lower-dimensional boundaries. The ...

Let a simple graph G have n vertices, chromatic polynomial P(x), and chromatic number chi. Then P(G) can be written as P(G)=sum_(i=0)^ha_i·(x)_(p-i), where h=n-chi and (x)_k ...

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...

A number of attractive tetrahedron 5-compounds can be constructed. The first (left figures) is one of the icosahedron stellations in which the 5×4 vertices of the tetrahedra ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

The order of a finite field is the number of elements it contains.

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

The determination of the number of alternating permutations having elements {1,2,...,n}.

A shuffling algorithm used in a class of random number generators.