On a conjecture about a class of permutation quadrinomials

09/18/2019
by   Kangquan Li, et al.
0

Very recently, Tu et al. presented a sufficient condition about (a_1,a_2,a_3), see Theorem 1.1, such that f(x) = x^3· 2^m + a_1 x^2^m+1+1+ a_2 x^2^m+2 + a_3 x^3 is a class of permutation polynomials over _2^n with n=2m and m odd. In this present paper, we prove that the sufficient condition is also necessary.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2019

Necessities and sufficiencies of a class of permutation polynomials over finite fields

For the finite field F_2^3m, permutation polynomials of the form (x^2^m+...
research
02/17/2022

Necessary and sufficient condition for a generic 3R serial manipulator to be cuspidal

Cuspidal robots can travel from one inverse kinematic solution to anothe...
research
05/26/2023

Investigating how ReLU-networks encode symmetries

Many data symmetries can be described in terms of group equivariance and...
research
12/08/2017

A Classification of Functions in Multiterminal Distributed Computing

In the distributed function computation problem, dichotomy theorems, ini...
research
01/14/2022

The Sassenfeld criterion revisited

The starting point of this article is a decades-old yet little-noticed s...
research
07/14/2019

Necessary and sufficient condition for equilibrium of the Hotelling model

We study a model of vendors competing to sell a homogeneous product to c...
research
09/21/2018

Local Computation Algorithms for the Lovász Local Lemma

We consider the task of designing Local Computation Algorithms (LCA) for...

Please sign up or login with your details

Forgot password? Click here to reset