Search Results for ""

A set A in a first-countable space is dense in B if B=A union L, where L is the set of limit points of A. For example, the rational numbers are dense in the reals. In ...

For a nonzero real number r and a triangle DeltaABC, swing line segment BC about the vertex B towards vertex A through an angle rB. Call the line along the rotated segment L. ...

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

A real quantity having a value less than zero (<0) is said to be negative. Negative numbers are denoted with a minus sign preceding the corresponding positive number, i.e., ...

The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...

The complex numbers are the field C of numbers of the form x+iy, where x and y are real numbers and i is the imaginary unit equal to the square root of -1, sqrt(-1). When a ...

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 Gauss-Kuzmin distribution is the distribution of occurrences of a positive integer k in the continued fraction of a random (or "generic") real number. Consider xi_n ...

The Greenfield graph is the name given in this work to the 12-vertex graph illustrated above due to Greenfield (2011). This graph provided the first known example which ...

The smallest possible number of vertices a polyhedral nonhamiltonian graph can have is 11, and there exist 74 such graphs, including the Herschel graph and the Goldner-Harary ...