Search Results for ""

Every smooth nonzero vector field on the 3-sphere has at least one closed orbit. The conjecture was proposed in 1950 and proved true for Hopf maps. The conjecture was ...

A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...

A semicubical parabola is a curve of the form y=+/-ax^(3/2) (1) (i.e., it is half a cubic, and hence has power 3/2). It has parametric equations x = t^2 (2) y = at^3, (3) and ...

The field of semidefinite programming (SDP) or semidefinite optimization (SDO) deals with optimization problems over symmetric positive semidefinite matrix variables with ...

Serre's problem, also called Serre's conjecture, asserts that the implication "free module ==> projective module" can be reversed for every module over the polynomial ring ...

A problem also known as the points problem or unfinished game. Consider a tournament involving k players playing the same game repetitively. Each game has a single winner, ...

The randomization of a deck of cards by repeated interleaving. More generally, a shuffle is a rearrangement of the elements in an ordered list. Shuffling by exactly ...

The Sierpiński carpet is the fractal illustrated above which may be constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be ...

A process of successively crossing out members of a list according to a set of rules such that only some remain. The best known sieve is the sieve of Eratosthenes for ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a signaling NaN or sNaN is a NaN which is signaling in the sense of being most commonly returned in ...