WorksMathematics
Cassini ovals, translated polynomials, and the arithmetic of their discriminants and resultants
Abstract
For a polynomial , and , consider the translate . We show that for and every zero of lies on the Cassini oval . We call these translates Cassini polynomials and give their zeros explicitly, prove that the zeros for and strictly interlace on each component of the oval, and evaluate their discriminants and resultants in closed form. We then prove the reduced monic polynomials factor into homogenized cyclotomic polynomials, satisfying for coprime , and have discriminants governed by a Lucas sequence. We then prove a comparison principle: if is even or odd with all zeros in , and , then every zero of satisfies , and the symmetry hypothesis cannot be removed. As an application, every solution of , where is the adjacency matrix of the path on vertices and is a Fibonacci number, satisfies . This disproves, for every , a conjecture of Gullerud, Johnson and Mbirika that the real parts of these solutions are unbounded.
Introduction
Zeros of polynomial sequences
The location of the zeros of a sequence of polynomials is a classical theme joining complex analysis, approximation theory, combinatorics and number theory; see [15, 19, 21]. For orthogonal polynomials the zeros are real and interlace in the interval of orthogonality. For the Chebyshev polynomials and they are explicit and lie in [16, 20]. When the sequence of orthogonal polynomials is perturbed, translated or linearly combined, however, the zeros typically leave the real line and accumulate on curves in the complex plane. Describing these curves remains an active area of study.
One of the key results in this area is the theorem of Beraha, Kahane and Weiss [2, 3]. Suppose satisfies a linear recurrence with polynomial coefficients and a mild non-degeneracy condition. Then the limit points of the zeros are the points where two dominant characteristic roots have equal modulus, together with the isolated points where the coefficient of a unique dominant root vanishes.
Recent developments involve algebraic approaches to seek curves that contain every zero of every member of the polynomial sequence. Much of the recent progress here is due to Khang Tran and his collaborators. Tran [22] proved that if with and , then all zeros of lie on an explicit portion of a real algebraic curve. The proof connects root location with the discriminant of in and with Ismail’s -analogue of the discriminant [9]. The three-term recurrence was treated in [23].
Another approach, closest to this current paper, concerns polynomials whose zeros lie on conics. Dilcher and Stolarsky [5] found polynomials satisfying non-linear recurrences related to Chebyshev polynomials whose zeros lie close to ellipse-like curves. In his thesis, Oyengo [18] showed that for real with , the zeros of the translated Chebyshev polynomials
lie on the ellipse . They are the images of rotated roots of unity under the linear map , and in suitable cases they interlace on the ellipse. The analogous translates of have their zeros close to, and inside, such ellipses. Independently, Kim and Lee [12] proved that the zeros of the difference quotient lie on the ellipse . For the special choice the translating values are Lucas and Fibonacci numbers, since .
One might ask the converse problem; given an algebraic curve in the complex plane, can we find a sequence of real polynomials whose zeros lie on this curve? In his thesis, Oyengo showed that for ellipses, one can derive a sequence of translated Chebyshev polynomials whose zeros lie on the ellipses. The same applies for circles which are special ellipses. In this paper, we show that the same is true for Ovals of Cassini, that certain translations of cyclotomic polynomials have their zeros on ovals of Cassini.
Cassini ovals
Let and . The Cassini oval with foci and product is the locus of points whose distances to the two foci have product :
In Cartesian, polar and complex coordinates it reads
and expanding the first gives the quartic . The curve is symmetric about both axes and meets the real axis at and, when , also at . Its shape is governed by the ratio (Figure 1):

