TOPICS
Search

Search Results for ""


1441 - 1450 of 13134 for binomial theorySearch Results
Let P(L) be the set of all prime ideals of L, and define r(a)={P|a not in P}. Then the Stone space of L is the topological space defined on P(L) by postulating that the sets ...
A straight line embedding, or "straight line drawing," of a graph is a graph embedding in which all edges are drawn as straight line segments (as opposed to curves, etc.).
A tensor category (C, tensor ,I,a,r,l) is strict if the maps a, l, and r are always identities. A related notion is that of a tensor R-category.
An infinite sequence {a_i} of positive integers is called strongly independent if any relation sumepsilon_ia_i, with epsilon_i=0, +/-1, or +/-2 and epsilon_i=0 except ...
A subgroup is a subset H of group elements of a group G that satisfies the four group requirements. It must therefore contain the identity element. "H is a subgroup of G" is ...
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 ...
A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...
A totative is a positive integer less than or equal to a number n which is also relatively prime to n, where 1 is counted as being relatively prime to all numbers. The number ...
A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...
The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...
1 ... 142|143|144|145|146|147|148 ... 1314 Previous Next

...