## Abstract

We define the concept of a polynomial function from Z_{n} to Z_{m}, which is a generalization of the well-known polynomial function from Z_{n} to Z_{m}. We obtain a necessary and sufficient condition on n and m for all functions from Z_{n} to Z_{m} to be polynomial functions. Then we present canonical representations and the counting formula for the polynomial functions from Z_{n} to Z_{m}. Further, we give an answer to the following problem: How to determine whether a given function from Z_{n} to Z_{m} is a polynomial function, and how to obtain a polynomial to represent a polynomial function?

Original language | English (US) |
---|---|

Pages (from-to) | 137-145 |

Number of pages | 9 |

Journal | Discrete Mathematics |

Volume | 137 |

Issue number | 1-3 |

DOIs | |

State | Published - Jan 20 1995 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Discrete Mathematics and Combinatorics

## Fingerprint

Dive into the research topics of 'On polynomial functions from Z_{n}to Z

_{m}'. Together they form a unique fingerprint.