Figure 1. Zeros of (filled circles) and (open squares) for and the indicated values of , on the Cassini ovals . Crosses mark the foci . The zeros are equally spaced in the parameter and interlace on each component (Theorem 3.4). In the lemniscate case is even and , so is a double zero of (Theorem 3.1(c)).
: a single convex oval;
: a single oval with two “dimples” at the imaginary axis (peanut shape);
: the lemniscate of Bernoulli, with a node at the origin;
: two disjoint ovals, one around each focus.
Thus is the level set of the quadratic polynomial , i.e. a polynomial lemniscate of degree two.
G. D. Cassini introduced these curves in the late seventeenth century as candidate planetary orbits competing with Kepler’s ellipses [8, 11]. They have since found many applications in Physics, Mathematics Engineering and even in Medicine. For more on other properties of ovals of Cassini, refer to [11, 13].
Translated polynomials and the Cassini polynomials
We ask a general question; Let be a real polynomial with real zeros and for , define the operator as
When do the zeros of lie on, or are controlled by, a single curve depending only on parameters ? For Chebyshev polynomials, the curve is an ellipse when . In this paper, we show that for the family , the curve is a Cassini oval when . We call the resulting translates Cassini polynomials, and in this paper, we study their geometry, arithmetic of their discriminants and their resultants. The Cassini oval then turns out to control the translates of every symmetric real-rooted polynomial with zeros in . In particular it controls the Chebyshev, Legendre and Gegenbauer translates, including those arising from path graphs.
Throughout, and with , with , . Define the monic polynomials and as
so that the and are explicitly given by
Note that if then and . Our main results are as follows.
Theorem A (Geometry; Theorems 3.1, 3.4). For every the zeros of and lie on and are explicitly given by
respectively. They are simple unless (resp. ), in which case is the only multiple zero and it is double. If the zeros of and strictly interlace on each component of .
Theorem B (Arithmetic; Theorems 5.1, 5.5, 5.7, 5.8). With and identities for resultants and discriminants are given by
If are coprime with , then for every , except , there is a prime dividing but no with .
Theorem C (Comparison principle; Theorem 4.1, Corollary 4.5). Let be a non-constant polynomial with all zeros in and , let with and . Every zero of with lies in . Every zero of , and lies outside the interior of . Without the symmetry hypothesis both statements fail.
Theorem A describes the geometry of the zeros of the and polynomials as lying and dense on the ovals of Cassini. The Cassini oval is precisely curve predicted by Tran’s discriminant criterion; see Remarks 3.6 and 3.7. What is special here is that the whole zero set, not just its limit, lies on the curve. Theorem B is the arithmetic counterpart for the polynomials. The resultant formula is a Cassini analogue of Apostol’s cyclotomic resultants and of the Chebyshev resultants of [10, 14]. The discriminant contains a Lucas sequence, which brings in primitive divisors. Theorem C proves the Oyengo’s earlier conjecture for symmetric polynomials and shows by example that it fails in general.
In section 2, we present some well known results about resultants, discriminants and the Cassini region. In section 3, we prove results leading to Theorem A. In section 4, we prove the comparison principle and some of its applications. We conclude this paper in section 5 with identities for discriminants and resultants involving the Cassini polynomials.
Preliminaries
Resultants and discriminants
Let and with . We use the following standard facts; see [6].
We also use the chain rule of McKay and Wang [17]: if has degree and leading coefficient , then
unless is a constant equal to a common root of and .
The next lemma uses McKay and Wang’s chainrule for resultants and computes discriminants of even polynomials. It is the tool we will employ in the calculation of the discriminant formulas in Section 5.
Lemma 2.1. Let be monic of degree , let , and put . Then
Proof. is monic of degree , and . Let be the zeros of . The zeros of are the numbers with . By (5),
Since is monic of even degree, we have that . Also . Finally .
Cyclotomic polynomials
For a positive integer , the -th cyclotomic polynomial is the unique irreducible polynomial with integer coefficients that is a divisor of . Precisely
Let denote the -th cyclotomic polynomial and its homogenization. Then . Put
We need the classical evaluation
and the following observation. If , then permutes the non-trivial -th roots of unity, so
The Cassini region
For let , the compact region bounded by .
Lemma 2.2. Let . For we have and
Both bounds are attained on .
Proof. The first bound follows from . Since is harmonic, its maximum over is attained on the boundary. Write , from we get , where for . The function is concave, and exactly when , i.e. when . If this point lies in and gives . Otherwise the maximum is at and equals .
Polynomials with zeros on Cassini ovals
Recall that , and and for let be the principal square root.
Theorem 3.1. Let , and ().
(a) The zeros of (equivalently of ) are , and the zeros of (equivalently of ) are , for $0\le k\le n-1.
(b) All zeros of and lie on the Cassini oval , .
(c) has simple zeros unless . In that case , is a lemniscate of Bernoulli, and (its node) is a double zero while the others are simple. The same holds for with the condition .
Proof. (a) if and only if , i.e. for some . The case of is the same with replaced by the -th roots of .
(b) For every such zero, .
(c) The values are distinct. Each non-zero value has two distinct square roots, which are simple zeros of . The value occurs if and only if for some , i.e. if and only if , which is equivalent to . It then occurs for exactly one and gives the double zero . Taking absolute values shows that this forces . The argument for the zeros of is identical.
Example 3.2. The operator applied to , gives . Hence the zeros of lie on for every . The polynomial has its zeros on .
For real , the four regimes of § 1.2 become: (convex); (dimpled); (lemniscate); (two ovals). Figure 1 illustrates all four with .
Recall that with . When the oval is naturally parametrized by the angle . In this parameter the zeros of and are equally spaced.
Lemma 3.3. Let with and put .
(a) If , then consists of two Jordan curves and . The map is a homeomorphism .
(b) If , then is a single Jordan curve. There is a continuous with and , and induces a homeomorphism .
Proof. (a) If then , so is continuous with positive real part. It is injective in modulo , because its square is. Its image is the part of in the right half-plane, and does not meet the imaginary axis because .
(b) If , the closed path winds once around and never passes through it. Hence a continuous square root exists along and changes sign after one turn. If , then , so . If is an odd multiple of , then , which is impossible since . Hence is injective on . Its image is all of , since both square roots occur. □
Theorem 3.4. Let and . In the parameterizations of Lemma 3.3, the zeros of correspond to and the zeros of to . Consequently:
(a) if , the zeros of and the zeros of strictly interlace on the single curve ;

