Abstract
In this paper we consider polynomial representability of functions defined over \({\mathbb{Z}}_{p^{n}}\), where p is a prime and n is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to determine whether a given function over \({\mathbb{Z}}_{p^{n}}\) is polynomially representable or not, and (ii) finds the polynomial if it is polynomially representable. The previous characterizations given by Kempner (Trans. Am. Math. Soc. 22(2):240–266, 1921) and Carlitz (Acta Arith. 9(1), 67–78, 1964) are existential in nature and only lead to an exhaustive search method, i.e. algorithm with complexity exponential in size of the input. Our characterization leads to an algorithm whose running time is linear in size of input. We also extend our result to the multivariate case.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brawley, J., Mullen, G.: Functions and polynomials over Galois rings. J. Number Theory 41(2), 156–166 (1992)
Carlitz, L.: Functions and polynomials (\(\operatorname{mod}\ p^{n} \)). Acta Arith. 9(1), 67–78 (1964)
Carlitz, L.: Functions and correspondences in a finite field. Bull. Am. Math. Soc. 83(2), 139–165 (1977)
Dickson, L.: The analytic representation of substitutions on a power of a prime number of letters with a discussion of the linear group. Ann. Math. 11(1/6), 65–120 (1896)
Hermite, C.: Sur les fonctions de sept lettres. C. R. Math. Acad. Sci. Paris 57, 750–757 (1863)
Kaiser, H., Nöbauer, W.: Permutation polynomials in several variables over residue class rings. J. Aust. Math. Soc. 43(2), 171–175 (1987)
Keller, G., Olson, F.: Counting polynomial functions \(\operatorname{mod}\ p^{n}\). Duke Math. J. 35(4), 835–838 (1968)
Kempner, A.J.: Polynomials and their residue systems. Trans. Am. Math. Soc. 22(2), 240–266 (1921)
Lausch, H., Nöbauer, W.: Algebra of Polynomials vol. 5. North-Holland, Amsterdam (1973)
Lidl, R., Niederreiter, H., Cohn, P.: Finite Fields vol. 20. Cambridge University Press, Cambridge (1997)
Mullen, G., Stevens, H.: Polynomial functions (\(\operatorname{mod}\ m\)). Acta Math. Hung. 44(3), 237–241 (1984)
Zhang, Q.: Polynomial functions and permutation polynomials over some finite commutative rings. J. Number Theory 105(1), 192–202 (2004)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Guha, A., Dukkipati, A. An Algorithmic Characterization of Polynomial Functions over \({\mathbb{Z}}_{p^{n}} \) . Algorithmica 71, 201–218 (2015). https://doi.org/10.1007/s00453-013-9799-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-013-9799-7