Search Results for ""

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...

The central difference for a function tabulated at equal intervals f_n is defined by delta(f_n)=delta_n=delta_n^1=f_(n+1/2)-f_(n-1/2). (1) First and higher order central ...

The Cesàro fractal is a fractal also known as the torn square fractal. The base curves and motifs for the two fractals illustrated above are shown below. Starting with a unit ...

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...

A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...

The term "closure" has various meanings in mathematics. The topological closure of a subset A of a topological space X is the smallest closed subset of X containing A. If R ...

After a half rotation of the coin on the left around the central coin (of the same radius), the coin undergoes a complete rotation. In other words, a coin makes two complete ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

The conchoid of de Sluze is the cubic curve first constructed by René de Sluze in 1662. It is given by the implicit equation (x-1)(x^2+y^2)=ax^2, (1) or the polar equation ...