Galois域上对称多项式指数和的闭公式
Closed formulas for exponential sums of symmetric polynomials over Galois fields
摘要:
指数和应用于各种科学领域,包括但不限于密码学、编码理论和信息论。对称布尔函数的指数和的闭公式是由Cai,Green和Thierauf在20世纪90年代后期发现的。他们的闭公式意味着这些指数和是线性递归的。这些和的线性递归性已被利用在许多论文中,并已被用来计算这样的序列的渐近行为。本文推广了Cai,Green和Thierauf的结果,即找到了Galois域上对称多项式的指数和的闭公式.我们的结果还意味着,这些序列的递归性质不是唯一的二元域,因为它们也是线性递归的任何有限域。事实上,我们为这样的序列提供了显式的整数系数线性递归。作为结果的副产品,我们发现了Galois域上对称多项式的指数和与一个类似于二等分二项式系数的多项式系数问题之间的联系.
英文摘要:
Exponential sums have applications to a variety of scientific fields, including, but not limited to, cryptography, coding theory and information theory. Closed formulas for exponential sums of symmetric Boolean functions were found by Cai, Green and Thierauf in the late 1990's. Their closed formulas imply that these exponential sums are linear recursive. The linear recursivity of these sums has been exploited in numerous papers and has been used to compute the asymptotic behavior of such sequences. In this article, we extend the result of Cai, Green and Thierauf, that is, we find closed formulas for exponential sums of symmetric polynomials over any Galois fields. Our result also implies that the recursive nature of these sequences is not unique to the binary field, as they are also linear recursive over any finite field. In fact, we provide explicit linear recurrences with integer coefficients for such sequences. As a byproduct of our results, we discover a link between exponential sums of symmetric polynomials over Galois fields and a problem for multinomial coefficients which similar to the problem of bisecting binomial coefficients.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。