> User's Guide > Combinatorics
Strict Single-Element Unions

This process is used to compute all possible strict single-element unions of a collection of sets.

Let C denote a collection of sets, and let Ci denote the i-th set in C. Strict single-element unions are created by sampling a single element from each Ci. Strict single-element unions are themselves sets, and they contain only one element from each Ci. Note the difference between strict single-element unions and single-element unions.

For example, the strict single-element unions of the collection of sets:

{A, B, C},
{C, D},
{E},

are:

{A, D, E},
{B, D, E},
{C, E}.

Note that the sets {A, C, E}, {C, D, E}, and {B, C, E} are not present because they contain multiple elements from a single set.

Here is the set of keywords this process understands, along with a description of their possible corresponding values. See the command line documentation for more information about keyword-value pairs.


Required Keywords Possible Values
Process Strict Single-Element Unions
Set File The name of the file containing a collection of sets. See Set Files for further information.
Output File Name The desired name of the file where the strict single-element unions will be stored. See Set Files for further information.

Examples

Click here for an example.