Search Results for ""

There are several theorems known as the "sandwich theorem." In calculus, the squeeze theorem is also sometimes known as the sandwich theorem. In graph theory, the sandwich ...

One of the set of symbols C_i, C_s, C_1, C_2, C_3, C_4, C_5, C_6, C_7, C_8, C_(2h), C_(3h), C_(4h), C_(5h), C_(6h), C_(2v), C_(3v), C_(4v), C_(5v), C_(6v), C_(inftyv), D_2, ...

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...

A semialgebraic set is a subset of R^n which is a finite Boolean combination of sets of the form {x^_=(x_1,...,x_n):f(x^_)>0} and {x^_:g(x^_)=0}, where f and g are ...

A "split" extension G of groups N and F which contains a subgroup F^_ isomorphic to F with G=F^_N^_ and F^_ intersection N^_={e} (Ito 1987, p. 710). Then the semidirect ...

Let X be a set and S a collection of subsets of X. A subset A subset X is shattered by S if each subset B subset A of A can be expressed as the intersection of A with a ...

There are at least two Siegel's theorems. The first states that an elliptic curve can have only a finite number of points with integer coordinates. The second states that if ...

The silver ratio is the quantity defined by the continued fraction delta_S = [2,2,2,...] (1) = 2+1/(2+1/(2+1/(2+...))) (2) (Wall 1948, p. 24). It follows that ...

Let (x_1,x_2) and (y_1,y_2,y_3) be two sets of complex numbers linearly independent over the rationals. Then at least one of ...

Let L be a nontrivial bounded lattice (or a complemented lattice, etc.). Then L is a tight lattice if every proper tolerance rho of L satisfies (0,a) in rho=>a=0, and dually ...