Generating integer polynomials from X² and X³ using function composition: A study of subnearrings of (z[x];+; ◦)

Abstract

Which integer polynomials can we write down if the only exponent to be used is 3? Such problems can be considered as instances of the subnearring generation problem. We show that the nearring (Z[x];+; ◦) of integer polynomials, where the nearring multiplication is the composition of polynomials, has uncountably many subnearrings, and we give an explicit description of those nearrings that are generated by subsets of {1; x; x²; x³}.

Key words: Nearrings, integer polynomials, subnearring membership problem.