Search Results for ""

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...

"The" tetrahedral graph is the Platonic graph that is the unique polyhedral graph on four nodes which is also the complete graph K_4 and therefore also the wheel graph W_4. ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

Let a^p+b^p=c^p be a solution to Fermat's last theorem. Then the corresponding Frey curve is y^2=x(x-a^p)(x+b^p). (1) Ribet (1990a) showed that such curves cannot be modular, ...

Let A be a matrix and x and b vectors. Then the system Ax=b, x>=0 has no solution iff the system A^(T)y>=0, b^(T)y<0 has a solution, where y is a vector (Fang and Puthenpura ...

The correspondence which relates the Hanoi graph to the isomorphic graph of the odd binomial coefficients in Pascal's triangle, where the adjacencies are determined by ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

The series which arises in the binomial theorem for negative integer -n, (x+a)^(-n) = sum_(k=0)^(infty)(-n; k)x^ka^(-n-k) (1) = sum_(k=0)^(infty)(-1)^k(n+k-1; k)x^ka^(-n-k) ...

Let the residue from Pépin's theorem be R_n=3^((F_n-1)/2) (mod F_n), where F_n is a Fermat number. Selfridge and Hurwitz use R_n (mod 2^(35)-1,2^(36),2^(36)-1). A ...

The lines joining the vertices of a tetrahedron to the centroids of the opposite faces are called medians. Commandino's theorem states that the four medians of a tetrahedron ...