Search Results for ""

A d-dimensional discrete percolation model is said to be inhomogeneous if different graph edges (in the case of bond percolation models) or vertices (in the case of site ...

Let P(z) and Q(z) be univariate polynomials in a complex variable z, and let the polynomial degrees of P and Q satisfy deg(Q)>=deg(P+2). Then int_gamma(P(z))/(Q(z))dz = ...

An interval is a connected portion of the real line. If the endpoints a and b are finite and are included, the interval is called closed and is denoted [a,b]. If the ...

Given a circle C with center O and radius k, then two points P and Q are inverse with respect to C if OP·OQ=k^2. If P describes a curve C_1, then Q describes a curve C_2 ...

Isomorphic factorization colors the edges a given graph G with k colors so that the colored subgraphs are isomorphic. The graph G is then k-splittable, with k as the divisor, ...

An isosceles triangle is a triangle with (at least) two equal sides. In the figure above, the two equal sides have length b and the remaining side has length a. This property ...

The Johnson circumconic, a term used here for the first time, is the circumconic that passes through the vertices of both the reference triangle and the Johnson triangle. It ...

The Johnson triangle DeltaJ_AJ_BJ_C, a term coined here for the first time, is the triangle formed by the centers of the Johnson circles. It has trilinear vertex matrix ...

There are several versions of the Kaplan-Yorke conjecture, with many of the higher dimensional ones remaining unsettled. The original Kaplan-Yorke conjecture (Kaplan and ...

C. Kimberling has extensively tabulated and enumerated the properties of triangle centers (Kimberling 1994, 1998, and online), denoting the nth center in his numbering scheme ...