TOPICS
Search

Search Results for ""


711 - 720 of 13134 for Naive set theorySearch Results
The second Zagreb index for a graph with vertex count n and vertex degrees d_i for i=1, ..., n is defined by Z_2=sum_((i,j) in E(G))d_id_j, where E(G) is the edge set of G.
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 ...
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 ...
If K is a simplicial complex, let V be the vertex set of K. Furthermore, let K be the collection of all subsets {a_0,...,a_n} of V such that the vertices a_0, ..., a_n span a ...
Every totally ordered set (A,<=) is associated with a so-called order type. Two sets A and B are said to have the same order type iff they are order isomorphic (Ciesielski ...
A theorem in game theory which guarantees the existence of a set of mixed strategies for finite, noncooperative games of two or more players in which no player can improve ...
The set of nilpotent elements in a commutative ring is an ideal, and it is called the nilradical. Another equivalent description is that it is the intersection of the prime ...
Let h>=2 and let A_1, A_2, ..., A_h be sets of integers. The sumset A_1+A_2+...+A_h is the set of all integers of the form a_1+a_2+...+a_h, where a_i is a member of A_i for ...
The constants lambda_(m,n)=inf_(r in R_(m,n))sup_(x>=0)|e^(-x)-r(x)|, where r(x)=(p(x))/(q(x)), p and q are mth and nth order polynomials, and R_(m,n) is the set of all ...
An equivalence class is defined as a subset of the form {x in X:xRa}, where a is an element of X and the notation "xRy" is used to mean that there is an equivalence relation ...
1 ... 69|70|71|72|73|74|75 ... 1314 Previous Next

...