SamenessRelation[l] constructs a binary relation from a list l of permutations, which is an equivalence relation if l is a permutation group.

SelectionSort[l, f] sorts list l using ordering function f.

SelfComplementaryQ[g] yields True if graph g is self-complementary, meaning it is isomorphic to its complement.

SelfLoopsQ[g] yields True if graph g has self-loops.

SetEdgeLabels[g, l] assigns the labels in l to edges of g.

SetEdgeWeights[g] assigns random real weights in the range [0, 1] to edges in g. SetEdgeWeights[g, e] assigns edge weights to the edges in the edge list e. SetEdgeWeights[g, ...

SetGraphOptions[g, opts] returns g with the options opts set. SetGraphOptions[g, {v_1, v_2, ..., v_opts}, g_opts] returns the graph with the options v_opts set for vertices ...

SetPartitionListViaRGF[n] lists all set partitions of the first n natural numbers, by first listing all restricted growth functions (RGFs) on these and then mapping the RGFs ...

SetPartitionQ[sp, s] determines if sp is a set partition of set s. SetPartitionQ[sp] tests if sp is a set of disjoint sets.

SetPartitions[set] returns the list of set partitions of set. SetPartitions[n] returns the list of set partitions of {1, 2, ..., n}.