On algorithms to compute some Hv-groups

被引:0
|
作者
Park, Joongsoo
Chung, Sang-Cho
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
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 Mathematica 3.0 computer programs.
引用
收藏
页码:433 / 453
相关论文
共 50 条
  • [41] NONBLOCKING GRAPHS - GREEDY ALGORITHMS TO COMPUTE DISJOINT PATHS
    SCHWILL, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 415 : 250 - 262
  • [42] Sequential and Parallel Algorithms to Compute Turbulent Coherent Structures
    Gandia-Barbera, Sergio
    Cremades, Andres
    Vinuesa, Ricardo
    Hoyas, Sergio
    Perez-Quiles, Maria Jezabel
    MATHEMATICS, 2024, 12 (21)
  • [43] Linear parallel algorithms to compute strong and branching bisimilarity
    Jan Martens
    Jan Friso Groote
    Lars B. van den Haak
    Pieter Hijma
    Anton Wijs
    Software and Systems Modeling, 2023, 22 : 521 - 545
  • [44] Algorithms that compute test drivers in object oriented testing
    Alkadi, IS
    Alkadi, GS
    2001 IEEE AEROSPACE CONFERENCE PROCEEDINGS, VOLS 1-7, 2001, : 115 - 119
  • [45] Algorithms to compute the topology of orientable real algebraic surfaces
    Fortuna, E
    Gianni, P
    Parenti, P
    Traverso, C
    JOURNAL OF SYMBOLIC COMPUTATION, 2003, 36 (3-4) : 343 - 364
  • [46] Fast algorithms to compute the elementary operators of Mathematical Morphology
    Barrera, J
    Hirata, R
    X BRAZILIAN SYMPOSIUM ON COMPUTER GRAPHICS AND IMAGE PROCESSING, PROCEEDINGS, 1997, : 163 - 170
  • [47] Signature-based Algorithms to Compute Grobner Bases
    Eder, Christian
    Perry, John
    ISSAC 2011: PROCEEDINGS OF THE 36TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2011, : 99 - 106
  • [48] Distributed Algorithms to Compute Walrasian Equilibrium in Mobile Crowdsensing
    Duan, Xiaoming
    Zhao, Chengcheng
    He, Shibo
    Cheng, Peng
    Zhang, Junshan
    IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS, 2017, 64 (05) : 4048 - 4057
  • [49] A METHOD FOR DESIGNING ALGORITHMS TO COMPUTE VISCOUS INCOMPRESSIBLE FLOWS
    GUROV, DB
    ELIZAROVA, TG
    USSR COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 1990, 30 (06): : 86 - 92
  • [50] Algorithms to compute minimum cycle basis in directed graphs
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    THEORY OF COMPUTING SYSTEMS, 2007, 40 (04) : 485 - 505