Search Results for ""

The graph complement of a graph hole. Graph antiholes are called even if they have an even number of vertices and odd if they have an odd number of vertices (Chvátal). No odd ...

The class m, curve order n, number of ordinary double points delta, number of cusps kappa, number of inflection points (inflection points) iota, number of bitangents tau, and ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

The fast Fourier transform (FFT) is a discrete Fourier transform algorithm which reduces the number of computations needed for N points from 2N^2 to 2NlgN, where lg is the ...

The order of a finite field is the number of elements it contains.

The determination of the number of alternating permutations having elements {1,2,...,n}.

A shuffling algorithm used in a class of random number generators.

The symbol "-" which is used to denote a negative number or subtraction.

The number of poles of an automorphic function in the closure of its fundamental region.

A circle-preserving transformation composed of an odd number of inversions.