• Title/Summary/Keyword: quasigroup

Search Result 14, Processing Time 0.014 seconds

ON ALGORITHMS TO COMPUTE SOME Hv-GROUPS

  • Park, Joong-Soo;Chung, Sang-Cho
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.2
    • /
    • pp.553-573
    • /
    • 2000
  • In this paper, we consider hyperstructures (H,·) when H={e,a,b}. We put a condition on (H,·) where e is a unit. We obtain minimal and maximal Hv -groups , semigroups and quasigroups , using Mathematical 3.0 computer programs.

ON B-ALGEBRAS AND GROUPS

  • Usan, Janez;Zizovic, Malisa
    • East Asian mathematical journal
    • /
    • v.18 no.2
    • /
    • pp.205-209
    • /
    • 2002
  • In the paper the following propositions are proved. 1) If ($Q,{\cdot},e$) is a B-algebra, then there exists a group($Q,A,^{-1}$, 1) such that the following equalities hold e=1 and ${\cdot}=^{-1}A$, where $^{-1}A(x,y)=z{\Longleftrightarrow^{def}}A(z,y)=x$; and 2) If ($Q,A,^{-1}$, e) is a group, then ($Q,^{-1}A$, e) is a B-algebra.

  • PDF

$H_{\upsilon}$-GROUPS WITH WEAK SCALAR ELEMENTS

  • Choi, Byung-Mun;Chung, Sang-Cho
    • Journal of applied mathematics & informatics
    • /
    • v.9 no.1
    • /
    • pp.401-413
    • /
    • 2002
  • In this paper, we consider hyperstructures (H,.) defined on the set H = {e, a, b}. We study the hyperstructure of H when every element is one of a scalar unit, a unit or a weak scalar. On those conditions the $H_{\upsilon}$-quasigroups are classified. And we obtain the 15 minimal $H_{\upsilon}$-groups and 2 non-quasi $H_{\upsilon}$-semigroups For these we use the Mathematica 3.0 computer programs.

LINEAR AND NON-LINEAR LOOP-TRANSVERSAL CODES IN ERROR-CORRECTION AND GRAPH DOMINATION

  • Dagli, Mehmet;Im, Bokhee;Smith, Jonathan D.H.
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.2
    • /
    • pp.295-309
    • /
    • 2020
  • Loop transversal codes take an alternative approach to the theory of error-correcting codes, placing emphasis on the set of errors that are to be corrected. Hitherto, the loop transversal code method has been restricted to linear codes. The goal of the current paper is to extend the conceptual framework of loop transversal codes to admit nonlinear codes. We present a natural example of this nonlinearity among perfect single-error correcting codes that exhibit efficient domination in a circulant graph, and contrast it with linear codes in a similar context.