Search Results for ""

A set of m distinct positive integers S={a_1,...,a_m} satisfies the Diophantus property D(n) of order n (a positive integer) if, for all i,j=1, ..., m with i!=j, ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

Macdonald's plane partition conjecture proposes a formula for the number of cyclically symmetric plane partitions (CSPPs) of a given integer whose Ferrers diagrams fit inside ...

Let f(z) be an entire function such that f(n) is an integer for each positive integer n. Then Pólya (1915) showed that if lim sup_(r->infty)(lnM_r)/r<ln2=0.693... (1) (OEIS ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

The Royle graphs are the two unique simple graphs on eight nodes whose sigma polynomials have nonreal roots (Read and Wilson 1998, p. 265). The sigma polynomials of these ...

A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points lying on a ...

A q-analog, also called a q-extension or q-generalization, is a mathematical expression parameterized by a quantity q that generalizes a known expression and reduces to the ...

Augmentation is the dual operation of truncation which replaces the faces of a polyhedron with pyramids of height h (where h may be positive, zero, or negative) having the ...