Search Results for ""

The problem of finding in how many ways E_n a plane convex polygon of n sides can be divided into triangles by diagonals. Euler first proposed it to Christian Goldbach in ...

A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...

At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...

In the original formulation, a quantity associated with ideal class groups. According to Chevalley's formulation, a Grössencharakter is a multiplicative character of the ...

If F is a family of more than n bounded closed convex sets in Euclidean n-space R^n, and if every H_n (where H_n is the Helly number) members of F have at least one point in ...

A tessellation which can be thought of consisting of a number of pieces which are hinged at their vertices and therefore can be opened or closed to yield a series of ...

On a compact oriented Finsler manifold without boundary, every cohomology class has a unique harmonic representation. The dimension of the space of all harmonic forms of ...

The following three pieces of information completely determine the homeomorphic type of a surface (Massey 1996): 1. Orientability, 2. Number of boundary components, 3. Euler ...

The multiplicative subgroup of all elements in the product of the multiplicative groups k_nu^× whose absolute value is 1 at all but finitely many nu, where k is a number ...

König's line coloring theorem states that the edge chromatic number of any bipartite graph equals its maximum vertex degree. In other words, every bipartite graph is a class ...