BinLists[{x_1, x_2, ...}] gives lists of the elements x_i whose values lie in successive integer bins.BinLists[{x_1, x_2, ...}, dx] gives lists of the elements x_i whose ...

BooleanConvert[expr] converts the Boolean expression expr to disjunctive normal form.BooleanConvert[expr, form] converts the Boolean expression expr to the specified ...

BooleanMinimize[expr] finds a minimal-length disjunctive normal form representation of expr.BooleanMinimize[expr, form] finds a minimal-length representation for expr in the ...

DiagonalMatrix[list] gives a matrix with the elements of list on the leading diagonal, and 0 elsewhere. DiagonalMatrix[list, k] gives a matrix with the elements of list on ...

DiscreteConvolve[f, g, n, m] gives the convolution with respect to n of the expressions f and g. DiscreteConvolve[f, g, {n_1, n_2, ...}, {m_1, m_2, ...}] gives the ...

FourierSequenceTransform[expr, n, \[Omega]] gives the Fourier sequence transform of expr.FourierSequenceTransform[expr, {n_1, n_2, ...}, {\[Omega]_1, \[Omega]_2, ...}] gives ...

GeneratingFunction[expr, n, x] gives the generating function in x for the sequence whose n\[Null]^th series coefficient is given by the expression ...

CirculantGraph[n, j] gives the circulant graph with n vertices and jump j C_n (j).CirculantGraph[n, {j_1, j_2, ...}] gives the circulant graph with n vertices and jumps j_1, ...

DeBruijnGraph[m, n] gives the n-dimensional De Bruijn graph with m symbols.DeBruijnGraph[m, n, type] gives the De Bruijn graph with connectivity given by type.

HararyGraph[k, n] generates the minimal k-connected graph on n vertices H k, n.