Jump to content

Heap (mathematics)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Hawthorn (talk | contribs) at 05:58, 11 August 2006 (oops - fix wikilink). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A Heap is a mathematical generalisation of a group.

It is an algebra H with a ternary operation denoted which satisfies

  • the para-associative law

  • the identity law

Every coset in a group can be regarded as a heap under the operation .

If we choose an element we can define a binary product on a heap by . This product makes H into a group with identity e. A heap can thus be regarded as a group in which the identity has yet to be decided.

Whereas the automorphisms of a single object form a group, the set of isomorphisms between two isomorphic objects naturally forms a heap. A heap becomes a group once a particular isomorphism by which the two objects are to be identified is chosen.