Search Results for ""

Given a positive sequence {a_n}, sqrt(sum_(j=-infty)^infty|sum_(n=-infty; n!=j)^infty(a_n)/(j-n)|^2)<=pisqrt(sum_(n=-infty)^infty|a_n|^2), (1) where the a_ns are real and ...

Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...

The hinge theorem says that if two triangles DeltaABC and DeltaA^'B^'C^' have congruent sides AB=A^'B^' and AC=A^'C^' and ∠A>∠A^', then BC>B^'C^'.

The branch of algebraic topology which deals with homotopy groups. Homotopy methods can be used to solve systems of polynomials by embedding the polynomials in a family of ...

The 6-polyiamonds illustrated above.

The Diophantine equation x_1^2+x_2^2+...+x_n^2=ax_1x_2...x_n which has no integer solutions for a>n.

A linear transformation A:R^n->R^n is hyperbolic if none of its eigenvalues has modulus 1. This means that R^n can be written as a direct sum of two A-invariant subspaces E^s ...

A two-player game in which player 1 chooses any finite game and player 2 moves first. A pseudoparadox then arises as to whether the hypergame is itself a finite game.

The analytic summation of a hypergeometric series. Powerful general techniques of hypergeometric summation include Gosper's algorithm, Sister Celine's method, Wilf-Zeilberger ...

Given a hypergeometric series sum_(k)c_k, c_k is called a hypergeometric term (Koepf 1998, p. 12).