Search Results for ""

Simply stated, floating-point arithmetic is arithmetic performed on floating-point representations by any number of automated devices. Traditionally, this definition is ...

The Fourier transform is a generalization of the complex Fourier series in the limit as L->infty. Replace the discrete A_n with the continuous F(k)dk while letting n/L->k. ...

A Haar graph H(n) is a bipartite regular indexed by a positive integer and obtained by a simple binary encoding of cyclically adjacent vertices. Haar graphs may be connected ...

As proposed by Hosoya (1971), the Hosoya index (also called Z-index) of a graph is defined by Z = sum_(k=0)^(n)|a_k| (1) = sum_(k=0)^(n)b_k, (2) where n is the number of ...

An integral of the form intf(z)dz, (1) i.e., without upper and lower limits, also called an antiderivative. The first fundamental theorem of calculus allows definite ...

A matrix is a concise and useful way of uniquely representing and working with linear transformations. In particular, every linear transformation can be represented by a ...

Roughly speaking, the metric tensor g_(ij) is a function which tells how to compute the distance between any two points in a given space. Its components can be viewed as ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

A partial differential equation which appears in differential geometry and relativistic field theory. Its name is a wordplay on its similar form to the Klein-Gordon equation. ...

The Spencer-Brown form is a simple mathematical concept that formalizes what a mathematical object is formally identical to what it is not (Spencer-Brown 1997, pp. ix and ...