Search Results for ""

An inaccessible cardinal is a cardinal number which cannot be expressed in terms of a smaller number of smaller cardinals.

A lattice which is built up of layers of n-dimensional lattices in (n+1)-dimensional space. The vectors specifying how layers are stacked are called glue vectors. The order ...

A lattice embedding is a one-to-one lattice homomorphism.

A topological space is locally connected at the point x if every neighborhood of x contains a connected open neighborhood. It is called locally connected if it is locally ...

A family of subsets of a topological space such that every point has a neighborhood which intersects only a finite number of them.

A space X is locally pathwise-connected if for every neighborhood around every point in X, there is a smaller, pathwise-connected neighborhood.

If a sphere is covered by three closed sets, then one of them must contain a pair of antipodal points.

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, there exists a B_3 in S such that ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...