Search Results for ""

The wreathed product of the monster group by Z_2. The bimonster is a quotient of the Coxeter group with the above Coxeter-Dynkin diagram. This had been conjectured by Conway, ...

A binary operation f(x,y) is an operation that applies to two quantities or expressions x and y. A binary operation on a nonempty set A is a map f:A×A->A such that 1. f is ...

The determinant of a binary quadratic form Au^2+2Buv+Cv^2 is defined as D=AC-B^2. It is equal to 1/4 of the corresponding binary quadratic form discriminant. Unfortunately, ...

The discriminant of a binary quadratic form au^2+buv+cv^2 is defined by d=4ac-b^2. It is equal to four times the corresponding binary quadratic form determinant. ...

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

An algorithm for computing an Egyptian fraction (Stewart 1992).

The two recursive sequences U_n = mU_(n-1)+U_(n-2) (1) V_n = mV_(n-1)+V_(n-2) (2) with U_0=0, U_1=1 and V_0=2, V_1=m, can be solved for the individual U_n and V_n. They are ...

If M^3 is a closed oriented connected 3-manifold such that every simple closed curve in M lies interior to a ball in M, then M is homeomorphic with the hypersphere, S^3.

A sequence of polynomials p_n satisfying the identities p_n(x+y)=sum_(k>=0)(n; k)p_k(x)p_(n-k)(y).

A polynomial with 2 terms.