Displaying similar documents to “Comments on the height reducing property”

Algebraic condition for decomposition of large-scale linear dynamic systems

Henryk Górecki (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

The paper concerns the problem of decomposition of a large-scale linear dynamic system into two subsystems. An equivalent problem is to split the characteristic polynomial of the original system into two polynomials of lower degrees. Conditions are found concerning the coefficients of the original polynomial which must be fulfilled for its factorization. It is proved that knowledge of only one of the symmetric functions of those polynomials of lower degrees is sufficient for factorization...

On Roots of Polynomials and Algebraically Closed Fields

Christoph Schwarzweller (2017)

Formalized Mathematics

Similarity:

In this article we further extend the algebraic theory of polynomial rings in Mizar [1, 2, 3]. We deal with roots and multiple roots of polynomials and show that both the real numbers and finite domains are not algebraically closed [5, 7]. We also prove the identity theorem for polynomials and that the number of multiple roots is bounded by the polynomial’s degree [4, 6].

Solving quadratic equations over polynomial rings of characteristic two.

Jorgen Cherly, Luis Gallardo, Leonid Vaserstein, Ethel Wheland (1998)

Publicacions Matemàtiques

Similarity:

We are concerned with solving polynomial equations over rings. More precisely, given a commutative domain A with 1 and a polynomial equation antn + ...+ a0 = 0 with coefficients ai in A, our problem is to find its roots in A. We show that when A = B[x] is a polynomial ring, our problem can be reduced to solving a finite sequence of polynomial equations over B. As an application of this reduction,...

Zhang-Zagier heights of perturbed polynomials

Christophe Doche (2001)

Journal de théorie des nombres de Bordeaux

Similarity:

In a previous article we studied the spectrum of the Zhang-Zagier height [2]. The progress we made stood on an algorithm that produced polynomials with a small height. In this paper we describe a new algorithm that provides even smaller heights. It allows us to find a limit point less than 1 . 289735 i.e. better than the previous one, namely 1 . 2916674 . After some definitions we detail the principle of the algorithm, the results it gives and the construction that leads to this new limit point. ...