We study a representation for polynomial functions over finite rings. This factorial representation is particularly useful for fast interpolation, and we show that it is computationally preferable to the Lagrange Interpolation Formula (LIF) and to Newton interpolation over finite fields and rings. Moreover, over arbitrary finite rings the calculation of the factorial representation aborts naturally when a given mapping does not arise as a polynomial function.
|Original language||English (US)|
|Number of pages||10|
|Journal||American Mathematical Monthly|
|State||Published - Jan 1 2016|
All Science Journal Classification (ASJC) codes