Search Results for ""

Two sets A_1 and A_2 are disjoint if their intersection A_1 intersection A_2=emptyset, where emptyset is the empty set. n sets A_1, A_2, ..., A_n are disjoint if A_i ...

Let A be a sum of squares of n independent normal standardized variates X_i, and suppose A=B+C where B is a quadratic form in the x_i, distributed as chi-squared with h ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

There is a one-to-one correspondence between the sets of equivalent correspondences (not of value 0) on an irreducible curve of curve genus p, and the rational collineations ...

Variables x_i and x_j are said to be uncorrelated if their covariance is zero: cov(x_i,x_j)=0. Independent statistics are always uncorrelated, but the converse is not ...

An unknown is an independent variable of a function. A function with n independent variables is said to be a function "in," "with," or "of" n unknowns.

A real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...

A generalized eigenvector for an n×n matrix A is a vector v for which (A-lambdaI)^kv=0 for some positive integer k in Z^+. Here, I denotes the n×n identity matrix. The ...

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...