Kronecker Conjugacy of Polynomials
نویسنده
چکیده
Let f, g ∈ Z[X] be non-constant polynomials with integral coefficients. In 1968 H. Davenport raised the question as to when the value sets f(Z) and g(Z) are the same modulo all but finitely many primes. The main progress until now is M. Fried’s result that f and g then differ by a linear substitution, provided that f is functionally indecomposable. We extend this result to polynomials f of composition length 2. Also, we study the analog when Z is replaced by the integers of a number field. The above number theoretic property translates to an equivalent property of subgroups of a finite group, known as Kronecker conjugacy, a weakening of conjugacy which has been studied by various authors under different assumptions and in other contexts. We also give a simplified and strengthened version of the Galois theoretic translation to finite groups.
منابع مشابه
An Infinite Series of Kronecker Conjugate Polynomials
Let K be a field of characteristic 0, t a transcendental over K, and Γ be the absolute Galois group of K(t). Then two non-constant polynomials f, g ∈ K[X] are said to be Kronecker conjugate if an element of Γ fixes a root of f(X) − t if and only if it fixes a root of g(X) − t. If K is a number field, and f, g ∈ OK [X] where OK is the ring of integers of K, then f and g are Kronecker conjugate i...
متن کاملCharacter Polynomials, their q-Analogs and the Kronecker Product
Dedicated to Anders Björner on the occasion of his sixtieth birthday. Abstract The numerical calculation of character values as well as Kronecker coefficients can efficently be carried out by means of character polynomi-als. Yet these polynomials do not seem to have been given a proper role in present day literature or software. To show their remarkable simplicity we give here an " umbral " ver...
متن کاملFaster polynomial multiplication via multipoint Kronecker substitution
We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderately sized input polynomials, the new algorithms improve on the performance of the standard Kronecker substitution by a sizeable constant, both in theory and in empirical tests.
متن کاملStructured Backward Error Analysis of Linearized Structured Polynomial Eigenvalue Problems
We start by introducing a new class of structured matrix polynomials, namely, the class of MA-structured matrix polynomials, to provide a common framework for many classes of structured matrix polynomials that are important in applications: the classes of (skew-)symmetric, (anti-)palindromic, and alternating matrix polynomials. Then, we introduce the families of MAstructured strong block minima...
متن کاملSimultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform several modular operations with machine integer or floating point arithmetic. The modular polynomials are converted into integers using Kronecker substitution (evaluation at a sufficiently large integer). With some control ...
متن کامل