Search Results for ""

The unitary divisor function sigma_k^*(n) is the analog of the divisor function sigma_k(n) for unitary divisors and denotes the sum-of-kth-powers-of-the-unitary divisors ...

The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...

An exponential sum of the form sum_(n=1)^Ne^(2piiP(n)), (1) where P(n) is a real polynomial (Weyl 1914, 1916; Montgomery 2001). Writing e(theta)=e^(2piitheta), (2) a notation ...

A knot property, also called the twist number, defined as the sum of crossings p of a link L, w(L)=sum_(p in C(L))epsilon(p), (1) where epsilon(p) defined to be +/-1 if the ...

An xyz embedding, also called an "xyz drawing," is a three-dimensional embedding such that every axis-parallel line contains either zero or two vertices. Such an embedding is ...

A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...

A mathematical procedure for finding the best-fitting curve to a given set of points by minimizing the sum of the squares of the offsets ("the residuals") of the points from ...

The Newton-Cotes formulas are an extremely useful and straightforward family of numerical integration techniques. To integrate a function f(x) over some interval [a,b], ...

A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...