GroupOrbits[group, {p_1, ...}] returns the orbits of the points p_i under the action of the elements of group.GroupOrbits[group, {p_1, ...}, f] finds the orbits under the ...

With origins stretching back several centuries, discrete calculus is now an increasingly central methodology for many problems related to discrete systems and algorithms. ...

Integration functions. Here is the integral ∫_a^bx^2 dx. This gives the multiple integral ∫_0^adx ∫_0^bd y(x^2+y^2).

CalendarChange[{year, month, day}, calendar_1, calendar_2] converts the date {year, month, day} given in calendar calendar_1 into a date given in calendar ...

MinimumBandwidthOrdering[g] attempts to find a vertex ordering that minimizes the bandwidth of the undirected graph g.MinimumBandwidthOrdering[m] attempts to find row and ...

The general first-order nonlinear PDE for an unknown function u(x,y) is given by Here F is a function of uu(x,y), p ( ∂u(x,y) ) / ( ∂x ) , and q ( ∂u(x,y) ) / ( ∂y ) . The ...

Mouseover[expr, over] represents an object that displays as over when the mouse pointer is over it, and as expr otherwise.

Split[list] splits list into sublists consisting of runs of identical elements. Split[list, test] treats pairs of adjacent elements as identical whenever applying the ...

Density and contour plots. This gives a density plot of sin(x) sin(y). Lighter regions show higher values of the function. Some options for DensityPlot.

PageRanks[g] give the page rank of the graph g as a rule list.