Search Results for ""
3311 - 3320 of 13134 for Order TheorySearch Results
Subtraction is the operation of taking the difference d=x-y of two numbers x and y. Here, x is called the minuend, y is called the subtrahend, and the symbol between the x ...
A tree G^' whose graph vertices and graph edges form subsets of the graph vertices and graph edges of a given tree G.
For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.
If G^' is a subgraph of G, then G is said to be a supergraph of G^'.
A set containing all elements of a smaller set. If B is a subset of A, then A is a superset of B, written A superset= B. If A is a proper superset of B, this is written A ...
Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...
An ordinary knot in three dimensions suspended in four dimensions to create a knotted 2-sphere. Suspended knots are not smooth at the poles.
A symmetric design is a block design (v, k, lambda, r, b) with the same number of blocks as points, so b=v (or, equivalently, r=k). An example of a symmetric block design is ...
A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...
A conjecture which relates the minimal elliptic discriminant of an elliptic curve to the j-conductor. If true, it would imply Fermat's last theorem for sufficiently large ...
...
View search results from all Wolfram sites (44093 matches)

