An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) (Q2258082)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) |
scientific article |
Statements
An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\) (English)
0 references
2 March 2015
0 references
The authors provide a linear time algorithm which decides whether a function \(\mathbb{Z}_{p^n}\to\mathbb{Z}_{p^n}\) (with \(p\) prime and \(n\in\mathbb{N}\)) can be represented as a polynomial and, if so, it finds the corresponding polynomial. The characterization is also extended to multivariate functions.
0 references
finite rings
0 references
polynomials
0 references
functions
0 references
Taylor series
0 references
