Partition[list, n] partitions list into nonoverlapping sublists of length n. Partition[list, n, d] generates sublists with offset d. Partition[list, {n_1, n_2, ...}] ...

Partitioning elements in a list. This partitions in blocks of 3. This partitions in blocks of 3 with offset 1.

IntegerPartitions[n] gives a list of all possible ways to partition the integer n into smaller integers. IntegerPartitions[n, k] gives partitions into at most k integers. ...

PartitionsQ[n] gives the number q (n) of partitions of the integer n into distinct parts.

PartitionsP[n] gives the number p (n) of unrestricted partitions of the integer n.

FindGraphPartition[g] gives a partition of vertices of the graph g. FindGraphPartition[g, k] gives a partition of vertices into k approximately equal-size parts. ...

CommunityModularity[g, partition] gives the community modularity of a partition. CommunityModularity[g, assignment] gives the community modularity of an assignment.

CommunityStructurePartition[g] gives the partition of a graph g into communities.

Cluster analysis is an unsupervised learning technique used for classification of data. Data elements are partitioned into groups called clusters that represent proximate ...

ImagePartition[image, s] partitions an image into an array of s*s-pixel subimages. ImagePartition[image, {w, h}] partitions an image into an array of subimages of pixel width ...