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.

A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

A uniform distribution of points on the circumference of a circle can be obtained by picking a random real number between 0 and 2pi. Picking random points on a circle is ...

There are a number of attractive polyhedron compounds involving four cubes, several of which are illustrated above. The first (left figures), also known as Bakos' compound, ...

The curlicue fractal is a figure obtained by the following procedure. Let s be an irrational number. Begin with a line segment of unit length, which makes an angle phi_0=0 to ...

Let c_k be the number of edge covers of a graph G of size k. Then the edge cover polynomial E_G(x) is defined by E_G(x)=sum_(k=0)^mc_kx^k, (1) where m is the edge count of G ...

The first few values of product_(k=1)^(n)k! (known as a superfactorial) for n=1, 2, ... are given by 1, 2, 12, 288, 34560, 24883200, ... (OEIS A000178). The first few ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...