PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
May 27, 2026International Journal of Foundations of Computer Science0 citations

Two New Classes of Complete Permutation Polynomials Over Finite Fields 𝔽33n

View Full Paper
RSRajesh P. SinghJPJitendra PrakashDKDinesh Kumar

Key Points

  • This paper aims to identify and characterize two new classes of complete permutation polynomials over finite fields.
  • Investigated two specific polynomial forms for completeness in permutation properties.
  • Analyzed multiple values of variables to establish conditions for completeness.
  • Characterized the second class of polynomials for specific variable instances.
  • Identified four specific values for the first class where completeness is achieved for all polynomials.
  • Characterized the second class under various conditions, providing comprehensive forms.
  • Demonstrated the conditions necessary for completeness in both classes.

Abstract

In this paper, we investigate two classes of complete permutation polynomials over finite fields Formula: see text. The first class of complete permutation polynomial is of the form Formula: see text. In this class, for a fixed Formula: see text, we find four values of Formula: see text Formula: see text for which Formula: see text is a complete permutation polynomial over Formula: see text for every polynomial Formula: see text. The second class of complete permutation polynomial is of the form Formula: see text. We characterize this class for several specific values of Formula: see text and Formula: see text.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Singh et al. (2026) studied this question.

synapsesocial.com/papers/6a16898b0c924ddd1bd58380https://doi.org/10.1142/s0129054126500152
Ask AI
Helpful
Bookmark
Share
View Full Paper