Permutation polynomials over finite fields from low-degree rational functions

• URL: http://arxiv.org/abs/2503.20982v2
• Date: Mon, 31 Mar 2025 12:51:18 GMT
• Title: Permutation polynomials over finite fields from low-degree rational functions
• Authors: Kirpa Garg, Sartaj Ul Hasan, Chunlei Li, Hridesh Kumar, Mohit Pal,
• Abstract summary: We obtain two classes of permutation binomials and six classes of permutation pentanomials over $F_q2$.<n>We show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.
• Score: 4.0350679788660795
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper considers permutation polynomials over the finite field $F_{q^2}$ in even characteristic by utilizing low-degree permutation rational functions over $F_q$. As a result, we obtain two classes of permutation binomials and six classes of permutation pentanomials over $F_{q^2}$. Additionally, we show that the obtained binomials and pentanomials are quasi-multiplicative inequivalent to the known ones in the literature.

Related papers

• Quantum Advantage via Solving Multivariate Quadratics [12.62849227946452]
  We show that there is a quantum-time algorithm that simultaneously solves $p_i(x_n)=y_i_iin [m]$ over $mathbbF$.<n>While a solution exists with high probability, we conjecture that it is hard to find one based on classical cryptanalysis.
  arXiv  Detail & Related papers  (2024-11-22T03:10:10Z)
• A new multivariate primitive from CCZ equivalence [1.8024397171920885]
  Two secret affine invertible $mathcal S,mathcal T$ are applied to a set of $mathcalF$. The equivalences $mathcal G$ and $mathcal F$ are said to be affine equivalent.
  arXiv  Detail & Related papers  (2024-05-31T16:15:02Z)
• Efficient unitary designs and pseudorandom unitaries from permutations [35.66857288673615]
  We show that products exponentiated sums of $S(N)$ permutations with random phases match the first $2Omega(n)$ moments of the Haar measure. The heart of our proof is a conceptual connection between the large dimension (large-$N$) expansion in random matrix theory and the method.
  arXiv  Detail & Related papers  (2024-04-25T17:08:34Z)
• Higher Level Completeness for Permutation Polynomials [0.0]
  Generalising the concept of a complete permutation over a finite field, we define completness to level $kge1$ in fields of odd characteristics. We construct two families of characteristics that satisfy the condition of high level completeness for all finite fields.
  arXiv  Detail & Related papers  (2023-10-19T04:47:53Z)
• An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree [79.43134049617873]
  In this paper, we demonstrate an exponential separation between exact degree and approximate quantum query for a partial function. For an alphabet size, we have a constant versus separation complexity.
  arXiv  Detail & Related papers  (2023-01-22T22:08:28Z)
• Quantum and classical low-degree learning via a dimension-free Remez inequality [52.12931955662553]
  We show a new way to relate functions on the hypergrid to their harmonic extensions over the polytorus. We show the supremum of a function $f$ over products of the cyclic group $exp(2pi i k/K)_k=1K$. We extend to new spaces a recent line of work citeEI22, CHP, VZ22 that gave similarly efficient methods for learning low-degrees on hypercubes and observables on qubits.
  arXiv  Detail & Related papers  (2023-01-04T04:15:40Z)
• Two-body Coulomb problem and $g^{(2)}$ algebra (once again about the Hydrogen atom) [77.34726150561087]
  It is shown that if the symmetry of the three-dimensional system is $(r, rho, varphi)$, the variables $(r, rho, varphi)$ allow a separation of variable $varphi$ and eigenfunctions. Thoses occur in the study of the Zeeman effect on Hydrogen atom.
  arXiv  Detail & Related papers  (2022-12-02T20:11:17Z)
• Sums of Separable and Quadratic Polynomials [0.3222802562733786]
  We study separable plus quadratic (SPQ)s. We show that convex SPQ optimization problems can be solved by "small" semidefinite programs.
  arXiv  Detail & Related papers  (2021-05-11T03:26:46Z)
• Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
  We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
  arXiv  Detail & Related papers  (2021-04-26T15:03:08Z)
• Finite-Function-Encoding Quantum States [52.77024349608834]
  We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions. We investigate some of their structural properties.
  arXiv  Detail & Related papers  (2020-12-01T13:53:23Z)
• SURF: A Simple, Universal, Robust, Fast Distribution Learning Algorithm [64.13217062232874]
  SURF is an algorithm for approximating distributions by piecewises. It outperforms state-of-the-art algorithms in experiments.
  arXiv  Detail & Related papers  (2020-02-22T01:03:33Z)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.