Search Results for ""

An algorithm for computing an Egyptian fraction.

If the knot K is the boundary K=f(S^1) of a singular disk f:D->S^3 which has the property that each self-intersecting component is an arc A subset f(D^2) for which f^(-1)(A) ...

If the Taniyama-Shimura conjecture holds for all semistable elliptic curves, then Fermat's last theorem is true. Before its proof by Ribet in 1986, the theorem had been ...

Consider a countable subgroup H with elements h_i and an element x not in H, then h_ix for i=1, 2, ... constitute the right coset of the subgroup H with respect to x.

The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...

The kernel of a ring homomorphism f:R-->S is the set of all elements of R which are mapped to zero. It is the kernel of f as a homomorphism of additive groups. It is an ideal ...

A unit in a ring is an element u such that there exists u^(-1) where u·u^(-1)=1.

A ringoid is a set R with two binary operators, conventionally denoted addition (+) and multiplication (×), where × distributes over + left and right: a(b+c)=ab+ac and ...

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...