Search Results for ""

If, after constructing a difference table, no clear pattern emerges, turn the paper through an angle of 60 degrees and compute a new table. If necessary, repeat the process. ...

The skeleton graphs of the Johnson solids are polyhedral graphs. The Johnson skeleton graphs J_3 and J_(63) are minimal unit-distance forbidden graphs. The skeleton of the ...

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...

Jonquière's relation, sometimes also spelled "Joncquière's relation" (Erdélyi et al. 1981, p. 31), states ...

A formal logic developed by Alonzo Church and Stephen Kleene to address the computable number problem. In the lambda calculus, lambda is defined as the abstraction operator. ...

An exponential growth law of the form y=ar^x characterizing a quantity which increases at a fixed rate proportionally to itself.

The Lebesgue covering dimension is an important dimension and one of the first dimensions investigated. It is defined in terms of covering sets, and is therefore also called ...

A Lie group is a group with the structure of a manifold. Therefore, discrete groups do not count. However, the most useful Lie groups are defined as subgroups of some matrix ...

Throughout abstract algebra, the term "magma" is most often used as a synonym of the more antiquated term "groupoid," referring to a set equipped with a binary operator. The ...

Mergelyan's theorem can be stated as follows (Krantz 1999). Let K subset= C be compact and suppose C^*\K has only finitely many connected components. If f in C(K) is ...