Search Results for ""

Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...

A connected labeled graph with n graph edges in which all graph vertices can be labeled with distinct integers (mod n) so that the sums of the pairs of numbers at the ends of ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

Given a set S of n nonnegative integers, the number partitioning problem requires the division of S into two subsets such that the sums of number in each subset are as close ...

The statistics h_(r,s,...) defined such that <h_(r,s,...)>=mu_rmu_s..., where mu_r is a central moment. These statistics generalize h-statistics and were originally called ...

The symmetric statistic k_(r,s,...) defined such that <k_(r,s,...)>=kappa_rkappa_s..., (1) where kappa_r is a cumulant. These statistics generalize k-statistic and were ...

A primitive Pythagorean triple is a Pythagorean triple (a,b,c) such that GCD(a,b,c)=1, where GCD is the greatest common divisor. A right triangle whose side lengths give a ...

Let ad=bc, then (1) This can also be expressed by defining (2) (3) Then F_(2m)(a,b,c,d)=a^(2m)f_(2m)(x,y), (4) and identity (1) can then be written ...

The rth sample central moment m_r of a sample with sample size n is defined as m_r=1/nsum_(k=1)^n(x_k-m)^r, (1) where m=m_1^' is the sample mean. The first few sample central ...

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 ...