Search Results for ""

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

A shuffle of a deck of cards obtained by successively exchanging the cards in position 1, 2, ..., n with cards in randomly chosen positions. For 4<=n<=17, the most frequent ...

A module M over a unit ring R is called faithful if for all distinct elements a, b of R, there exists x in M such that ax!=bx. In other words, the multiplications by a and by ...

The hemicube, which might also be called the square hemiprism, is a simple solid that serves as an example of one of the two topological classes of convex hexahedron having 7 ...

Let alpha(x) be a step function with the jump j(x)=(N; x)p^xq^(N-x) (1) at x=0, 1, ..., N, where p>0,q>0, and p+q=1. Then the Krawtchouk polynomial is defined by ...

A morphism is a map between two objects in an abstract category. 1. A general morphism is called a homomorphism, 2. A morphism f:Y->X in a category is a monomorphism if, for ...

In functional analysis, the term "Poincaré-Friedrichs inequality" is a term used to describe inequalities which are qualitatively similar to the classical Poincaré Inequality ...

Let chi be a nonprincipal number theoretic character over Z/Zn. Then for any integer h, |sum_(x=1)^hchi(x)|<=2sqrt(n)lnn.

Let I_A, I_B, and I_C be the vertices of the inner Soddy triangle, and also let E_A, E_B, and E_C be the pairwise contact points of the three tangent circles. Then the lines ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...