Search Results for ""

The order n of an algebraic surface is the order of the polynomial defining a surface, which can be geometrically interpreted as the maximum number of points in which a line ...

If replacing each number by its square or cube in a magic square produces another magic square, the square is said to be a trimagic square. Trimagic squares are also called ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

Let (A,<=) be a partially ordered set. Then an element m in A is said to be maximal if, for all a in A, m!<=a. Alternatively, an element m in A is maximal such that if m<=a ...

A set R of linear extensions of a partially ordered set P=(X,<=) is a realizer of P (and is said to realize P) provided that for all x,y in X, x<=y iff x is below y in every ...

A relation on a totally ordered set.

A set-theoretic term having a number of different meanings. Fraenkel (1953, p. 37) used the term as a synonym for "finite set." However, according to Russell's definition ...

A partially ordered set (or ordered set or poset for short) (L,<=) is called a complete lattice if every subset M of L has a least upper bound (supremum, supM) and a greatest ...

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 ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.