Search Results for ""

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

For every infinite loop space machine E, there is a natural equivalence of spectra between EX and Segal's spectrum BX.

The hypergeometric orthogonal polynomials defined by P_n^((lambda))(x;phi)=((2lambda)_n)/(n!)e^(inphi)_2F_1(-n,lambda+ix;2lambda;1-e^(-2iphi)), (1) where (x)_n is the ...

(e^(ypsi_0(x))Gamma(x))/(Gamma(x+y))=product_(n=0)^infty(1+y/(n+x))e^(-y/(n+x)), where psi_0(x) is the digamma function and Gamma(x) is the gamma function.

A graph with minimum vertex degree at least 5 is a line graph iff it does not contain any of the above six graphs, known in this work as Metelsky graphs, as an induced ...

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...

An algebraic expression containing more than one term (cf., binomial). The term is also used to refer to a polynomial.

The mutual information between two discrete random variables X and Y is defined to be I(X;Y)=sum_(x in X)sum_(y in Y)P(x,y)log_2((P(x,y))/(P(x)P(y))) (1) bits. Additional ...