Search Results for ""

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

Let L be a nontrivial bounded lattice (or a nontrivial complemented lattice, etc.). If every nonconstant lattice homomorphism defined on L is 0,1-separating, then L is a ...

For a normed space (X,||·||), define X^~ to be the set of all equivalent classes of Cauchy sequences obtained by the relation {x_n}∼{y_n} if and only if lim_(n)||x_n-y_n||=0. ...

11 21 3 41 4 7 81 5 11 15 161 6 16 26 31 32 (1) The number triangle illustrated above (OEIS A008949) composed of the partial sums of binomial coefficients, a_(nk) = ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

A linear operator A:D(A)->H from its domain D(A) into a Hilbert space H is closable if it has a closed extension B:D(B)->H where D(A) subset D(B). Closable operators are ...

The set containing no elements, commonly denoted emptyset or emptyset, the former of which is used in this work. These correspond to Wolfram Language and TeX characters ...

A Hasse diagram is a graphical rendering of a partially ordered set displayed via the cover relation of the partially ordered set with an implied upward orientation. A point ...

A clause (i.e., a disjunction of literals) is called a Horn clause if it contains at most one positive literal. Horn clauses are usually written as L_1,...,L_n=>L(=¬L_1 v ... ...

Let X be an infinite set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A,B in V(X) be finitary algebras with finitely many operations, and ...