Erez self-dual正规基的复杂性
Complexities of Erez self-dual normal bases
摘要：
自对偶正规基的复杂性，是某些定义的扩张的最低复杂性基的候选者，借助于在精心选择的最小Besicovitch安排中除了单点之外的所有单点的数目来确定.本文首先将这些值与Fd2中最小随机选择Besicovitch排列中除单点外的所有单点的个数的期望值进行比较，得到了前370个素数d.然后，特别是最小贝西科维奇安排，共享几个几何性质的安排考虑确定的复杂性将被认为是在两个不同的情况下。
英文摘要：
The complexities of self-dual normal bases, which are candidates for the lowest complexity basis of some defined extensions, are determined with the help of the number of all but the simple points in well chosen minimal Besicovitch arrangements. In this article, these values are first compared with the expected value of the number of all but the simple points in a minimal randomly selected Besicovitch arrangement in F d 2 for the first 370 prime numbers d. Then, particular minimal Besicovitch arrangements which share several geometrical properties with the arrangements considered to determine the complexity will be considered in two distinct cases.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
