Square-free polynomial

About: Square-free polynomial is a research topic. Over the lifetime, 1762 publications have been published within this topic receiving 32328 citations.

Factoring Polynomials with Rational Coefficients

Abstract: In this paper we present a polynomial-time algorithm to solve the following problem: given a non-zero polynomial fe Q(X) in one variable with rational coefficients, find the decomposition of f into irreducible factors in Q(X). It is well known that this is equivalent to factoring primitive polynomials feZ(X) into irreducible factors in Z(X). Here we call f~ Z(X) primitive if the greatest common divisor of its coefficients (the content of f) is 1. Our algorithm performs well in practice, cf. (8). Its running time, measured in bit operations, is O(nl2+n9(log(fD3).

Hypergeometric Orthogonal Polynomials and Their q-Analogues

Abstract: Definitions and Miscellaneous Formulas- Classical orthogonal polynomials- Orthogonal Polynomial Solutions of Differential Equations- Orthogonal Polynomial Solutions of Real Difference Equations- Orthogonal Polynomial Solutions of Complex Difference Equations- Orthogonal Polynomial Solutions in x(x+u) of Real Difference Equations- Orthogonal Polynomial Solutions in z(z+u) of Complex Difference Equations- Hypergeometric Orthogonal Polynomials- Polynomial Solutions of Eigenvalue Problems- Classical q-orthogonal polynomials- Orthogonal Polynomial Solutions of q-Difference Equations- Orthogonal Polynomial Solutions in q?x of q-Difference Equations- Orthogonal Polynomial Solutions in q?x+uqx of Real

Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities

Abstract: We show how to find sufficiently small integer solutions to a polynomial in a single variable modulo N, and to a polynomial in two variables over the integers. The methods sometimes extend to more variables. As applications: RSA encryption with exponent 3 is vulnerable if the opponent knows two-thirds of the message, or if two messages agree over eight-ninths of their length; and we can find the factors of N=PQ if we are given the high order $\frac{1}{4} \log_2 N$ bits of P.

Solving Zero-Dimensional Systems Through the Rational Univariate Representation

Abstract: This paper is devoted to the resolution of zero-dimensional systems in K[X 1, …X n ], where K is a field of characteristic zero (or strictly positive under some conditions). We follow the definition used in MMM95 and basically due to Kronecker for solving zero-dimensional systems: A system is solved if each root is represented in such way as to allow the performance of any arithmetical operations over the arithmetical expressions of its coordinates. We propose new definitions for solving zero-dimensional systems in this sense by introducing the Univariate Representation of their roots. We show by this way that the solutions of any zero-dimensional system of polynomials can be expressed through a special kind of univariate representation (Rational Univariate Representation): where (f,g,g 1, …,g n ) are polynomials of K[X 1, …, X n ]. A special feature of our Rational Univariate Representation is that we dont loose geometrical information contained in the initial system. Moreover we propose different efficient algorithms for the computation of the Rational Univariate Representation, and we make a comparison with standard known tools.