Showing papers on "Generic polynomial published in 2017"

One Level Density for Cubic Galois Number Fields

Abstract: Katz and Sarnak predicted that the one level density of the zeros of a family of $L$-functions would fall into one of five categories. In this paper, we show that the one level density for $L$-functions attached to cubic Galois number fields falls into the category associated with unitary matrices.

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.

Galois groups over rational function fields and explicit Hilbert irreducibility

Abstract: Let $P\in\mathbb Q[t,x]$ be a polynomial in two variables with rational coefficients, and let $G$ be the Galois group of $P$ over the field $\mathbb Q(t)$. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $c$ the specialized polynomial $P(c,x)$ has Galois group isomorphic to $G$ and factors in the same way as $P$. In this paper we discuss methods for computing the group $G$ and obtaining an explicit description of the exceptional numbers $c$, i.e., those for which $P(c,x)$ has Galois group different from $G$ or factors differently from $P$. To illustrate the methods we determine the exceptional specializations of three sample polynomials. In addition, we apply our techniques to prove a new result in arithmetic dynamics.

Bounded Limit Cycles of Polynomial Foliations of \(\mathbb {C}^{2}\)

Abstract: In this article we prove in a new way that a generic polynomial vector field in \(\mathbb {C}^{2}\) possesses countably many homologically independent limit cycles. The new proof needs no estimates on integrals, provides thinner exceptional set for quadratic vector fields, and provides limit cycles that stay in a bounded domain.

Computing Galois groups of Eisenstein polynomials over p-adic fields

Abstract: The most efficient algorithms for computing Galois groups of polynomials over global fields are based on Stauduhar’s relative resolvent method. These methods are not directly generalizable to the local field case, since they require a field that contains the global field in which all roots of the polynomial can be approximated. We present splitting field-independent methods for computing the Galois group of an Eisenstein polynomial over a p-adic field. Our approach is to combine information from different disciplines. We primarily, make use of the ramification polygon of the polynomial, which is the Newton polygon of a related polynomial. This allows us to quickly calculate several invariants that serve to reduce the number of possible Galois groups. Algorithms by Greve and Pauli very efficiently return the Galois group of polynomials where the ramification polygon consists of one segment as well as information about the subfields of the stem field. Second, we look at the factorization of linear absolute resolvents to further narrow the pool of possible groups.

On the multiplicity of isolated roots of sparse polynomial systems

Abstract: We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of the corresponding generic system and prove formulas for its multiplicity. Then, we apply these formulas to solve the problem in the general case, by showing that the multiplicity of an arbitrary affine isolated zero of a generic system with given supports equals the multiplicity of the origin as a common zero of a generic system with an associated family of supports. The formulas obtained are in the spirit of the classical Bernstein's theorem, in the sense that they depend on the combinatorial structure of the system, namely, geometric numerical invariants associated to the supports, such as mixed volumes of convex sets and, alternatively, mixed integrals of convex functions.

Multiplication and Division over Extended Galois Field GF(p^q): A new Approach to find Monic Irreducible Polynomials over any Galois Field GF(p^q).

Abstract: Irreducible Polynomials (IPs) have been of utmost importance in generation of substitution boxes in modern cryptographic ciphers. In this paper an algorithm entitled Composite Algorithm using both multiplication and division over Galois fields have been demonstrated to generate all monic IPs over extended Galois Field GF(p^q) for large value of both p and q. A little more efficient Algorithm entitled Multiplication Algorithm and more too Division Algorithm have been illustrated in this Paper with Algorithms to find all Monic IPs over extended Galois Field GF(p^q) for large value of both p and q. Time Complexity Analysis of three algorithms with comparison to Rabin’s Algorithms has also been exonerated in this Research Article.

Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q).

Abstract: Searching for Monic Irreducible Polynomials (IPs) over extended Galois Field GF(p q ) for large value of prime moduli p and extension to Galois Field q is a well needed solution in the field of Cryptography. In this paper a new algorithm to obtain Monic IPs over extended Galois Fields GF(p q ) for large value of p and q has been introduced. The algorithm has been based on Multiplication algorithm over Galois Field GF(p q ).Time complexity analysis of the said algorithm has also been executed that ensures the algorithm to be less time consuming.

Generic Newton polygon for exponential sums in $n$ variables with parallelotope base

Abstract: Let $p$ be a prime number. Every $n$-variable polynomial $f(\underline x)$ over a finite field of characteristic $p$ defines an Artin--Schreier--Witt tower of varieties whose Galois group is isomorphic to $\mathbb{Z}_p$. Our goal of this paper is to study the Newton polygon of the $L$-function associated to a finite character of $\mathbb{Z}_p$ and a generic polynomial whose convex hull is an $n$-dimensional paralleltope $\Delta$. We denote this polygon by $\mathrm{GNP}(\Delta)$. We prove a lower bound of $\mathrm{GNP}(\Delta)$, which is called the improved Hodge polygon $\mathrm{IHP}(\Delta)$. We show that $\mathrm{IHP}(\Delta)$ lies above the usual Hodge polygon $\mathrm{HP}(\Delta)$ at certain infinitely many points, and when $p$ is larger than a fixed number determined by $\Delta$, it coincides with $\mathrm{GNP}(\Delta)$ at these points. As a corollary, we roughly determine the distribution of the slopes of $\mathrm{GNP}(\Delta)$.