Search Results for ""

A 1-form omega=sum_(i=1)^na_i(x)dx_i such that omega=0.

A correspondence between a permutation and a pair of Young tableaux.

A sorting method proposed by Shell (1959) in which records being sorted can take long jumps instead of being restricted to short steps.

An integer matrix whose entries satisfy a_(ij)={0 if j>i+1; -1 if j=i+1; 0 or 1 if j<=i. (1) There are 2^(n-1) special minimal matrices of size n×n.

The (complete) gamma function Gamma(n) is defined to be an extension of the factorial to complex and real number arguments. It is related to the factorial by Gamma(n)=(n-1)!, ...

A pair of elements (p_i,p_j) is called an inversion in a permutation p if i>j and p_i<p_j (Skiena 1990, p. 27; Pemmaraju and Skiena 2003, p. 69). For example, in the ...

A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...

Given a number n, Fermat's factorization methods look for integers x and y such that n=x^2-y^2. Then n=(x-y)(x+y) (1) and n is factored. A modified form of this observation ...

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...