Search Results for ""

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.

For a countable set of n disjoint events E_1, E_2, ..., E_n P( union _(i=1)^nE_i)=sum_(i=1)^nP(E_i).

The largest cube dividing a positive integer n. For n=1, 2, ..., the first few are 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, ... (OEIS A008834).

A polyhedral graph having 10 vertices. There are 32300 nonisomorphic nonahedral graphs, as first enumerated by Duijvestijn and Federico (1981).

For every partition of all the points on a line into two nonempty sets such that no point of either lies between two points of the other, there is a point of one set which ...

Let A be any algebra over a field F, and define a derivation of A as a linear operator D on A satisfying (xy)D=(xD)y+x(yD) for all x,y in A. Then the set D(A) of all ...

A Padé approximant perturbed with a Chebyshev polynomial of the first kind to reduce the leading coefficient in the error.

A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.

For an atomic integral domain R (i.e., one in which every nonzero nonunit can be factored as a product of irreducible elements) with I(R) the set of irreducible elements, the ...

A catastrophe which can occur for three control factors and two behavior axes. The elliptical umbilic is catastrophe of codimension 3 that has the equation ...