Search Results for ""

A relation between permutations p and q that exists if there is a sequence of transpositions such that each transposition increases the number of inversions (Stanton and ...

The Kampyle of Eudoxus is a curve studied by Eudoxus in relation to the classical problem of cube duplication. It is given by the polar equation r=asec^2theta, (1) and the ...

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

An integer sequence given by the recurrence relation a(n)=a(a(n-2))+a(n-a(n-2)) with a(1)=a(2)=1. The first few values are 1, 1, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 10, 11, ...

If a_1, a_2, a_3, ... is an artistic sequence, then 1/a_1, 1/a_2, 1/a_3, ... is a melodic sequence. The recurrence relation obeyed by melodic series is ...

The set of all points x that can be put into one-to-one correspondence with sets of essentially distinct values of five homogeneous coordinates x_0:x_1:x_2:x_3:x_4, not all ...

An adjoint curve which bears a special relation to the base curve.

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

A recurrence relation between the function Q arising in quota systems, Q(n,r)=Q(n-1,r-1)+Q(n-1,r).

The recurrence relation E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2 which gives the solution to Euler's polygon division problem.