Search Results for ""

Let n be an integer such that n>=lambda_1, where lambda=(lambda_1,lambda_2,...) is a partition of n=|lambda| if lambda_1>=lambda_2>=...>=0, where lambda_i are a sequence of ...

An independent dominating set of a graph G is a set of vertices in G that is both an independent vertex set and a dominating set of G. The minimum size of an independent ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

A relation "<=" is a partial order on a set S if it has: 1. Reflexivity: a<=a for all a in S. 2. Antisymmetry: a<=b and b<=a implies a=b. 3. Transitivity: a<=b and b<=c ...

The index of a permutation p is defined as the sum of all subscripts j such that p_j>p_(j+1), for 1<=j<=n. MacMahon (1960) proved that the number of permutations of size n ...

Erdős and Rényi (1960) showed that for many monotone-increasing properties of random graphs, graphs of a size slightly less than a certain threshold are very unlikely to have ...

Given a set of ordered quantities, a list of the fractions of values at or below each quantity is know as a plotting position. A quantile-quantile plot compares observed ...

A RAT-free ("right angle triangle-free") set is a set of points, no three of which determine a right triangle. Let f(n) be the largest integer such that a RAT-free subset of ...

The rook numbers r_k^((m,n)) of an m×n board are the number of subsets of size k such that no two elements have the same first or second coordinate. In other word, it is the ...

The rth sample raw moment m_r^' of a sample with sample size n is defined as m_r^'=1/nsum_(k=1)^nx_k^r. (1) The sample raw moments are unbiased estimators of the population ...