Characterizing congruence preserving functions $Z/nZ\to Z/mZ$ via rational polynomials
Patrick Cegielski, Serge Grigorieff, Irene Guessarian

TL;DR
This paper introduces a basis of rational polynomial-like functions for the set of functions from Z/nZ to Z/mZ and characterizes the subset of congruence preserving functions using linear combinations of these basis functions.
Contribution
It provides a novel basis for functions between modular rings and characterizes congruence preserving functions explicitly in terms of this basis.
Findings
The basis consists of functions P_0,...,P_{n-1} for functions Z/nZ to Z/mZ.
Congruence preserving functions are linear combinations of lcm(k)*P_k.
When n ≥ m, the number of congruence preserving functions is independent of n.
Abstract
We introduce a basis of rational polynomial-like functions for the free module of functions . We then characterize the subfamily of congruence preserving functions as the set of linear combinations of the functions where is the least common multiple of (viewed in ). As a consequence, when , the number of such functions is independent of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Advanced Algebra and Logic
