Search Results for ""

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

A collection of equations satisfies the Hasse principle if, whenever one of the equations has solutions in R and all the Q_p, then the equations have solutions in the ...

Let {y^k} be a set of orthonormal vectors with k=1, 2, ..., K, such that the inner product (y^k,y^k)=1. Then set x=sum_(k=1)^Ku_ky^k (1) so that for any square matrix A for ...

The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...

Suppose W is the set of all complex-valued functions f on the interval [0,2pi] of the form f(t)=sum_(k=-infty)^inftyalpha_ke^(ikt) (1) for t in [0,2pi], where the alpha_k in ...

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

A transition function describes the difference in the way an object is described in two separate, overlapping coordinate charts, where the description of the same set may ...

Define T as the set of all points t with probabilities P(x) such that a>t=>P(a<=x<=a+da)<P_0 or a<t=>P(a<=x<=a+da)<P_0, where P_0 is a point probability (often, the ...

Let X be an alphabet (i.e., a finite and nonempty set), and call its member letters. A word on X is a finite sequence of letters a_1...a_n, where a_1,...,a_n in X. Denote the ...

A set function mu possesses countable additivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...