Search Results for ""

A simple pole of an analytic function f is a pole of order one. That is, (z-z_0)f(z) is an analytic function at the pole z=z_0. Alternatively, its principal part is c/(z-z_0) ...

Let s_i be the orders of singular points on a curve (Coolidge 1959, p. 56). Harnack's first theorem states that a real irreducible curve of order n cannot have more than ...

A partially ordered set (or poset) is a set taken together with a partial order on it. Formally, a partially ordered set is defined as an ordered pair P=(X,<=), where X is ...

A partially ordered set is defined as an ordered pair P=(X,<=). Here, X is called the ground set of P and <= is the partial order of P.

A relation "<=" is called a preorder (or quasiorder) on a set S if it satisfies: 1. Reflexivity: a<=a for all a in S. 2. Transitivity: a<=b and b<=c implies a<=c. A preorder ...

For x>0, J_0(x) = 2/piint_0^inftysin(xcosht)dt (1) Y_0(x) = -2/piint_0^inftycos(xcosht)dt, (2) where J_0(x) is a zeroth order Bessel function of the first kind and Y_0(x) is ...

There are no tilings of the equilateral triangle of side length 7 by all the polyhexes of order n=4. There are nine distinct solutions of all the polyhexes of order n=4 which ...

Differential Equations

If replacing each number by its square or cube in a magic square produces another magic square, the square is said to be a trimagic square. Trimagic squares are also called ...

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...