Search Results for ""

A polynomial is called unimodal if the sequence of its coefficients is unimodal. If P(x) is log-convex and Q(x) is unimodal, then P(x)Q(x) is unimodal.

The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...

The Möbius function is a number theoretic function defined by mu(n)={0 if n has one or more repeated prime factors; 1 if n=1; (-1)^k if n is a product of k distinct primes, ...

Rényi's polynomial is the polynomial (Rényi 1947, Coppersmith and Davenport 1991) that has 29 terms and whose square has 28, making it a sparse polynomial square.

The augmented tridiminished icosahedron is Johnson solid J_(64), which is formed from augmentation of the triangular face adjecent to all three hexagons of the tridiminished ...

A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.

The connective in A<=>B (also denoted A=B) that returns a true result iff A and B are either both true or both false. The biconditional is also called an equivalence.

If a function phi:(0,infty)->(0,infty) satisfies 1. ln[phi(x)] is convex, 2. phi(x+1)=xphi(x) for all x>0, and 3. phi(1)=1, then phi(x) is the gamma function Gamma(x). ...

An n-dimensional closed disk of radius r is the collection of points of distance <=r from a fixed point in n-dimensional Euclidean space. Krantz (1999, p. 3) uses the symbol ...

The cokernel of a group homomorphism f:A-->B of Abelian groups (modules, or abstract vector spaces) is the quotient group (quotient module or quotient space, respectively) ...