Algorithm for Finding a Biquadratic
نویسنده
چکیده
Let p ≡ 1 (mod 4) be a prime number and let ζ = e be a primitive root of unity. Then there exists a unique biquadratic extension eld Q(y)/Q that is a sub eld of Q(ζ). The aim of this work is to construct an algorithm for nding such y explicitly. Finally we state a general conjecture about the y we found.
منابع مشابه
On integral points on biquadratic curves and near multiples of squares in Lucas sequences
We describe an algorithmic reduction of the search for integral points on a curve y2 = ax4 + bx2 + c with ac(b2 − 4ac) 6= 0 to solving a finite number of Thue equations. While existence of such reduction is anticipated from arguments of algebraic number theory, our algorithm is elementary and to best of our knowledge is the first published algorithm of this kind. In combination with other metho...
متن کاملHeuristics for Biquadratic Assignment Problems and Their Computational Comparison Heuristics for Biquadratic Assignment Problems and Their Computational Comparison
The biquadratic assignment problem (BiQAP) is a generalization of the quadratic assignment problem (QAP). As for any hard optimization problem also for BiQAP, a reasonable eeort to cope with the problem is trying to derive heuristics which solve it suboptimally and which, possibly, yield a good trade oo between the solution quality and the time and memory requirements. In this paper we describe...
متن کاملConversion of Dupin Cyclide Patches into Rational Biquadratic Bézier Form
This paper uses the symmetry properties of circles and Bernstein polynomials to establish a series of interesting barycentric properties of rational biquadratic Bézier patches. A robust algorithm is presented, based on these properties, for the conversion of Dupin cyclide patches into Bézier form. A set of conversion examples illustrates the use of this algorithm.
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملConversion of biquadratic rational Bézier surfaces into patches of particular Dupin cyclides: the torus and the double sphere
Toruses and double spheres are particular cases of Dupin cyclides. In this paper, we study the conversion of rational biquadratic Bézier surfaces into Dupin cyclide patches. We give the conditions that the Bézier surface should satisfy to be convertible, and present a new conversion algorithm to construct the torus or double sphere patch corresponding to a given Bézier surface, some conversion ...
متن کامل