Search Results for ""

The point of concurrence of the joins of the vertices of a triangle and the points of contact of an inconic of the triangle (Veblen and Young 1938, p. 111; Eddy and Fritsch ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

The points of tangency t_1 and t_2 for the four lines tangent to two circles with centers x_1 and x_2 and radii r_1 and r_2 are given by solving the simultaneous equations ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

A graph is a forbidden minor if its presence as a graph minor of a given graph means it is not a member of some family of graphs. More generally, there may be a family of ...

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 ...

Given a set y=f(x) of n equations in n variables x_1, ..., x_n, written explicitly as y=[f_1(x); f_2(x); |; f_n(x)], (1) or more explicitly as {y_1=f_1(x_1,...,x_n); |; ...

A grand unified theory of mathematics which includes the search for a generalization of Artin reciprocity (known as Langlands reciprocity) to non-Abelian Galois extensions of ...

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...