Search Results for ""

The ring R[x] of polynomials in a variable x.

Predictability at a time tau in the future is defined by (R(x(t),x(t+tau)))/(H(x(t))), and linear predictability by (L(x(t),x(t+tau)))/(H(x(t))), where R and L are the ...

A formula whose truth table contains only false in any interpretation is called unsatisfiable.

X is a p^'-group if p does not divide the group order of X.

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

The kite graph is the 5-vertex graph illustrated above (Brandstädt et al. 1987, p. 18). It is implemented in the Wolfram Language as GraphData["KiteGraph"]. Unfortunately, ...

A branch of mathematics which brings together ideas from algebraic geometry, linear algebra, and number theory. In general, there are two main types of K-theory: topological ...

Roundoff error is the difference between an approximation of a number used in computation and its exact (correct) value. In certain types of computation, roundoff error can ...

The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...