arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.4635math.CO
收藏

有限域上多项式幂系数的模式

Patterns In The Coefficients Of Powers Of Polynomials Over A Finite Field

Kevin Garbe

摘要:

研究了素数阶有限域上多项式的幂系数的性质。扩展Allouche-Berthe,1997的工作,我们研究了a(n),在多项式f的模为素数p的任何幂次的系数中长度为n的串的出现数。对于f=1+x和一般p,我们导出了a(n)的一个递推关系,然后找到了a(n)的生成函数的一个新公式。我们使用生成函数来计算a(n)/n^2在n接近无穷大时的渐近性,这是x中的显式可计算分段二次函数,其中n= [p^m/x],x是1/p和1之间的实数。通过分析其它情况,我们对一般a(n)的母函数提出了一个猜想.我们研究了与f和p相关的矩阵B,用于计算系数的计数,这适用于线性元胞自动机和分形理论。对于p=2和小次数的多项式,我们计算B的最大正特征值λ,其与相应分形的分形维数d相关为d= \log_2(λ)。我们证明了λ的一些界和它的次数的上界,并给出了一些结果。

英文摘要:

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power of a polynomial f reduced modulo a prime p. The sequence of line complexity a(n) is p-regular in the sense of Allouche-Shalit. For f=1+x and general p, we derive a recursion relation for a(n) then find a new formula for the generating function for a(n). We use the generating function to compute the asymptotics of a(n)/n^2 as n approaches infinity, which is an explicitly computable piecewise quadratic in x with n= [p^m/x] and x is a real number between 1/p and 1. Analyzing other cases, we form a conjecture about the generating function for general a(n). We examine the matrix B associated with f and p used to compute the count of a coefficient, which applies to the theory of linear cellular automata and fractals. For p=2 and polynomials of small degree we compute the largest positive eigenvalue, λ, of B, related to the fractal dimension d of the corresponding fractal by d= \log_2(λ). We find proofs and make a number of conjectures for some bounds on λ, and upper bounds on its degree.

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

↑