A new method for computing the number of n-quasigroups

Markovski Smile; Dimitrova Vesna; Mileva Alexandra

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

728

SM ISO690:2012

MARKOVSKI, Smile, DIMITROVA, Vesna, MILEVA, Alexandra. A new method for computing the number of n-quasigroups. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2006, nr. 3(52), pp. 57-64. ISSN 1024-7696.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica

Numărul 3(52) / 2006 / ISSN 1024-7696 /ISSNe 2587-4322

A new method for computing the number of n-quasigroups

Pag. 57-64

Markovski Smile, Dimitrova Vesna, Mileva Alexandra

Institute of Informatics, Republic of Macedonia

Disponibil în IBN: 21 decembrie 2015

Descarcă PDF

Rezumat

We use the isotopy classes of quasigroups for computing the numbers of finite n-quasigroups (n = 1, 2, 3, . . . ). The computation is based on the prop- erty that every two isotopic n-quasigroups are substructures of the same number of n 1-quasigroups. This is a new method for computing the number of n-quasigroups and in an enough easy way we could compute the numbers of ternary quasigroups of orders up to and including 5 and of quaternary quasigroups of orders up to and including 4.

Cuvinte-cheie
n-quasigroup, n-Latin square.,

isotopism

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-41324</cfResPublId>
<cfResPublDate>2006-12-01</cfResPublDate>
<cfVol>52</cfVol>
<cfIssue>3</cfIssue>
<cfStartPage>57</cfStartPage>
<cfISSN>1024-7696</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/41324</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>A new method for computing the number of n-quasigroups</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>n-quasigroup; isotopism; n-Latin square.</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'>We use the isotopy classes of quasigroups for computing the numbers of finite n-quasigroups (n = 1, 2, 3, . . . ). The computation is based on the prop- erty that every two isotopic n-quasigroups are substructures of the same number of n 1-quasigroups. This is a new method for computing the number of n-quasigroups and in an enough easy way we could compute the numbers of ternary quasigroups of orders up to and including 5 and of quaternary quasigroups of orders up to and including 4. </cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-31544</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-36592</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-46152</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-31544</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-31544-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Markovski</cfFamilyNames>
<cfFirstNames>Smile</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-36592</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-36592-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Dimitrova</cfFamilyNames>
<cfFirstNames>Vesna</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-46152</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-46152-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2006-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Mileva</cfFamilyNames>
<cfFirstNames>Alexandra</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>