Search Results for ""

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...

Data resulting from the observation of a population on a number of variables over time. Whenever observations are made more than once, the data is considered to be ...

The lower independence number i(G) of a graph G is the minimum size of a maximal independent vertex set in G. The lower indepedence number is equiavlent to the "independent ...

For a real number x, the mantissa is defined as the positive fractional part x-|_x_|=frac(x), where |_x_| denotes the floor function. For example, for x=3.14159, the mantissa ...

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.

A Maurer rose is a plot of a "walk" along an n- (or 2n-) leafed rose curve in steps of a fixed number d degrees, including all cosets.

A set having the largest number k of distinct residue classes modulo m so that no subset has zero sum.

The series with sum sum_(n=0)^infty1/(F_(2^n))=1/2(7-sqrt(5)), where F_k is a Fibonacci number (Honsberger 1985).

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...