Figure 2. All the four curves in one graph.
(b) if , each of carries zeros of and zeros of , and they strictly interlace on it.
Proof. with means . By Theorem 3.1(a) the zeros of correspond to and those of to . These two arithmetic progressions alternate on , and also on its double cover . Homeomorphisms of circles preserve cyclic order, so the claims follow from Lemma 3.3.
Remark 3.5. When (the lemniscate) the same argument applies to each lobe. The zeros of and interlace on each lobe, and one of them may have a double zero at the node (Figure 1). Theorem 3.4 also contains an interlacing statement for a single across different translates. The zeros of for and for interlace, since the second family is for the first.
Remark 3.6. Since with and , the sequence satisfies the recurrence with . Its characteristic roots have equal modulus exactly on . The coefficients never vanish, so Beraha–Kahane–Weiss Theorem [2, 3] identify as the set of limit points of zeros. Theorem 3.1 says much more: every zero of every is on the curve.
Remark 3.7. Let (see Section 5). Then
with and . This is exactly the setting of Tran’s discriminant criterion [22], Theorem 1, which places the zeros of on the curve , . Here with . This quantity is real and lies in if and only if , i.e. exactly on . The -discriminant vanishes only at , which is the common zero of all removed in .
Remark 3.8. The argument of Theorem 3.1 applies verbatim to any non-constant . The zeros of lie on the lemniscate . Cassini ovals are the case . The ellipse results for recalled in § 1 are of a different nature, because is not a power of a fixed polynomial.
A comparison principle and its applications
An outstanding question is to describe the zeros of for real polynomials with zeros in . The initial conjecture is that the zeros are either inside or on the Cassini oval . The next theorem proves this under a symmetry hypothesis. Example 4.3 shows that the hypothesis cannot be removed.
Theorem 4.1. Let be non-constant with all zeros in and . Let .
(i) Let and with . Every zero of satisfies . If equality holds, then , or and .
(ii) Let with and with . Every zero of satisfies .
Proof. Because the zero set of is real, contained in and symmetric about 0 with multiplicities, we can write
Put . Then
(i) Let . Since , formula (13) gives . Suppose , i.e. . For every ,
Taking , and for the factor , we obtain . So is not a zero. If instead , then we do not have a strict inequality in (14). Equality in the triangle inequality for some forces with , i.e. , i.e. . Hence, if is a zero on the oval, then , and all .
(ii) Let . Then . Suppose , i.e. . For every , . Hence , and is not a zero. ∎
Remark 4.2. Geometrically, () is a family of discs that increases with and whose members are all internally tangent at . The largest one, , is the image of under . The proof shows that each factor of is individually dominated. Part (ii) uses the decreasing family , whose members are all tangent at .
Example 4.3. Symmetry is necessary. Take , , . The zeros of are and , and . So lies outside .
Corollary 4.4. Let be any of , , the Legendre polynomial , or a Gegenbauer polynomial with . For and , the zeros of lie in . For the zeros of lie outside the interior of .
Proof. These polynomials have parity and all their zeros in [21]. Apply Theorem 4.1 with . □
For this is consistent with the ellipse theorem of [18]. The ellipse has foci and lies in , touching at .
Corollary 4.5. Let be the characteristic polynomial of the path graph on vertices, and let denote the Fibonacci numbers. For every , every complex solution of satisfies
In particular the real parts of the solutions are bounded independently of . This disproves, for every , the conjecture of [7] that these real parts are unbounded (Conjecture 1.1(2) in the numbering of [4]); the case was obtained in [4].
Proof. It is well known that [7]. From one checks by induction that . Hence with . The substitution turns into . Since has parity and its zeros lie in , Theorem 4.1 with , , and the unimodular constant gives , and . The bounds on and follow from Lemma 2.2 with and . □
Remark 4.6. Numerically the solutions satisfy and and approach the ellipse (Figure 3), as conjectured in [7, 4]. Corollary 4.5 gives the uniform but weaker bounds and . Closing this gap, i.e. proving an ellipse inclusion for the translates with , remains open.
Discriminants and resultants {#sec:5}
Theorem 5.1. For ,
Figure 3. Solutions of for . They lie in the Cassini region for every (Corollary 4.5) and cluster near the ellipse conjectured in [7, 4].
and consequently
Proof. Apply Lemma 2.1 with and . The zeros of are , so and
because . Moreover . This proves (15). For (16) take ; the same computation gives . The formula for and follow from (9) with and respectively. □
The vanishing of (15) is exactly the condition of Theorem 3.1(c). For real it happens only when and is even, i.e. on the lemniscate, when the node is a zero. This fits the geometry.
Proposition 5.2. , and hence .
Proof. , so by (5) . The normalized version follows from (8). □
Every vanishes at , so resultants are identically zero. The natural objects are the reduced polynomials
which are monic of degree . They are Cassini analogues of the Chebyshev difference quotients of Kim and Lee [12]. Their generating function was given in Remark 3.7, so they satisfy
If , then .
Proposition 5.3 (Cyclotomic factorization). For , has the cyclotomic factorization;
and the factor with index has degree in . Its zeros are the points of with .
Proof. Substitute and in and cancel the factor . The description of the zeros follows from Theorem 3.1(a). □
Remark 5.4. The factor with is . Its zeros are points where the oval meets a coordinate axis: the real axis if , the imaginary axis if . For it splits over if and only if for some . This conic has infinitely many integer solutions, e.g. . The ratio then records which regime of §1.2 the oval is in. In general, the factorization of over is a Diophantine question.
Theorem 5.5. For ,
Proof. By (17) and the chain rule (10) with , , , we have . The zeros of are with , . Since is monic,
If , the factor with vanishes. If , the last product equals by (12). □
Remark 5.6. Geometrically, and share a zero if and only if . In that case, by proposition 5.3, they share exactly the zeros of . When and , the resultant is the -th power of the integer . This parallels Apostol’s theorem that unless is a prime power [1], and the Jacobi-symbol formulas for Chebyshev resultants [10, 14].
Theorem 5.7. For ,
Proof. Apply Lemma 2.1 with and . By (17) and (9), . By (11), . Finally
since .
For example, , the discriminant of the quadratic in Remark 5.4.
Primitive prime divisors
Put and . Then is the Lucas sequence attached to the pair . We recall Zsigmondy’s theorem [24]. If are coprime integers and , then has a prime divisor that divides no with (a primitive divisor), except when and is a power of , or . A primitive divisor satisfies , since the order of modulo is exactly .
Theorem 5.8. Let with , and . Then for every with there is a prime such that
Equivalently, modulo two zeros of collide, whereas for the zeros of remain distinct modulo .
Proof. Put and . Both are positive integers, since and . They are distinct, and . Also , and exactly when . By Zsigmondy’s theorem there is a primitive prime divisor of . It does not divide , so , and therefore by Theorem 5.7.
Let . We check the factors of one by one. Since and , is odd and , so . If , then or , and forces , which is impossible. By primitivity , so .
The final sentence holds because the discriminant of a polynomial with integer coefficients vanishes modulo if and only if its reduction modulo has a repeated factor, or its degree drops. The leading coefficient of is , so the degree does not drop. □
Remark 5.9. The exceptional case , i.e. , , has . Here has no new prime, because and , . The case reduces to primitive divisors of and can be treated in the same way with the Zsigmondy theorem for .
Concluding remarks and open problems
In this paper, we have demonstrated that certain translates of real polynomials of the type have their zeros on Cassini ovals. The results above show that Cassini ovals play for the family the role that ellipses play for Chebyshev polynomials. Certain questions remain outstanding, and these come from the work of Oyengo [18, 7, 4]. That is: for and is there an explicitly defined ellipse on which the zeros of lie? Oyengo [18] conjectured that then lie close to the ellipse . Corollary 4.5 settles the conjecture of [7] (Conjecture 1.1(3) in [4]) and the bound conjectured in [4].
For symmetric real-rooted with zeros in , Theorem 4.1 is sharp for . What is the smallest region containing the zeros of for all such polynomials of a fixed degree. What is the analogous region for non-symmetric (Example 4.3).
References
Department of Mathematics, Maseno University, Private Bag, Maseno, Kenya
Email address: [email protected]
References
- [1]T. M. Apostol. Resultants of cyclotomic polynomials. Proceedings of the American Mathematical Society, 24:457–462, 1970.DOI
- [2]S. Beraha, J. Kahane, and N. J. Weiss. Limits of zeroes of recursively defined polynomials. Proceedings of the National Academy of Sciences of the United States of America, 72(11):4209, 1975.pubmed.ncbi.nlm.nih.gov/16592282
- [3]S. Beraha, J. Kahane, and N. J. Weiss. Limits of zeroes of recursively defined families of polynomials. In Studies in Foundations and Combinatorics, volume 1 of Advances in Mathematics Supplementary Studies, pages 213–232. Academic Press, New York, 1978.
- [4]R. Davis and N. Farnsworth. A note on conjectures of gullerud, johnson, and mbirika. arXiv preprint arXiv:2510.02008, 2025.arxiv.org/abs/2510.02008
- [5]K. Dilcher and K. B. Stolarsky. Nonlinear recurrences related to chebyshev polynomials. Ramanujan Journal, 2014. Published online.DOI
- [6]I. M. Gelfand, M. M. K 복ranov, and A. V. Zelevinsky. Discriminants, Resultants, and Multidimensional Determinants. Birkhäuser, Boston, 1994.DOI
- [7]E. Gullerud, R. Johnson, and aBa Mbirika. Tridiagonal real symmetric matrices with a connection to pascal’s triangle and the fibonacci sequence. arXiv preprint arXiv:2201.08490, 2023.arxiv.org/abs/2201.08490
- [8]A. E. Hirst and E. K. Lloyd. Cassini, his ovals, and a space probe to saturn. The Mathematical Gazette, 81(492):409–421, 1997.DOI
- [9]M. E. H. Ismail. Difference equations and quantized discriminants for q-orthogonal polynomials. Advances in Applied Mathematics, 30:562–589, 2003.DOI
- [10]D. P. Jacobs, M. O. Rayes, and V. Trevisan. The resultant of chebyshev polynomials. Canadian Mathematical Bulletin, 54(2):288–296, 2011.DOI
- [11]M. Karatas. A multi foci closed curve: Cassini oval, its properties and applications. Doğuş Üniversitesi Dergisi, 14(2):231–248, 2013.DOI
- [12]S.-H. Kim and J. H. Lee. On difference quotients of chebyshev polynomials. Bulletin of the Korean Mathematical Society, 53(2):373–, 2016.DOI
- [13]J. D. Lawrence. A Catalog of Special Plane Curves. Dover, New York, 1972.
- [14]S. R. Louboutin. Resultants of chebyshev polynomials: a short proof. Canadian Mathematical Bulletin, 56(3):602–605, 2013.DOI
- [15]M. Marden. Geometry of Polynomials, volume 3 of Mathematical Surveys. American Mathematical Society, Providence, RI, 2 edition, 1966.
- [16]J. C. Mason and D. C. Handscomb. Chebyshev Polynomials. Chapman and Hall/CRC, Boca Raton, FL, 2003.
- [17]J. H. McKay and S. S.-S. Wang. A chain rule for the resultant of two polynomials. Archiv der Mathematik, 53:347–351, 1989.DOI
- [18]M. O. Oyengo. Chebyshev-like polynomials, conic distribution of roots, and continued fractions. PhD thesis, University of Illinois at Urbana-Champaign, 2018.
- [19]Q. I. Rahman and G. Schmeisser. Analytic Theory of Polynomials, volume 26 of London Mathematical Society Monographs. New Series. Oxford University Press, Oxford, 2002.
- [20]T. J. Rivlin. Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. Wiley, New York, 2 edition, 1990.
- [21]G. Szegő. Orthogonal Polynomials, volume 23 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 4 edition, 1975.
- [22]K. Tran. Connections between discriminants and the root distribution of polynomials with rational generating function. Journal of Mathematical Analysis and Applications, 410:330–340, 2014.DOI
- [23]K. Tran. The root distribution of polynomials with a three-term recurrence. Journal of Mathematical Analysis and Applications, 421:878–892, 2015.DOI
- [24]K. Zsigmondy. Zur theorie der potenzreste. Monatshefte für Mathematik und Physik, 3:265–284, 1892.DOI
