Search Results for ""

A Pascal's triangle written in a square grid and padded with zeros, as written by Jakob Bernoulli (Smith 1984). The figurate number triangle therefore has entries a_(ij)=(i; ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

The number d(n) of monotone Boolean functions of n variables (equivalent to one more than the number of antichains on the n-set {1,2,...,n}) is called the nth Dedkind number. ...

An imperfect graph G is a graph that is not perfect. Therefore, graphs G with omega(G)<chi(G) (1) where omega(G) is the clique number and chi(G) is the chromatic number are ...

An isolated point of a graph is a node of degree 0 (Hartsfield and Ringel 1990, p. 8; Harary 1994, p. 15; D'Angelo and West 2000, p. 212; West 2000, p. 22). The number of ...

Hyperreal numbers are an extension of the real numbers to include certain classes of infinite and infinitesimal numbers. A hyperreal number x is said to be finite iff |x|<n ...

The exponent of the largest power of 2 which divides a given number 2n. The values of the ruler function for n=1, 2, ..., are 1, 2, 1, 3, 1, 2, 1, 4, 1, 2, ... (OEIS A001511).

A number is said to be squarefree (or sometimes quadratfrei; Shanks 1993) if its prime decomposition contains no repeated factors. All primes are therefore trivially ...

Let A and B be any sets, and let |X| be the cardinal number of a set X. Then cardinal exponentiation is defined by |A|^(|B|)=|set of all functions from B into A| (Ciesielski ...

An ordinal number alpha>0 is called a limit ordinal iff it has no immediate predecessor, i.e., if there is no ordinal number beta such that beta+1=alpha (Ciesielski 1997, p. ...