Congruence preserving functions in the residue class rings of polynomials over finite fields

2018/07/06 by Xiumei Li, Min Sha, Li, Xiumei +1
Computer Science · Engineering · #Coding theory and cryptography #FOS: Mathematics #Graph Labeling and Dimension Problems #Number Theory (math.NT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1807.02379

openalex publication_date 2018/07/06 · openalex created_date 2018/07/19 · openalex updated_date 2026/07/28

Abstract

In this paper, as an analogue of the integer case, we define congruence preserving functions over the residue class rings of polynomials over finite fields. We establish a counting formula for such congruence preserving functions, determine a necessary and sufficient condition under which all congruence preserving functions are also polynomial functions, and characterize such functions.

Related

• Arithmetical Congruence Preservation: from Finite to Infinite
• Characterizing Congruence Preserving Functions Z/nZ → Z/mZ Via Rational Polynomials
• Classification of Rings which admits some special type of Polynomial functions
• Counting irreducible polynomials with prescribed coefficients over a finite field
• Value sets of non-permutation polynomials over the residue class rings of integers