Search arXiv⌕ Search

arXiv · 2610.16619

Sparse Lifts of q-Linearized Permutation Polynomials with Explicit Inverses

Abstract

We give a higher unit-torus lift from q-linearized permutation polynomials over Fqn to generally nonlinear sparse permutation polynomials over Fqns. The construction preserves compositional inverses: if a linearized polynomials and its inverse have coefficients (ai) and (Ai), then the lifted polynomial and its inverse have the same coefficients. As a consequence, we obtain nonlinear binomial lifts whose inverses are again binomials in the two-dimensional case, including an explicit inverse for a binomial family over Fq4. The three dimensional specialization yields permutation trinomials whose compositional inverses are again trinomials, together with explicit involution criteria and examples.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yi Li. 2026-10-12. Sparse Lifts of q-Linearized Permutation Polynomials with Explicit Inverses. https://arxiv.org/abs/2610.16619

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Sporadic points on $X_0(N)$

We determine all integers $N$ for which the modular curve $X_0(N)$ admits a sporadic CM point (of any degree), as well as all $N$ for which $X_0(N)$ admits a sporadic point, whether CM or non-CM. In a sense, our results generalize the classification of isogenies of elliptic curves over $\Q$ due to Mazur and Kenku: their work determines the $X_0(N)$ with degree 1 sporadic points, whereas we classify all $X_0(N)$ that have a sporadic point of arbitrary degree.

math.NT↗

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $ω(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.

math.NT↗