Search Results for ""

A prime number is said to be weakly prime if changing a single digit to every other possible digit produces a composite number when performed on each digit. The first few ...

The prime link 05-0201, illustrated above, with braid word sigma_1^2sigma_2^2sigma_1^(-1)sigma_2^(-2) or sigma_1sigma_2^(-1)sigma_1sigma_2^(-2) and Jones polynomial ...

Spinor fields describing particles of zero rest mass satisfy the so-called zero rest mass equations. Examples of zero rest mass particles include the neutrino (a fermion) and ...

Let a random n×n (0,1)-matrix have entries which are 1 (with probability p) or 0 (with probability q=1-p) and numbers are assigned to the edges of a grid. A b-cluster is an ...

Let v be a n-vector whose entries are each 1 (with probability p) or 0 (with probability q=1-p). An s-run is an isolated group of s consecutive 1s. Ignoring the boundaries, ...

The n-hypercube graph, also called the n-cube graph and commonly denoted Q_n or 2^n, is the graph whose vertices are the 2^k symbols epsilon_1, ..., epsilon_n where ...

Every module over a ring R contains a so-called "zero element" which fulfils the properties suggested by its name with respect to addition, 0+0=0, and with respect to ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

A graph G having chromatic number gamma(G)=k is called a k-chromatic graph (Harary 1994, p. 127). In contrast, a graph having gamma(G)<=k is said to be a k-colorable graph. A ...

A block matrix is a matrix that is defined using smaller matrices, called blocks. For example, [A B; C D], (1) where A, B, C, and D are themselves matrices, is a block ...