Search Results for ""

Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...

A general quadratic Diophantine equation in two variables x and y is given by ax^2+cy^2=k, (1) where a, c, and k are specified (positive or negative) integers and x and y are ...

There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

The Lucas numbers are the sequence of integers {L_n}_(n=1)^infty defined by the linear recurrence equation L_n=L_(n-1)+L_(n-2) (1) with L_1=1 and L_2=3. The nth Lucas number ...

A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...

The number of ways of partitioning a set of n elements into m nonempty sets (i.e., m set blocks), also called a Stirling set number. For example, the set {1,2,3} can be ...

The Thue-Morse sequence, also called the Morse-Thue sequence or Prouhet-Thue-Morse sequence (Allouche and Cosnard 2000), is one of a number of related sequences of numbers ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...