Title

Polynomially Inexpressible Functions on Rings

Abstract

Let R be a ring, and let f be a function from R to R We say that f is polynomially expressible provided that there is a permutation g on the underlying set of R such that the composite function h = g-1ofog is a polynomial function on the ring R.

Department(s)

Mathematics and Statistics

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2013 Missouri University of Science and Technology, All rights reserved.


Share

 
COinS