Search Results for ""

One of the Eilenberg-Steenrod axioms. Let X be a single point space. H_n(X)=0 unless n=0, in which case H_0(X)=G where G are some groups. The H_0 are called the coefficients ...

If, in an interval of x, sum_(r=1)^(n)a_r(x) is uniformly bounded with respect to n and x, and {v_r} is a sequence of positive non-increasing quantities tending to zero, then ...

The metric g defined on a nonempty set X by g(x,x) = 0 (1) g(x,y) = 1 (2) if x!=y for all x,y in X. It follows that the open ball of radius r>0 and center at x_0 B(x_0,r)={x ...

The set of all edge automorphisms of G, denoted Aut^*(G). Let L(G) be the line graph of a graph G. Then the edge automorphism group Aut^*(G) is isomorphic to Aut(L(G)), ...

Given a module M over a unit ring R, the set End_R(M) of its module endomorphisms is a ring with respect to the addition of maps, (f+g)(x)=f(x)+g(x), for all x in M, and the ...

A 1-cusped epicycloid has b=a, so n=1. The radius measured from the center of the large circle for a 1-cusped epicycloid is given by epicycloid equation (◇) with n=1 so r^2 = ...

The inverse curve of the epispiral r=asec(ntheta) with inversion center at the origin and inversion radius k is the rose curve r=(kcos(ntheta))/a.

The paradox "This statement is false," stated in the fourth century BC. It is a sharper version of the Epimenides paradox, "All Cretans are liars...One of their own poets has ...

A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...

The straightedge and the compass. The name is due to the fact that connecting points with segments, prolonging segments and drawing circles with a given center and a given ...