Search Results for ""

An graph edge of a graph is separating if a path from a point A to a point B must pass over it. Separating graph edges can therefore be viewed as either bridges or dead ends.

A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...

The base-60 notational system for representing real numbers. A base-60 number system was used by the Babylonians and is preserved in the modern measurement of time (hours, ...

A conjecture that, as proved by Parshin (1968), implies the Mordell conjecture.

A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...

A shortest path between two vertices of a graph is a graph path of shortest possible length between them. Such paths are also known as graph geodesics, and the matrix giving ...

A method for constructing magic squares of odd order, also called de la Loubere's method.

The integral int_0^thetae^(-xsecphi)dphi.

A family composed of countably many discrete families.

The signed deviation is defined by Deltau_i=(u_i-u^_), so the average deviation is Deltau^_=u_i-u^_^_=u_i^_-u^_=0.