Search Results for ""

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.

A relation < is a strict order on a set S if it is 1. Irreflexive: a<a does not hold for any a in S. 2. Asymmetric: if a<b, then b<a does not hold. 3. Transitive: a<b and b<c ...

An infinite sequence {a_i} of positive integers is called strongly independent if any relation sumepsilon_ia_i, with epsilon_i=0, +/-1, or +/-2 and epsilon_i=0 except ...

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

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

A relation on a totally ordered set.

An infinite sequence {a_i} of positive integers is called weakly independent if any relation sumepsilon_ia_i with epsilon_i=0 or +/-1 and epsilon_i=0, except finitely often, ...