{"paper":{"title":"Constructing permutation polynomials over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Shaofang Hong, Xiaoer Qin","submitted_at":"2013-03-09T16:22:21Z","abstract_excerpt":"In this paper, we construct several new permutation polynomials over finite fields. First, using the linearized polynomials, we construct the permutation polynomial of the form $\\sum_{i=1}^k(L_{i}(x)+\\gamma_i)h_i(B(x))$ over ${\\bf F}_{q^{m}}$, where $L_i(x)$ and $B(x)$ are linearized polynomials. This extends a theorem of Coulter, Henderson and Matthews. Consequently, we generalize a result of Marcos by constructing permutation polynomials of the forms $x h(\\lambda_{j}(x))$ and $xh(\\mu_{j}(x))$, where $\\lambda_{j}(x)$ is the $j$-th elementary symmetric polynomial of $x, x^{q}, ..., x^{q^{m-1}}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.2229","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}