In abstract algebra, a semiheap is an algebraic structure consisting of a non-empty set H with a ternary operation denoted that satisfies a modified associativity property: A biunitary element h of a semiheap satisfies [h,h,k] = k = [k,h,h] for every k in H. A heap is a semiheap in which every element is biunitary. The term heap is derived from груда, Russian for "heap", "pile", or "stack". Anton Sushkevich used the term in his Theory of Generalized Groups (1937) which influenced Viktor Wagner, promulgator of semiheaps, heaps, and generalized heaps. Груда contrasts with группа (group) which was taken into Russian by transliteration. Indeed, a heap has been called a groud in English text.) (en)
In abstract algebra, a semiheap is an algebraic structure consisting of a non-empty set H with a ternary operation denoted that satisfies a modified associativity property: A biunitary element h of a semiheap satisfies [h,h,k] = k = [k,h,h] for every k in H. A heap is a semiheap in which every element is biunitary. (en)