Search Results for ""

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...

Any discrete finite wavelet transform can be represented as a matrix, and such a wavelet matrix can be computed in O(n) steps, compared to O(nlgn) for the Fourier matrix, ...

A sequence of numbers V={nu_n} is said to be weakly complete if every positive integer n beyond a certain point N is the sum of some subsequence of V (Honsberger 1985). ...

The operator e^(nut^2/2) which satisfies e^(nut^2/2)p(x)=1/(sqrt(2pinu))int_(-infty)^inftye^(-u^2/(2nu))p(x+u)du for nu>0.

A function, continuous in a finite closed interval, can be approximated with a preassigned accuracy by polynomials. A function of a real variable which is continuous and has ...

A finite sequence of n letters from some alphabet is said to be an n-ary word.

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...

Theory of Computation

A p-system of a set S is a sequence of subsets A_1, A_2, ..., A_p of S, among which some may be empty or coinciding with each other.

The conjecture that the number of alternating sign matrices "bordered" by +1s A_n is explicitly given by the formula A_n=product_(j=0)^(n-1)((3j+1)!)/((n+j)!). This ...