4 research outputs found
Arithmetical Congruence Preservation: from Finite to Infinite
Various problems on integers lead to the class of congruence preserving
functions on rings, i.e. functions verifying divides for all
. We characterized these classes of functions in terms of sums of rational
polynomials (taking only integral values) and the function giving the least
common multiple of . The tool used to obtain these
characterizations is "lifting": if is a surjective morphism,
and a function on a lifting of is a function on such that
. In this paper we relate the finite and infinite notions
by proving that the finite case can be lifted to the infinite one. For -adic
and profinite integers we get similar characterizations via lifting. We also
prove that lattices of recognizable subsets of are stable under inverse
image by congruence preserving functions
Integral Difference Ratio Functions on Integers
number theoryInternational audienceTo Jozef, on his 80th birthday, with our gratitude for sharing with us his prophetic vision of Informatique Abstract. Various problems lead to the same class of functions from integers to integers: functions having integral difference ratio, i.e. verifying f (a) â f (b) ⥠0 (mod (a â b)) for all a > b. In this paper we characterize this class of functions from Z to Z via their a la Newton series expansions on a suitably chosen basis of polynomials (with rational coefficients). We also exhibit an example of such a function which is not polynomial but Bessel like
On Lattices of Regular Sets of Natural Integers Closed under Decrementation, Submitted, 2013. Preprint version on arXiv
We consider lattices of regular sets of non negative integers, i.e. of sets definable in Presbuger arithmetic. We prove that if such a lattice is closed under decrement then it is also closed under many other functions: quotients by an integer, roots, etc. Keywords. Lattices, lattices of subsets of N, regular subsets of N, closure properties