Search Results for ""

A coincidence is a surprising concurrence of events, perceived as meaningfully related, with no apparent causal connection (Diaconis and Mosteller 1989). Given a large number ...

The constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...

A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...

In general, an extremal graph is the largest graph of order n which does not contain a given graph G as a subgraph (Skiena 1990, p. 143). Turán studied extremal graphs that ...

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 free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...

There are a number of tilings of various shapes by all the 12 order n=6 polyiamonds, summarized in the following table. Several of these (starred in the table below) are also ...

There are a number of formulas variously known as Hurwitz's formula. The first is zeta(1-s,a)=(Gamma(s))/((2pi)^s)[e^(-piis/2)F(a,s)+e^(piis/2)F(-a,s)], where zeta(z,a) is a ...

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...