Resultants and height bounds for zeros of homogeneous polynomial systems
In 1955, Cassels proved a now celebrated theorem giving a search bound algorithm for determining whether a quadratic form has a nontrivial zero over the rationals. Since then, his work has been greatly generalized, but most of these newer techniques do not follow his original method of proof. In thi...
Main Author: | Rauh, Nikolas Marcel |
---|---|
Format: | Others |
Language: | en_US |
Published: |
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/2152/20950 |
Similar Items
-
Bound conditions on n- polynomials whose coefficients, roots and critical points are integers
by: Aniruth Phon-On, et al.
Published: (2021-04-01) -
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
by: A.S. Baliuk, et al.
Published: (2017-12-01) -
Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials
by: A. Baliuk, et al.
Published: (2016-06-01) -
Estimating the Quadratic Form <i>x</i><sup>T</sup><i>A</i><sup>−m</sup><i>x</i> for Symmetric Matrices: Further Progress and Numerical Computations
by: Marilena Mitrouli, et al.
Published: (2021-06-01) -
On Homogeneous Combinations of Linear Recurrence Sequences
by: Marie Hubálovská, et al.
Published: (2020-12-01)