Search Results for ""

The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...

A plane-filling arrangement of plane figures or its generalization to higher dimensions. Formally, a tiling is a collection of disjoint open sets, the closures of which cover ...

A binary tree is a tree-like structure that is rooted and in which each vertex has at most two children and each child of a vertex is designated as its left or right child ...

A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...

A labeled graph G=(V,E) is a finite series of graph vertices V with a set of graph edges E of 2-subsets of V. Given a graph vertex set V_n={1,2,...,n}, the number of ...

An Abelian differential is an analytic or meromorphic differential on a compact or closed Riemann surface.

An Abelian integral, are also called a hyperelliptic integral, is an integral of the form int_0^x(dt)/(sqrt(R(t))), where R(t) is a polynomial of degree >4.