| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 824 34 |
| Ultima descărcare din IBN: 2024-03-01 21:29 |
 SM ISO690:2012ARTAMONOV, Viacheslav, CHAKRABARTI, Sucheta, GANGOPADHYAY, Sugata, PAL, Saibal. On Latin squares of polynomially complete
quasigroups and quasigroups generated by shifts. In: Quasigroups and Related Systems, 2013, vol. 21, nr. 2(30), pp. 117-130. ISSN 1561-2848. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Quasigroups and Related Systems |
||||||
| Volumul 21, Numărul 2(30) / 2013 / ISSN 1561-2848 | ||||||
|
||||||
| Pag. 117-130 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We develop some methods and algorithms for checking the polynomial completeness property of some nite quasigroups by considering their corresponding Latin square representations. It is shown that polynomially complete quasigroups are simple and non-T-quasigroups. We study cyclic decompositions of permutations related to rows and columns of Latin squares of non-simple quasigroups and of T-quasigroups. Here we develop the criteria for the polynomial completeness of nite quasigroups based on this study. |
||||||
| Cuvinte-cheie Latin square, permutations, polynomial completeness |
||||||
|
|
|
|
