Generic polynomial

About: Generic polynomial is a research topic. Over the lifetime, 608 publications have been published within this topic receiving 6784 citations.

P-schemes and Deterministic Polynomial Factoring Over Finite Fields

Abstract: We introduce a family of mathematical objects called P-schemes, where P is a poset of subgroups of a finite group G. A P-scheme is a collection of partitions of the right coset spaces H\G, indexed by H∈P, that satisfies a list of axioms. These objects generalize the classical notion of association schemes [BI84] as well as the notion of m-schemes [IKS09]. Based on P-schemes, we develop a unifying framework for the problem of deterministic factoring of univariate polynomials over finite field under the generalized Riemann hypothesis (GRH). More specifically, our results include the following: We show an equivalence between m-scheme as introduced in [IKS09] and P-schemes in the special setting that G is an multiply transitive permutation group and P is a poset of pointwise stabilizers, and therefore realize the theory of m-schemes as part of the richer theory of P-schemes. We give a generic deterministic algorithm that computes the factorization of the input polynomial ƒ(X) ∈ Fq[X] given a "lifted polynomial" ƒ~(X) of ƒ(X) and a collection F of "effectively constructible" subfields of the splitting field of ƒ~(X) over a certain base field. It is routine to compute ƒ~(X) from ƒ(X) by lifting the coefficients of ƒ(X) to a number ring. The algorithm then successfully factorizes ƒ(X) under GRH in time polynomial in the size of ƒ~(X) and F, provided that a certain condition concerning P-schemes is satisfied, for P being the poset of subgroups of the Galois group G of ƒ~(X) defined by F via the Galois correspondence. By considering various choices of G, P and verifying the condition, we are able to derive the main results of known (GRH-based) deterministic factoring algorithms [Hua91a; Hua91b; Ron88; Ron92; Evd92; Evd94; IKS09] from our generic algorithm in a uniform way. We investigate the schemes conjecture in [IKS09] and formulate analogous conjectures associated with various families of permutation groups, each of which has applications on deterministic polynomial factoring. Using a technique called induction of P-schemes, we establish reductions among these conjectures and show that they form a hierarchy of relaxations of the original schemes conjecture. We connect the complexity of deterministic polynomial factoring with the complexity of the Galois group G of ƒ~(X). Specifically, using techniques from permutation group theory, we obtain a (GRH-based) deterministic factoring algorithm whose running time is bounded in terms of the noncyclic composition factors of G. In particular, this algorithm runs in polynomial time if G is in Γk for some k=2O(√(log n), where Γk denotes the family of finite groups whose noncyclic composition factors are all isomorphic of subgroups of the symmetric group of degree k. Previously, polynomial-time algorithms for Γk were known only for bounded k. We discuss various aspects of the theory of P-schemes, including techniques of constructing new P-schemes from old ones, P-schemes for symmetric groups and linear groups, orbit P-schemes, etc. For the closely related theory of m-schemes, we provide explicit constructions of strongly antisymmetric homogeneous m-schemes for m≤3. We also show that all antisymmetric homogeneous orbit 3-schemes have a matching for m≥3, improving a result in [IKS09] that confirms the same statement for m≥4. In summary, our framework reduces the algorithmic problem of deterministic polynomial factoring over finite fields to a combinatorial problem concerning P-schemes, allowing us to not only recover most of the known results but also discover new ones. We believe progress in understanding P-schemes associated with various families of permutation groups will shed some light on the ultimate goal of solving deterministic polynomial factoring over finite fields in polynomial time.

Higher congruence companion forms

Abstract: For a rational prime $p \geq 3$ we consider $p$-ordinary, Hilbert modular newforms $f$ of weight $k\geq 2$ with associated $p$-adic Galois representations $\rho_f$ and $\mod{p^n}$ reductions $\rho_{f,n}$. Under suitable hypotheses on the size of the image, we use deformation theory and modularity lifting to show that if the restrictions of $\rho_{f,n} $ to decomposition groups above $p$ split then $f$ has a companion form $g$ modulo $p^n$ (in the sense that $\rho_{f,n}\sim \rho_{g,n}\otimes\chi^{k-1}$).

On Algebraic Solutions of Linear Differential Equations with Primitive Unimodular Galois Group

Abstract: The known algorithms for computing a liouvillian solution of an ordinary homogeneous linear differential equation L(y) = 0 use the fact that, if there is a liouvillian solution, then there is a solution z whose logarithmic derivative z"/z is algebraic over the field of coefficients. Their result is a minimal polynomial for z"/z. In this paper we show that, if there is no logarithmic derivative of a solution of small algebraic degree, then the solution z itself must be algebraic and the algebraic degree of z can be bounded. This can be used to improve algorithms computing liouvillian solutions and allows a direct computation of the minimal polynomial Q(ϑ) of z. In order to improve the computation of the minimal polynomial Q(ϑ), we get a criterion, in terms of the differential Galois group, from which the sparsity of Q(ϑ) can be derived.

Groups of order 16 as galois groups over the 2-adic numbers

Abstract: Let K be a Galois extension of the 2-adic numbers Q2 of degree 16 and let G be the Galois group of K/Q2. We show that G can be determined by the Galois groups of the octic subfields of K. We also show that all 14 groups of order 16 occur as the Galois group of some Galois extension K/Q2 except for E16, the elementary abelian group of order 2 4 . For the other 13 groups G, we give a degree 16 polynomial f(x) such that the Galois group of f over Q2 is G.