TOPICS
Search

Search Results for ""


2161 - 2170 of 2557 for Complement Set,Search Results
A non-zero module which is not the direct sum of two of its proper submodules. The negation of indecomposable is, of course, decomposable. An abstract vector space is ...
A differential ideal is an ideal I in the ring of smooth forms on a manifold M. That is, it is closed under addition, scalar multiplication, and wedge product with an ...
A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...
Let i_k(G) be the number of irredundant sets of size k in a graph G, then the irredundance polynomial R_G(x) of G in the variable x is defined as ...
The isogonal mittenpunkt M^' is the isogonal conjugate of the mittenpunkt. It is the homothetic center of the excentral and contact triangles (Gallatly 1913, pp. 17-18). It ...
A right triangle with the two legs (and their corresponding angles) equal. An isosceles right triangle therefore has angles of 45 degrees, 45 degrees, and 90 degrees. For an ...
The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...
The thinnest sequence which contains 1, and whenever it contains x, also contains 2x, 3x+2, and 6x+3: 1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17, ... (OEIS A005658).
A tree with a finite number of branches at each fork and with a finite number of leaves at the end of each branch is called a finitely branching tree. König's lemma states ...
König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...
1 ... 214|215|216|217|218|219|220 ... 256 Previous Next

...