Search Results for ""

A Laurent polynomial with coefficients in the field F is an algebraic object that is typically expressed in the form ...+a_(-n)t^(-n)+a_(-(n-1))t^(-(n-1))+... ...

Let a, b, and c be the lengths of the legs of a triangle opposite angles A, B, and C. Then the law of sines states that a/(sinA)=b/(sinB)=c/(sinC)=2R, (1) where R is the ...

Let a triangle have sides of length a, b, and c and let the angles opposite these sides be denoted A, B, and C. The law of tangents states ...

A point about which inversion of two circles produced concentric circles. Every pair of distinct circles has two limiting points. The limiting points correspond to the point ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

For a logarithmic spiral given parametrically as x = ae^(bt)cost (1) y = ae^(bt)sint, (2) evolute is given by x_e = -abe^(bt)sint (3) y_e = abe^(bt)cost. (4) As first shown ...

Meißner (1911) showed how to modify the Reuleaux tetrahedron (which is not a solid of constant width) to form a surface of constant width by replacing three of its edge arcs ...

A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...