首页> 外文期刊>urnal of Symbolic Computation >Algorithms for Finite Near-rings and their N-groups
【24h】

Algorithms for Finite Near-rings and their N-groups

机译:有限近环及其N群的算法

获取原文
获取原文并翻译 | 示例
           

摘要

In this note, we present algorithms to deal with finite near-rings, the appropriate alge- braic structure to study non-linear functions on finite groups. Just as rings (of matri- ces) operate on vector spaces, near-rings operate on groups. In our approach, we have developed efficient algorithms for a variety of problems that involve the structure of the operation of a near-ring on a group. From this, we retrieve information about the near-ring itself.
机译:在本说明中,我们提出了用于处理有限近环的算法,这是研究有限组上非线性函数的适当代数结构。就像(矩阵的)环在向量空间上运行一样,近环在组上也运行。在我们的方法中,我们针对各种问题开发了有效的算法,这些问题涉及组上近环的操作结构。由此,我们获取有关近环本身的信息。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号