Search Results for ""

An arithmetic series is the sum of a sequence {a_k}, k=1, 2, ..., in which each term is computed from the previous one by adding (or subtracting) a constant d. Therefore, for ...

Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...

An important and fundamental axiom in set theory sometimes called Zermelo's axiom of choice. It was formulated by Zermelo in 1904 and states that, given any set of mutually ...

Suppose A and B are candidates for office and there are 2n voters, n voting for A and n for B. In how many ways can the ballots be counted so that B is never ahead of A? The ...

A band over a fixed topological space X is represented by a cover X= union U_alpha, U_alpha subset= X, and for each alpha, a sheaf of groups K_alpha on U_alpha along with ...

A "beam detector" for a given curve C is defined as a curve (or set of curves) through which every line tangent to or intersecting C passes. The shortest 1-arc beam detector, ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...