Search Results for ""

For a unit speed curve on a surface, the length of the surface-tangential component of acceleration is the geodesic curvature kappa_g. Curves with kappa_g=0 are called ...

A point-to-line and line-to-point transformation which transforms points A into lines a^' and lines b into points B^' such that a^' passes through B^' iff A^' lies on b.

A perspective collineation in which the center and axis are not incident. The term was first used by Poncelet (Cremona 1960, p. ix).

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

The rank of a graph G is defined as r(G)=n-c, where n is the number of vertices on G and c is the number of connected components (Biggs 1993, p. 25).

Grimm conjectured that if n+1, n+2, ..., n+k are all composite numbers, then there are distinct primes p_(i_j) such that p_(i_j)|(n+j) for 1<=j<=k.

An addition chain for which there is a subset H of members such that each member of the chain uses the largest element of H which is less than the member.

A number n for which a shortest chain exists (which is also a Hansen chain) is called a Hansen number.

A perspective collineation with center O and axis o not incident is called a geometric homology. A geometric homology is said to be harmonic if the points A and A^' on a line ...