Search Results for ""

A method for fitting a curve (not necessarily a straight line) through a set of points using some goodness-of-fit criterion. The most common type of regression is linear ...

A scatter diagram, also called a scatterplot or a scatter plot, is a visualization of the relationship between two variables measured on the same set of individuals. Scatter ...

The lower matching number of a graph is the minimum size of a maximal independent edge set. The (upper) matching number may be similarly defined as the largest size of an ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

Consider a first-order ODE in the slightly different form p(x,y)dx+q(x,y)dy=0. (1) Such an equation is said to be exact if (partialp)/(partialy)=(partialq)/(partialx). (2) ...

Suppose the harmonic series converges to h: sum_(k=1)^infty1/k=h. Then rearranging the terms in the sum gives h-1=h, which is a contradiction.

Let x^__1 and s_1^2 be the observed mean and variance of a sample of N_1 drawn from a normal universe with unknown mean mu_((1)) and let x^__2 and s_2^2 be the observed mean ...

For homogeneous polynomials P and Q of degree m and n, then sqrt((m!n!)/((m+n)!))[P]_2[Q]_2<=[P·Q]_2<=[P]_2[Q]_2, where [P·Q]_2 is the Bombieri norm.

An even Walsh function with sequency k defined by Cal(n,k)=W(n,2k+1).