Search Results for ""

A game which is not biased toward any player. A game in which a given player can always win by playing correctly is therefore called an unfair game.

A group action phi:G×X->X is called faithful if there are no group elements g (except the identity element) such that gx=x for all x in X. Equivalently, the map phi induces ...

A representation phi of a group G is faithful if it is one-to-one, i.e., if phi(g)=phi(h) implies g=h for g,h in G. Equivalently, phi is faithful if phi(g)=I_n implies g=e, ...

A statement which is rigorously not true. Regular two-valued logic allows statements to be only true or false, but fuzzy logic treats "truth" as a continuum which can have a ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

A Cantor set with Lebesgue measure greater than 0.

Fatou dust is a Fatou set for a point outside the underlying set. Such a set has zero area and has an infinite number of disconnected components.

In a 1631 edition of Academiae Algebrae, J. Faulhaber published the general formula for the power sum of the first n positive integers, sum_(k=1)^(n)k^p = H_(n,-p) (1) = ...

Any nondegenerate closed space curve may be nondegenerately deformed into either of the two curves illustrated above. Neither of these can be nondegenerately transformed into ...

A partial order defined by (i-1, i), (i+1, i) for odd i.