Search Results for ""

Given a complete graph K_n which is two-colored, the number of forced monochromatic triangles is at least {1/3u(u-1)(u-2) for n=2u; 2/3u(u-1)(4u+1) for n=4u+1; ...

The unique 1-polyomino, consisting of a single square.

Polynomials s_k(x) which form the Sheffer sequence for f(t)=-(2t)/(1-t^2) (1) and have exponential generating function ...

A projective plane in which every line is a translation line is called a Moufang plane.

Possessing more than one mode. A set of values having a single unique mode is said to be unimodal, one with two modes is called bimodal, and one with three modes is called ...

A regression giving conditional expectation values of a given variable in terms of two or more other variables.

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

The Narayana triangle is the number triangle obtained from the Narayana numbers N(n,k), namely 1 ; 1 1 ; 1 3 1 ; 1 6 6 1 ; 1 10 20 10 1 ; 1 15 50 50 15 1 (OEIS A001263).

The unit of information obtained by using the natural logarithm lnx instead of the base-2 logarithm log_2x=lgx when defining entropy and related information theoretic ...

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...