arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.00719math.RAmath.ACmath.NT
收藏

多元整数与有限(m,n)-域

Polyadic integer numbers and finite (m,n)-fields

Steven Duplij

摘要:

构成一个多进环的多进整数是一个固定同余类的代表。介绍了多进算术的基础:素数、多进欧拉函数、带余数的多进除法等。定义了在“二元极限”中成为普通剩余类的多进整数的次同余类和相应的有限多进环。引入了(素)有限域的多元形式。它们可以是无零的、无零的和无单位的,或者有几个单位;甚至可能它们的所有元素都是单位。存在同元、同形、同阶的非同构有限多进域。在二进制情况下,上述情况都不可能发生。本文证明了一个有限多进域应该包含一个这里定义的规范素多进域作为一个极小有限子域,它可以被认为是GF(p)的一个多进模拟。

英文摘要:

The polyadic integer numbers, which form a polyadic ring, are representatives of a fixed congruence class. The basics of polyadic arithmetic are presented: prime polyadic numbers, the polyadic Euler function, polyadic division with a remainder, etc. are introduced. Secondary congruence classes of polyadic integer numbers, which become ordinary residue classes in the "binary limit", and the corresponding finite polyadic rings are defined. Polyadic versions of (prime) finite fields are introduced. These can be zeroless, zeroless and nonunital, or have several units; it is even possible for all of their elements to be units. There exist non-isomorphic finite polyadic fields of the same arity shape and order. None of the above situations is possible in the binary case. It is conjectured that a finite polyadic field should contain a certain canonical prime polyadic field, defined here, as a minimal finite subfield, which can be considered as a polyadic analogue of GF(p).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