Displaying 121 – 140 of 10155

Showing per page

A closure condition which is equivalent to the Thomsen condition in quasigroups.

M. A. Taylor (1983)

Stochastica

In this note it is shown that the closure condition, X1Y2 = X2Y1, X1Y4 = X2Y3, X3Y3 = X4Y1 --> X4Y2 = X3Y4, (and its dual) is equivalent to the Thomsen condition in quasigroups but not in general. Conditions are also given under which groupoids satisfying it are principal homotopes of cancellative, abelian semigroups, or abelian groups.

A computer algebra solution to a problem in finite groups.

Gert-Martin Greuel (2003)

Revista Matemática Iberoamericana

We report on a partial solution of the conjecture that the class of finite solvable groups can be characterised by 2-variable identities. The proof requires pieces from number theory, algebraic geometry, singularity theory and computer algebra. The computations were carried out using the computer algebra system SINGULAR.

A conjecture on the concatenation product

Jean-Eric Pin, Pascal Weil (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

In a previous paper, the authors studied the polynomial closure of a variety of languages and gave an algebraic counterpart, in terms of Mal’cev products, of this operation. They also formulated a conjecture about the algebraic counterpart of the boolean closure of the polynomial closure – this operation corresponds to passing to the upper level in any concatenation hierarchy. Although this conjecture is probably true in some particular cases, we give a counterexample in the general case. Another...

Currently displaying 121 – 140 of 10155