当前位置: X-MOL 学术Finite Fields Their Appl. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
On a type of permutation rational functions over finite fields
Finite Fields and Their Applications ( IF 1 ) Pub Date : 2020-09-25 , DOI: 10.1016/j.ffa.2020.101758
Xiang-dong Hou , Christopher Sze

Let p be a prime and n be a positive integer. Let fb(X)=X+(XpX+b)1, where bFpn is such that Trpn/p(b)0. In 2008, Yuan et al. [12] showed that for p=2,3, fb permutes Fpn for all n1. Using the Hasse-Weil bound, we show that when p>3 and n5, fb does not permute Fpn. For p>3 and n=2, we prove that fb permutes Fp2 if and only if Trp2/p(b)=±1. We conjecture that for p>3 and n=3,4, fb does not permute Fpn.



中文翻译:

关于有限域上的一类置换有理函数

p为质数,n为正整数。让FbX=X+Xp-X+b-1个,在哪里 bFpñ 就是这样 Trpñ/pb0。2008年,袁等人。[12]表明,对于p=23Fb 排列 Fpñ 对所有人 ñ1个。使用Hasse-Weil边界,我们证明了当p>3ñ5Fb 不置换 Fpñ。对于p>3ñ=2,我们证明 Fb 排列 Fp2 当且仅当 Trp2/pb=±1个。我们推测p>3ñ=34Fb 不置换 Fpñ

更新日期:2020-09-26
down
wechat
bug