Search Results for ""

Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...

The Jacobian conjecture in the plane, first stated by Keller (1939), states that given a ring map F of C[x,y] (the polynomial ring in two variables over the complex numbers ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) (1) is the multinomial coefficient ...

As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (g(3)=9), that every "sufficiently large" ...

The Hanoi graph H_n corresponding to the allowed moves in the tower of Hanoi problem. The above figure shows the Hanoi graphs for small n. The Hanoi graph H_n can be ...

Many algorithms have been devised for determining the prime factors of a given number (a process called prime factorization). They vary quite a bit in sophistication and ...

Consider the average length of a line segment determined by two points picked at random in the interior of an arbitrary triangle Delta(a,b,c) with side lengths a, b, and c. ...

Minesweeper is single-player logic-based computer game played on rectangular board whose object is to locate a predetermined number of randomly-placed "mines" in the shortest ...

A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines ...