On a conjecture concerning Kloosterman polynomials (Q2419094): Difference between revisions

For \(c\in\{0,1,\cdots, 2^m-1\}\) we write \(\displaystyle c=\sum_{i=0}^{m-1}c_i2^i\) with \(c_i\in\{0,1\}\) for binary representation of \(c\). The weight of \(c\) is defined by \(\displaystyle w(c)=\sum_{i=0}^{m-1}c_i\). Furthermore for \(e\in \mathbb{F}_2\) we define \(T_e=\{x\in\mathbb{F}_{2^m}:\ \text{Tr} (x)=e\}\), where \(\text{Tr}\) is the trace function from \(\mathbb{F}_{2^m}\) to \(\mathbb{F}_2\). Denote \[ L_c(x)=\sum_{i=0}^{m-1}c_ix^{2^i} \quad\text{and} \quad L_{c,d}(x)=L_{x}(x)+L_{d}\left(x^{2^m-2}\right). \] Let \(e=w(c) \ (\bmod\ 2)\) and \(w(d)\) being even. The polynomial \(L_{c,d}(x)\) is called Kloosterman polynomial on \(\mathbb{F}_{2^m}\) if the mapping \(\displaystyle L_{c,d}: \ \alpha\rightarrow L_{c,d}(\alpha)\) maps \(T_1\) bijectively onto \(T_e\). This paper proves that \(L_{1,d}\) is a Kloosterman polynomial on \(\mathbb{F}_{2^m}\) if \(d\in\{0,3,6,10\}\). Moreover, a conjecture based on permutation polynomial is developed.