ON IRREDUCIBILITY OF COMPOSITION POLYNOMIALS
Main Article Content
Abstract
We investigate the irreducibility of iterate and composite polynomials. For this purpose discriminant and resultant are computed by means of the norm function.
This article was migrated from the previous system via automation. The abstract may not be written correctly. Please view the PDF file.
Article Details
Issue
Section
Articles