SortBy[list, f] sorts the elements of list in the order defined by applying f to each of them.

Linear programming problems are optimization problems where the objective function and constraints are all linear. Mathematica has a collection of algorithms for solving ...

The leading term of a polynomial can be chosen in many different ways. For multivariate polynomials, sorting by the total degree of the monomials is often useful. Different ...

RecurrenceTable[eqns, expr, {n, n_max}] generates a list of values of expr for successive n based on solving the recurrence equations eqns.RecurrenceTable[eqns, expr, nspec] ...

GraphData[name] gives a graph with the specified name.GraphData[name, " property"] gives the value for the specified property for a named graph.GraphData["class"] gives a ...

InsertIntoTableau[e, t] inserts integer e into Young tableau t using the bumping algorithm. InsertIntoTableau[e, t, All] inserts e into Young tableau t and returns the new ...

Different measures of distance or similarity are convenient for different types of analysis. Mathematica provides built-in functions for many standard distance measures, as ...

DistanceFunction is an option for functions such as Nearest that specifies the distance value to assume between any two specified points.

NearestFunction[data] represents a function whose values give the elements closest to an element that is supplied.

Mathematica has been used to make many important discoveries in discrete mathematics over the past two decades. Its integration of highly efficient and often original ...