Displaying 81 – 100 of 323

Showing per page

On distributive trices

Kiyomitsu Horiuchi, Andreja Tepavčević (2001)

Discussiones Mathematicae - General Algebra and Applications

A triple-semilattice is an algebra with three binary operations, which is a semilattice in respect of each of them. A trice is a triple-semilattice, satisfying so called roundabout absorption laws. In this paper we investigate distributive trices. We prove that the only subdirectly irreducible distributive trices are the trivial one and a two element one. We also discuss finitely generated free distributive trices and prove that a free distributive trice with two generators has 18 elements.

On Equational Theory of Left Divisible Left Distributive Groupoids

Přemysl Jedlička (2012)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

It is an open question whether the variety generated by the left divisible left distributive groupoids coincides with the variety generated by the left distributive left quasigroups. In this paper we prove that every left divisible left distributive groupoid with the mapping a a 2 surjective lies in the variety generated by the left distributive left quasigroups.

On exponentiation on n-ary hyperalgebras

František Bednařík, Josef Šlapal (2001)

Discussiones Mathematicae - General Algebra and Applications

For n-ary hyperalgebras we study a binary operation of exponentiation which to a given pair of n-ary hyperalgebras assigns their power, i.e., an n-ary hyperalgebra carried by the corresponding set of homomorphisms. We give sufficient conditions for the existence of such a power and for a decent behaviour of the exponentiation. As a consequence of our investigations we discover a cartesian closed subcategory of the category of n-ary hyperalgebras and homomorphisms between them.

On finite functions with non-trivial arity gap

Slavcho Shtrakov, Jörg Koppitz (2010)

Discussiones Mathematicae - General Algebra and Applications

Given an n-ary k-valued function f, gap(f) denotes the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. We particularly solve a problem concerning the explicit determination of n-ary k-valued functions f with 2 ≤ gap(f) ≤ n ≤ k. Our methods yield new combinatorial results about the number of such functions.

Currently displaying 81 – 100 of 323