Search Results for ""

The co-rank of a graph G is defined as s(G)=m-n+c, where m is the number of edges of G, n is the number of vertices, and c is the number of connected components (Biggs 1993, ...

The dual of the great snub dodecicosidodecahedron and Wenninger dual W_(115).

The kernel of a group homomorphism f:G-->G^' is the set of all elements of G which are mapped to the identity element of G^'. The kernel is a normal subgroup of G, and always ...

The H-fractal is a fractal constructed by starting with the line segments corresponding to a capital letter H, then iteratively placing smaller H's centered at the top and ...

If R is a Noetherian ring, then S=R[X] is also a Noetherian ring.

One of the Eilenberg-Steenrod axioms which states that, if f:(X,A)->(Y,B) is homotopic to g:(X,A)->(Y,B), then their induced maps f_*:H_n(X,A)->H_n(Y,B) and ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

A function for which the integral can be computed is said to be integrable.

A list of problems in low-dimensional topology maintained by Kirby (1995). The list currently runs about 380 pages.

The statistical index P_L=(sump_nq_0)/(sump_0q_0), where p_n is the price per unit in period n and q_0 is the quantity produced in the initial period.