pith. sign in

arxiv: 0707.1552 · v2 · pith:OFK6BAP6new · submitted 2007-07-11 · 🧮 math.AG · math.NT

Polynomials with a common composite

classification 🧮 math.AG math.NT
keywords characteristicintersectionpolynomialsalgorithmsarbitrarycommoncompletelycomposite
0
0 comments X
read the original abstract

Let f and g be nonconstant polynomials over an arbitrary field K. In this paper we study the intersection of the polynomial rings K[f] and K[g], and in particular we ask whether this intersection is larger than K. We completely resolve this question when K has characteristic zero, and in positive characteristic we present various results, examples, and algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.