Polynomial functions over finite commutative rings
Let \(R\) be a finite, commutative, unital ring. A polynomial \(p\in R[x]\) naturally induces a function \(p_f:R\rightarrow R\) by substitution. A function \(f:R\rightarrow R\) is a polynomial function if there exists a polynomial \(p_f\in R[x]\) such that \(p_f(r) = f(r)\) for every \(r\in R\). A ring is local if it has a unique maximal ideal. As is well known every finite commutative, unital ring is a direct sum of local rings. So it is enough to consider finite, commutative, unital, local rings. The Authors of this paper gave a necessary and sufficient condition for a function being a polynomial function over a finite, commutative, unital ring. Furthermore, they gave an algorithm running in quasilinear time that determines whether or not a function given by its function table can be represented by a polynomial, and if the answer is yes then it provides one such polynomial.
- Polynomial functions in n indeterminates over a finite commutative ring
- On polynomial functions over finite commutative rings
- Functions and polynomials over finite commutative rings
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- On polynomial functions from \(\mathbb{Z}_{n_ 1}\times \mathbb{Z}_{n_ 2}\times \cdots \times \mathbb{Z}_{n_ r}\) to \(\mathbb{Z}_ m\)
- A faster algorithm for testing polynomial representability of functions over finite integer rings
- An algorithmic characterization of polynomial functions over \(\mathbb Z_{p^n}\)
- Asymptotically Fast Triangularization of Matrices over Rings
- Functions and polynomials ($mod p^n$)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 3286953 (Why is no real title available?)
- scientific article; zbMATH DE number 3392667 (Why is no real title available?)
- On polynomial functions over finite commutative rings
- On the structure of finite rings. II
- Polynomial Interpolation Over Commutative Rings
- Polynomial functions as splines
- Polynomial functions on rings of dual numbers over residue class rings of the integers
- A faster algorithm for testing polynomial representability of functions over finite integer rings
- On polynomial functions over finite commutative rings
- On the number counting of polynomial functions
- Polynomials inducing the zero function on chain rings
- Commuting polynomial vectors over an integral domain
- Polynomial functions in n indeterminates over a finite commutative ring
- Polynomial-time locality tests for finite rings
- scientific article; zbMATH DE number 1532174 (Why is no real title available?)
- Fast and simple modular interpolation using factorial representation
- scientific article; zbMATH DE number 2124089 (Why is no real title available?)
- On the two definitions of degree of a function over an associative, commutative ring
- Functions and polynomials over finite commutative rings
- Polynomial functions and permutation polynomials over some finite commutative rings
- Polyfunctions over commutative rings
- On the rank decoding problem over finite principal ideal rings
- Solving systems of algebraic equations over finite commutative rings and applications
- Low-rank parity-check codes over finite commutative rings
This page was built for publication: Polynomial functions over finite commutative rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1676365)
