Search Results for ""

A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

A reflexive graph is a pseudograph such that each vertex has an associated graph loop.

A proof or demonstration is said to be rigorous if the validity of each step and the connections between the steps is explicitly made clear in such a way that the result ...

A conjecture that, as proved by Parshin (1968), implies the Mordell conjecture.

The Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...

A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

The number of real roots of an algebraic equation with real coefficients whose real roots are simple over an interval, the endpoints of which are not roots, is equal to the ...

The dissection of the four pieces shown at left into the capital letter "T" shown at right.