Permutation polynomials with Carlitz rank 2

DOI10.1016/J.DISC.2020.112155MaRDI QIDQ2219946zbMATH OpenOpenAlexFDO

Authors José Alves Oliveira, F. E. Brochero Martínez

Publication date 21 January 2021

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.04653

zbMATH Keywords

Carlitz rankHermite criteriapermutation polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)

Abstract: Let $mathbb{F}_q$ denote the finite field with $q$ elements. The Carlitz rank of a permutation polynomial is a important measure of complexity of the polynomial. In this paper we find the sharp lower bound for the weight of any permutation polynomial with Carlitz rank $2$, improving the bound found by G'omez-P'erez, Ostafe and Topuzou{g}lu in that case.

Review text

``The Carlitz rank of a permutation polynomial is an important measure of complexity of a polynomial. The weight of a polynomial \(f\) is the number of non-null coefficients of \(f\). A challenging problem is to give a lower bound for the weight of a polynomial \(f\) in terms of its Carlitz rank. Using techniques of algebraic nature, the authors provide an improvement of a known lower bound from Gomez-Perez, Ostafe, and Topuzoglu, given the Carlitz rank of \(f\) equals \(2\).

Recommendations

• On the Carlitz rank of permutation polynomials
• Carlitz rank and index of permutation polynomials
• On permutation polynomials
• scientific article; zbMATH DE number 5130684
• scientific article; zbMATH DE number 6612947
• On permutation polynomials over finite fields of characteristic 2
• On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
• Permutation and complete permutation polynomials
• Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
• Permutation polynomials modulo 2w

Cites work

• Carlitz rank and index of permutation polynomials
• Circular Tuscan-\(k\) arrays from permutation binomials
• Complete mappings and Carlitz rank
• Determination of a type of permutation binomials over finite fields
• Determination of a type of permutation trinomials over finite fields. II
• Handbook of finite fields
• New classes of permutation binomials and permutation trinomials over finite fields
• New cyclic difference sets with Singer parameters
• On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
• On the Carlitz rank of permutation polynomials
• On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Permutation binomials over finite fields
• Permutations in a finite field
• Polynomial interpolation of the discrete logarithm
• The Carlitz rank of permutations of finite fields: a survey

Cited in

(8)

• On the difference between permutation polynomials
• Carlitz rank and index of permutation polynomials
• On the Carlitz rank of permutation polynomials over finite fields: recent developments
• Connecting two types of representations of a permutation of \(\mathbb{F}_q\)
• The Carlitz rank of permutations of finite fields: a survey
• On the Carlitz rank of permutations of \(\mathbb F_q\) and pseudorandom sequences
• Polynomial bound for the partition rank vs the analytic rank of tensors
• On the Carlitz rank of permutation polynomials

This page was built for publication: Permutation polynomials with Carlitz rank 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2219946)