Search Results for ""

A plane partition is a two-dimensional array of integers n_(i,j) that are nonincreasing both from left to right and top to bottom and that add up to a given number n. In ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...

An algebraic variety is a generalization to n dimensions of algebraic curves. More technically, an algebraic variety is a reduced scheme of finite type over a field K. An ...

The conjecture that the number of alternating sign matrices "bordered" by +1s A_n is explicitly given by the formula A_n=product_(j=0)^(n-1)((3j+1)!)/((n+j)!). This ...

Arithmetic is the branch of mathematics dealing with integers or, more generally, numerical computation. Arithmetical operations include addition, congruence calculation, ...

There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...

A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...

A bicubic graph is a bipartite cubic graph. Tutte (1971) conjectured that all 3-connected bicubic graphs are Hamiltonian (the Tutte conjecture), but a number of bicubic ...

Borsuk conjectured that it is possible to cut an n-dimensional shape of generalized diameter 1 into n+1 pieces each with diameter smaller than the original. It is true for ...

A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...