This document describes how to compile and run MathLink programs written in the C language on Linux systems. ("MathLink and External Program Communication" describes how to ...

TreePlot lays out the vertices of a graph in a tree of successive layers, or a collection of trees. If the graph g is not a tree, TreePlot lays out its vertices on the basis ...

The utility functions FindMinimumPlot and FindRootPlot show search data for FindMinimum and FindRoot for one- and two-dimensional functions. They work with essentially the ...

FunctionalGraph[f, v] takes a set v and a function f from v to v and constructs a directed graph with vertex set v and edges (x, f[x]) for each x in v. FunctionalGraph[{f_1, ...

RankedEmbedding[l] takes a set partition l of vertices {1, 2, ..., n} and returns an embedding of the vertices in the plane such that the vertices in each block occur on a ...

FiniteGroupCount[n] gives the number of finite groups of order n.

TimeConstrained[expr, t] evaluates expr, stopping after t seconds. TimeConstrained[expr, t, failexpr] returns failexpr if the time constraint is not met.

In an expression like f[x], the 'function name' f is itself an expression, and you can treat it as you would any other expression. You can replace names of functions using ...

One significant advantage Mathematica provides is that it can symbolically compute derivatives. This means that when you specify Method->"Newton" and the function is ...

The Mathematica compiler generates a CompiledFunction expression that contains a sequence of simple instructions for evaluating a Mathematica computation. The compiled ...