Search Results for ""

The cumulative count of property P for a sequence S_n={a_1,a_2,...,a_n} is a sequence of counts of the numbers of elements a_i with i<=k that satisfy P for k=1, 2, ..., n. ...

The slicing of a three-dimensional object by a plane (or more general slice).

A vector v on a Hilbert space H is said to be cyclic if there exists some bounded linear operator T on H so that the set of orbits {T^iv}_(i=0)^infty={v,Tv,T^2v,...} is dense ...

The n-cyclohedron, also known as the Bott-Taubes polytope, is defined as the compactification of the configuration space of n points on the circle. The cyclohedron can be ...

Qualitatively, a deep theorem is a theorem whose proof is long, complicated, difficult, or appears to involve branches of mathematics which are not obviously related to the ...

A degree set is a set of integers that make up a degree sequence. Any set of positive integers is the degree set for some graph, because any odd integer from that set can be ...

One of the Eilenberg-Steenrod axioms. Let X be a single point space. H_n(X)=0 unless n=0, in which case H_0(X)=G where G are some groups. The H_0 are called the coefficients ...

The Dirichlet kernel D_n^M is obtained by integrating the number theoretic character e^(i<xi,x>) over the ball |xi|<=M, D_n^M=-1/(2pir)d/(dr)D_(n-2)^M.

int_0^pi(sin[(n+1/2)x])/(2sin(1/2x))dx=1/2pi, where the integral kernel is the Dirichlet kernel.

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...