Search Results for ""

An integral obtained by contour integration. The particular path in the complex plane used to compute the integral is called a contour. As a result of a truly amazing ...

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i (West 2000, p. 20). ...

As a consequence of Matiyasevich's refutation of Hilbert's 10th problem, it can be proved that there does not exist a general algorithm for solving a general quartic ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

A mathematical problem, usually not requiring advanced mathematics, to which a solution is desired. Puzzles frequently require the rearrangement of existing pieces (e.g., 15 ...

Let gamma be a path in C, w=f(z), and theta and phi be the tangents to the curves gamma and f(gamma) at z_0 and w_0. If there is an N such that f^((N))(z_0) != 0 (1) ...

A plane path on a set of equally spaced lattice points, starting at the origin, where the first step is one unit to the north or south, the second step is two units to the ...

A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...

Let DeltaABC be a triangle and D a point on the side BC. Let I be the incenter, P the center of the circle tangent to the circumcircle and segments AD and BD, Q the center of ...

A matrix whose entries are all integers. Special cases which arise frequently are those having only (-1,1) as entries (e.g., Hadamard matrix), (0,1)-matrices having only ...