On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\) (Q1343780)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 719455
Language Label Description Also known as
default for all languages
No label defined
    English
    On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\)
    scientific article; zbMATH DE number 719455

      Statements

      On polynomial functions from \(\mathbb{Z}_ n\) to \(\mathbb{Z}_ m\) (English)
      0 references
      0 references
      12 November 1996
      0 references
      Let \(\mathbb{Z}_n\) denote the ring of residues modulo \(n\). The author calls a function \(f: \mathbb{Z}_n\to \mathbb{Z}_m\) a polynomial function if there is a polynomial \(F\in \mathbb{Z} [x ]\) such that \(f(j) \equiv F(j) \pmod m\) for \(j=1, \dots, m-1\). (It should be observed that a different choice of representatives for \(\mathbb{Z}_n\) would lead to a different class.) With \(\lambda\) being the smallest integer such that \(m|\lambda!\) and \(\mu= \min(n, \lambda)\), he proves that these functions have a unique representation in the form \(\sum^{ \mu-1 }_{ k=0} a_k x^k \pmod m\) with \(0\leq a_k< m/ (m,k!)\). The total number of polynomial functions is determined and criteria are given for a function to be polynomial. It is shown that those pairs \((m,n)\) for which all functions are polynomial are exactly those for which \(n\) is not greater than the least prime factor of \(m\).
      0 references
      residue classes
      0 references
      polynomial functions
      0 references
      0 references

      Identifiers