Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Paul W. Bunting"'
Publikováno v:
Mathematics of Computation. 32:593-605
The associativity problem for the class of finite multiplication tables is known to be undecidable, even for quite narrow infinite subclasses of tables. We present criteria which can be used to decide associativity in many cases, although any effecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ced17061edda7b8306fa6e1dfbd2f2a
https://doi.org/10.1090/s0025-5718-1978-0498906-7
https://doi.org/10.1090/s0025-5718-1978-0498906-7
Publikováno v:
Mathematics of Computation; 4/ 1/1978, Vol. 32 Issue 142, p593-605, 13p
Autor:
A. Ya. Aĭzenshtat, A. E. Evseev, N. E. Podran, I. S. Ponizovskiĭ, B. M. Shaĭn, È. G. Shutov, Yu. M. Vazhenin
This volume contains papers selected by leading specialists in algebraic semigroups in the U.S., the United Kingdom, and Australia. Many of the papers strongly influenced the development of algebraic semigroups, but most were virtually unavailable ou
Tamari lattices originated from weakenings or reinterpretations of the familar associativity law. This has been the subject of Dov Tamari's thesis at the Sorbonne in Paris in 1951 and the central theme of his subsequent mathematical work. Tamari latt