Search Results for ""

A type of cryptography in which the encoding key is revealed without compromising the encoded message. The two best-known methods are the knapsack problem and RSA encryption.

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.

When can homology classes be realized as the image of fundamental classes of manifolds? The answer is known, and singular bordism groups provide insight into this problem.

If W is a simply connected, compact manifold with a boundary that has two components, M_1 and M_2, such that inclusion of each is a homotopy equivalence, then W is ...

A perfect magic cube is a magic cube for which the rows, columns, pillars, space diagonals, and diagonals of each n×n orthogonal slice sum to the same number (i.e., the magic ...

A classic arithmetical problem probably first posed by Euclid and investigated by various authors in the Middle Ages. The problem is formulated as a dialogue between the two ...

The Bevan point V of a triangle DeltaABC is the circumcenter of the excentral triangle DeltaJ_AJ_BJ_C. It is named in honor of Benjamin Bevan, a relatively unknown Englishman ...

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

Cauchy conditions are initial conditions (time conditions) rather than boundary conditions (space conditions). An initial-value problem is often termed a Cauchy problem. ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...