Search Results for ""

Given a finitely generated Z-graded module M over a graded ring R (finitely generated over R_0, which is an Artinian local ring), the Hilbert function of M is the map ...

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

The inverse sine is the multivalued function sin^(-1)z (Zwillinger 1995, p. 465), also denoted arcsinz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. 307; ...

Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...

The Laguerre polynomials are solutions L_n(x) to the Laguerre differential equation with nu=0. They are illustrated above for x in [0,1] and n=1, 2, ..., 5, and implemented ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

Q(n), also denoted q(n) (Abramowitz and Stegun 1972, p. 825), gives the number of ways of writing the integer n as a sum of positive integers without regard to order with the ...

Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...

If A moves along a known curve, then P describes a pursuit curve if P is always directed toward A and A and P move with uniform velocities. Pursuit curves were considered in ...

How can n points be distributed on a unit sphere such that they maximize the minimum distance between any pair of points? This maximum distance is called the covering radius, ...