Search Results for ""

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 ...

A branch cut is a curve (with ends possibly open, closed, or half-open) in the complex plane across which an analytic multivalued function is discontinuous. For convenience, ...

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...

A derangement is a permutation in which none of the objects appear in their "natural" (i.e., ordered) place. For example, the only derangements of {1,2,3} are {2,3,1} and ...

A digit sum s_b(n) is a sum of the base-b digits of n, which can be implemented in the Wolfram Language as DigitSum[n_, b_:10] := Total[IntegerDigits[n, b]]The following ...

The dimension of an object is a topological measure of the size of its covering properties. Roughly speaking, it is the number of coordinates needed to specify a point on the ...

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 ...

A floating-point number is a finite or infinite number that is representable in a floating-point format, i.e., a floating-point representation that is not a NaN. In the IEEE ...

There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...