Skip to content

Arithmetical congruence preservation: From finite to infinite

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text
This PDF is freely available from an open access repository. It may not have been peer-reviewed.

Abstract

Various problems on integers lead to the class of functions defined on a ring of numbers (or a subset of such a ring) and verifying a−b divides f(a)−f(b) for all a, b.We say that such functions are “congruence preserving”. In previous works, we characterized these classes of functions for the cases ℕ → ℤ, ℤ → ℤ and ℤ/nℤ → ℤ/mℤ in terms of sums series of rational polynomials (taking only integral values) and the function giving the least common multiple of 1, 2,..., k. In this paper we relate the finite and infinite cases via a notion of “lifting”: if π: X → Y is a surjective morphism and f is a function Y → Y a lifting of f is a function F: X → X such that π ◦ F = f ◦ π. We prove that the finite case ℤ/nℤ → ℤ/nℤ can be so lifted to the infinite cases ℕ → ℕ and ℤ → ℤ. We also use such liftings to extend the characterization to the rings of p-adic and profinite integers, using Mahler representation of continuous functions on these rings.

Cite

CITATION STYLE

APA

Cégielski, P., Grigorieff, S., & Guessarian, I. (2015). Arithmetical congruence preservation: From finite to infinite. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9300, pp. 210–225). Springer Verlag. https://doi.org/10.1007/978-3-319-23534-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free