Search Results for ""
681 - 690 of 3024 for Well Ordered SetSearch Results
Wang's conjecture states that if a set of tiles can tile the plane, then they can always be arranged to do so periodically (Wang 1961). The conjecture was refuted when Berger ...
A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...
The centralizer of an element z of a group G is the set of elements of G which commute with z, C_G(z)={x in G,xz=zx}. Likewise, the centralizer of a subgroup H of a group G ...
The digraph union of two digraphs is the digraph whose vertex set (respectively, edge set) is the union of their vertex sets (respectively, edge sets). Given a positive ...
The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...
A decomposition of a module into a direct sum of submodules. The index set for the collection of submodules is then called the grading set. Graded modules arise naturally in ...
Let S be a set of n+1 symbols, then a Howell design H(s,2n) on symbol set S is an s×s array H such that 1. Every cell of H is either empty or contains an unordered pair of ...
Let E be a set of expressions representing real, single-valued partially defined functions of one real variable. Let E^* be the set of functions represented by expressions in ...
A link invariant is a function from the set of all links to any other set such that the function does not change as the link is changed (up to isotopy). In other words, a ...
A well-formed formula B is said to be true for the interpretation M (written |=_MB) iff every sequence in Sigma (the set of all denumerable sequences of elements of the ...
...
View search results from all Wolfram sites (37299 matches)

