Polynomials with symmetric zeros

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to the real line; the self-inversive polynomials, whose zeros are symmetric to the unit circle; and the self-reciprocal polynomials, whose zeros are symmetric by an inversion with respect to the unit circle followed by a reflection in the real line. Real self-reciprocal polynomials are simultaneously self-conjugate and self-inversive so that their zeros are symmetric to both the real line and the unit circle. In this survey, we present a short review of these polynomials, focusing on the distribution of their zeros.


Introduction
In this work, we consider the theory of self-conjugate (SC), self-reciprocal (SR) and selfinversive (SI) polynomials. These are polynomials whose zeros are symmetric either to the real line R or to the unit circle S = {z ∈ C : |z| = 1}. The basic properties of these polynomials can be found in the books of Marden [1], Milovanović & al. [2], Sheil-Small [3]. Although these polynomials are very important in both mathematics and physics, it seems that there is no specific review about them; in this work we present a bird's eye view to this theory, focusing on the zeros of such polynomials. Other aspects of the theory (e.g., irreducibility, norms, analytical properties etc.) are not covered here due to the short space, nonetheless, the interested reader can check many of the references presented in the bibliography to this end. reciprocal polynomial p * (z) and the inversive polynomial p † (z) -, that are respectively defined in terms of p(z) as follows: p(z) = p 0 + p 1 z + · · · + p n−1 z n−1 + p n z n , p * (z) = p n + p n−1 z + · · · + p 1 z n−1 + p 0 z n , p † (z) = p n + p n−1 z + · · · + p 1 z n−1 + p 0 z n , (2.1) where the bar means complex conjugation. Notice that the conjugate, reciprocal and inversive polynomials can also be defined without making reference to the coefficients of p(z): p(z) = p(z), p * (z) = z n p (1/z) , p † (z) = z n p (1/z). (2.2) From these relations we plainly see that, if ζ 1 , . . . , ζ n are the zeros of a complex polynomial p(z) of degree n, then, the zeros of p(z) are ζ 1 , . . . , ζ n , the zeros of p * (z) are 1/ζ 1 , . . . , 1/ζ n and, finally, the zeros of p † (z) are 1/ζ 1 , . . . , 1/ζ n . Thus, if p(z) has k zeros on R, l zeros on the upper half-plane C + = {z ∈ C : Im(z) > 0} and m zeros in the lower half-plane C − = {z ∈ C : Im(z) < 0} so that k + l + m = n, then p(z) will have the same number k of zeros on R, l zeros in C − and m zeros in C + . Similarly, if p(z) has k zeros on S, l zeros inside S and m zeros outside S, so that k + l + m = n, then both p * (z) as p † (z) will have the same number k of zeros on S, l zeros outside S and m zeros inside S.
These properties encourage us to introduce the following classes of polynomials: Definition 2. A complex polynomial p(z) is called 1 self-conjugate (SC), self-reciprocal (SR) or self-inversive (SI) if, for any zero ζ of p(z), the complex-conjugate ζ, the reciprocal 1/ζ or the reciprocal of the complex-conjugate 1/ζ is also a zero of p(z), respectively.
Thus, the zeros of any SC polynomial are all symmetric to the real line R, while the zeros of the any SI polynomial are symmetric to the unit circle S. The zeros of any SR polynomial are obtained by an inversion with respect to the unit circle followed by a reflection in the real line. From this we can establish the following: Theorem 1. If p(z) is an SC polynomial of odd degree, then it necessarily has at least one zero on R. Similarly, if p(z) is an SR or SI polynomial of odd degree, then it necessarily has at least one zero on S.
Proof. From Definition 2 it follows that the number of non-real zeros of an SC polynomial p(z) can only occur in (conjugate) pairs; thus, if p(z) has odd degree, then at least one zero of it must be real. Similarly, the zeros of p † (z) or p * (z) that have modulus different from 1 can only occur in (inversive or reciprocal) pairs as well; thus, if p(z) has odd degree then at least one zero of it must lie on S. Theorem 2. The necessary and sufficient condition for a complex polynomial p(z) to be SC, SR or SI is that there exists a complex number ω of modulus 1 so that one of the following relations respectively holds: Proof. It is clear in view of (2.1) and (2.2) that these conditions are sufficient. We need to show, therefore, that these conditions are also necessary. Let us suppose first that p(z) is SC. Then, for any zero ζ of p(z) the complex-conjugate number ζ is also a zero of it. Thus we can write, with ω = p n /p n so that |ω| = |p n /p n | = 1. Now, let us suppose that p(z) is SR. Then, for any zero ζ of p(z) the reciprocal number 1/ζ is also a zero of it; thus, with ω = (−1) n / (ζ 1 . . . ζ n ) = p n /p 0 ; now, for any zero ζ of p(z) (which is necessarily different from zero if p(z) is SR), there will be another zero whose value is 1/ζ so that |ζ 1 . . . ζ n | = 1, which implies |ω| = 1. The proof for SI polynomials is analogous and will be concealed; it follows that ω = p n /p 0 in this case. Now, from (2.1), (2.2) and (2.3) we can conclude that the coefficients of an SC, an SR and an SI polynomial of degree n satisfy, respectively, the following relations: We highlight that any real polynomial is SC -in fact, many theorems which are valid for real polynomials are also valid for, or can be easily extended to, SC polynomials.
There also exist polynomials whose zeros are symmetric with respect to both the real line R and the unit circle S. A polynomial p(z) with this double symmetry is, at the same time, SC and SI (and, hence, SR as well). This is only possible if all the coefficients of p(z) are real, which implies that ω = ±1. This suggests the following additional definitions: Definition 3. A real self-reciprocal polynomial p(z) that satisfies the relation p(z) = ωz n p(1/z) will be called a positive self-reciprocal (PSR) polynomial if ω = 1 and a negative self-reciprocal (NSR) polynomial if ω = −1.
Thus, the coefficients of any PSR polynomial p(z) = p 0 + · · · + p n z n of degree n satisfy the relations p k = p n−k for 0 k n, while the coefficients of any NSR polynomial p(z) of degree n satisfy the relations p k = −p n−k for 0 k n; this last condition implies that the middle coefficient of an NSR polynomial of even degree is always zero.
Some elementary properties of PSR and NSR polynomials are the following: first, notice that, if ζ is a zero of any PSR or NSR polynomial p(z) of degree n 4, then the three complex numbers 1/ζ, ζ and 1/ζ are also zeros of p(z). In particular, the number of zeros of such polynomials which are neither on S or R is always a multiple of 4. Besides, any NSR polynomial has z = 1 as a zero and p(z)/(z − 1) is PSR; further, if p(z) has even degree then z = −1 is also a zero of it and p(z)/(z 2 − 1) is a PSR polynomial of even degree. In a similar way, any PSR polynomial p(z) of odd degree has z = −1 as a zero and p(z)/(z + 1) is also PSR. The product of two PSR, or two NSR, polynomials is PSR, while the product of a PSR polynomial with an NSR polynomial is NSR. These statements follow directly from the definitions of such polynomials.
We also mention that any PSR polynomial of even degree (say, n = 2m) can be written in the following form: an expression that is obtained by using the relations p k = p 2m−k , 0 k 2m and gathering the terms of p(z) with the same coefficients. Furthermore, the expression Z s (z) = (z s + z −s ) for any integer s can be written as a polynomial of degree s in the new variable x = z + 1/z (the proof follows easily by induction over s); thus, we can write p(z) = z m q (x), where q(x) = q 0 + · · · + q m x m is such that the coefficients q 0 , . . . , q m are certain functions of p 0 , . . . , p m . From this we can state the following: Theorem 3. Let p(z) be a PSR polynomial of even degree n = 2m. For each pair ζ and 1/ζ of self-reciprocal zeros of p(z) that lie on S, there is a corresponding zero ξ of the polynomial q(x), as defined above, in the interval [−2, 2] of the real line.
Proof. For each zero ζ of p(x) that lie on S , write ζ = e iθ for some θ ∈ R. Besides, as q(x) = q(z + 1/z) = p(z)/z m , it follows that ξ = ζ + 1/ζ = 2 cos θ will be a zero of q(x). This shows us that ξ is limited to the interval [−2, 2] of the real line. Finally, notice that the reciprocal zero 1/ζ of p(z) is mapped to the same zero ξ of q(x).
Finally, remembering that the Chebyshev polynomials of first kind, T n (z), are defined by the formula T n 1 2 z + z −1 = 1 2 (z n + z −n ) for z ∈ C, it follows as well that q(x), and hence any PSR polynomial, can be written as a linear combination of Chebyshev polynomials: 3. How these polynomials are related to each other?
In this section, we shall analyze how SC, SR and SI polynomials are related to each other. Let us begin with the relationship between the SR and SI polynomials, which is actually very simple: indeed, from (2.1), (2.2) and (2.3) we can see that each one is nothing but the conjugate polynomial of the other, that is, Thus, if p(z) is an SR (SI) polynomial, then p(z) will be SI (SR) polynomial. Because of this simple relationship, several theorems which are valid for SI polynomials are also valid for SR polynomials and vice versa.
The relationship between SC and SI polynomials is not so easy to perceive. A way of revealing their connection is to make use of a suitable pair of Möbius transformations, that maps the unit circle onto the real line and vice versa, which is often called Cayley transformations , defined through the formulas: and This approach was developed in [4], where some algorithms for counting the number of zeros that a complex polynomial has on the unit circle were also formulated. It is a easy matter to verify that M(z) maps R onto S while W(z) maps S onto R. Besides, M(z) maps the upper (lower) half-plane to the interior (exterior) of S, while W(z) maps the interior (exterior) of S onto the upper (lower) half-plane. Notice that W(z) can be thought as the inverse of M(z) in the Riemann sphere Given a polynomial p(z) of degree n, we define two Möbius-transformed polynomials, namely, 3) The following theorem shows us how the zeros of Q(z) and T (z) are related with the zeros of p(z): Theorem 4. Let ζ 1 , . . . , ζ n denote the zeros of p(z) and η 1 , . . . , η n the respective zeros of Q(z). Provided p(1) 0, we have that η 1 = W(ζ 1 ), . . . , η n = W(ζ n ). Similarly, if τ 1 , . . . τ n are the zeros of T (z), then we have τ 1 = M(ζ 1 ), . . . , τ n = M(ζ n ), provided that p(−i) 0.
Proof. In fact, inverting the expression for Q(z) and evaluating it in any zero ζ k of p(z) we get that p(ζ k ) = (−i/2) n (ζ k − 1) n Q(W(ζ k )) = 0 for 0 k n. Provided that z = 1 is not a zero of p(z) we get that η k = W(ζ k ) is a zero of Q(z). The proof for the zeros of T (z) is analogous.
This result also shows that Q(z) and T (z) have the same degree as p(z) whenever p(1) 0 or p(−i) 0, respectively. In fact, if p(z) has a zero at z = 1 of multiplicity m then Q(z) will be a polynomial of degree n − m, the same being true for T (z) if p(z) has a zero of multiplicity m at z = −i. This can be explained by the fact that the points z = 1 and z = −i are mapped to infinity by W(z) and M(z), respectively.
The following theorem shows that the set of SI polynomials are isomorphic to the set of SC polynomials: Theorem 5. Let p(z) be an SI polynomial. Then, the transformed polynomial Q(z) = (z + i) n p(M(z)) is an SC polynomial. Similarly, if p(z) is an SC polynomial, then T (z) = (z − 1) n p(W(z)) will be an SI polynomial.
Proof. Let ζ and 1/ζ be two inversive zeros an SI polynomial p(z). Then, according to Theorem 4, the corresponding zeros of Q(z) will be: Thus, any pair of zeros of p(z) that are symmetric to the unit circle are mapped in zeros of Q(z) that are symmetric to the real line; because p(z) is SI, it follows that Q(z) is SC. Conversely, let ζ and ζ be two zeros of an SC polynomial p(z); then the corresponding zeros of T (z) will be: Thus, any pair of zeros of p(z) that are symmetric to the real line are mapped in zeros of T (z) that are symmetric to the unit circle. Because p(z) is SC, it follows that T (z) is SI.
We can also verify that any SI polynomial with ω = 1 is mapped to a real polynomial through M(z), as well as, any real polynomial is mapped to an SI polynomial with ω = 1 through W(z). Thus, the set of SI polynomials with ω = 1 is isomorphic to the set of real polynomials. Besides, an SI polynomial with ω 1 can be transformed into another one with ω = 1 by performing a suitable uniform rotation of its zeros. It can also be shown that the action of the Möbius transformation over a PSR polynomial leads to a real polynomial that has only even powers. See [4] for more.

Zeros location theorems
In this section, we shall discuss some theorems regarding the distribution of the zeros of SC, SR and SI polynomials on the complex plane. Some general theorems relying on the number of zeros that an arbitrary complex polynomial has inside, on, or outside S are also discussed. To save space, we shall not present the proofs of these theorems, which can be found in the original works. Other related theorems can be found in Marden's book [1].

Polynomials that do not necessarily have symmetric zeros
The following theorems are classics (see [1] for the proofs): Theorem 6. (Rouché). Let q(z) and r(z) be polynomials such that |q(z)| < |r(z)| along all points of S. Then, the polynomial p(z) = q(z) + r(z) has the same number of zeros inside S as the polynomial r(z), counted with multiplicity.
Thus, if a complex polynomial p(z) = p 0 + · · · + p k z k + · · · + p n z n of degree n is such that |p k | > |p 0 + · · · + p k−1 + p k+1 + · · · + p n |, then p(z) will have exactly k zeros inside S, counted with multiplicity. Thereby, if a polynomial p(z) has all its zeros on S, then all the zeros of p (z) will lie in or on S. In particular, the zeros of p (z) will lie on S if, and only if, they are multiple zeros of p(z).

Theorem 8. (Cohn)
A necessary and sufficient condition for all the zeros of a complex polynomial p(z) to lie on S is that p(z) is SI and that its derivative p (z) does not have any zero outside S.
Cohn introduced his theorem in [5]. Bonsall & Marden presented a simpler proof of Conh's theorem in [6] (see also [7]) and applied it to SI polynomials -in fact, this was probably the first paper to use the expression "self-inversive". Other important result of Cohn is the following: all the zeros of a complex polynomial p(z) = p n z n + · · · + p 0 will lie on S if, and only if, |p n | = |p 0 | and all the zeros of p(z) do not lie outside S.
Restricting ourselves to polynomials with real coefficients, Eneström & Kakeya [8][9][10] independently presented the following theorem: Let p(z) be a polynomial of degree n with real coefficients. If its coefficients are such that 0 < p 0 p 1 · · · p n−1 p n , then all the zeros of p(z) lie in or on S. Likewise, if the coefficients of p(z) are such that 0 < p n p n−1 · · · p 1 p 0 , then all the zeros of p(z) lie on or out S.
The following theorems are relatively more recent. The distribution of the zeros of a complex polynomial regarding the unit circle S was presented by Marden in [1] and slightly enhanced by Jury in [11]: Let p(z) be a complex polynomial of degree n and p * (z) its reciprocal. Construct the sequence of polynomials P j (z) = n− j k=0 P j,k z k such that P 0 (z) = p(z) and P j+1 (z) = p j,0 P j (z) − p j,n− j P * j (z) for 0 j n − 1 so that we have the relations p j+1,k = p j,0 p j,k − p j,n− j p j,n− j−k . Let δ j denote the constant terms of the polynomials P j (z), i.e., δ j = p j,0 and ∆ k = δ 1 · · · δ k . Thus, if N of the products ∆ k are negative and n − N of the products ∆ k are positive so that none of them are zero, then p(z) has N zeros inside S, n − N zeros outside S and no zero on S. On the other hand, if ∆ k 0 for some k < n but P k+1 (z) = 0, then p(z) has either n − k zeros on S or n − k zeros symmetric to S. It has additionally N zeros inside S and k − N zeros outside S.
A simple necessary and sufficient condition for all the zeros of a complex polynomial to lie on S was presented by Chen in [12]: Theorem 11. (Chen) A necessary and sufficient condition for all the zeros of a complex polynomial p(z) of degree n to lie on S is that there exists a polynomial q(z) of degree n − m whose zeros are all in or on S and such that p(z) = z m q(z) + ωq † (z) for some complex number ω of modulus 1.
We close this section by mentioning that there exist many other well-known theorems regarding the distribution of the zeros of complex polynomials. We can cite, for example, the famous rule of Descartes (the number of positive zeros of a real polynomial is limited from above by the number of sign variations in the ordered sequence of its coefficients), the Sturm Theorem (the exact number of zeros that a real polynomial has in a given interval (a, b] of the real line is determined by the formula N = var [S (b)] − var [S (a)], where var S (ξ) means the number of sign variations of the Sturm sequence S (x) evaluated at x = ξ) and Kronecker Theorem (if all the zeros of a monic polynomial with integer coefficients lie on the unit circle, then all these zeros are indeed roots of unity), see [1] for more. There are still other important theorems relying on matrix methods and quadratic forms that were developed by several authors as Cohn, Schur, Hermite, Sylvester, Hurwitz, Krein, among others, see [13].

Real self-reciprocal polynomials
Let us now consider real SR polynomials. The theorems below are usually applied to PSR polynomials, but some of them can be extended to NSR polynomials as well.
An analogue of Eneström-Kakeya theorem for PSR polynomials was found by Chen in [12] and then, in a slightly stronger version, by Chinen in [14]: Theorem 12. (Chen & Chinen) Let p(z) be a PSR polynomial of degree n that is written in the form p(z) = p 0 +p 1 z+· · ·+p k z k +p k z n−k +p k−1 z n−k+1 +· · ·+p 0 z n and such that 0 < p k < p k−1 < · · · < p 1 < p 0 . Then all the zeros of p(z) are on S.
Going in the same direction, Choo found in [15] the following condition: Theorem 13. (Choo) Let p(z) be a PSR polynomial of degree n and such that its coefficients satisfy the following conditions: np n (n − 1) p n−1 · · · (k + 1) p k+1 > 0 and (k + 1) p k+1 k j=0 ( j + 1) p j+1 − jp j for 0 k n − 1 Then, all the zeros of p(z) are on S.
Lakatos discussed the separation of the zeros on the unit circle of PSR polynomials in [16]; she also found several sufficient conditions for their zeros to be all on S. One of the main theorems is the following: Other conditions for all the zeros of a PSR polynomial to lie on S was presented by Kwon in [19]. In its simplest form, Kown's theorem can be enunciated as follows: Theorem 17. (Kwon) Let p(z) be a PSR polynomial of even degree n 2 whose leading coefficient p n is positive and p 0 p 1 · · · p n . In this case, all the zeros of p(z) will lie on S if, either p n/2 n k=0 p k − p n/2 , or p(1) 0 and p n Modified forms of this theorem hold for the PSR polynomials of odd degree and for the case where the coefficients of p(z) do not have the ordination above -see [19] for these cases. Kwon also found conditions for all but two zeros of p(z) to lie on S in [20], which is relevant to the theory of Salem polynomials -see Section 5.
Other interesting results are the following: Konvalina & Matache [21] found conditions under which a PSR polynomial has at least one non-real zero on S. Kim & Park [22] and then Kim and Lee [23] presented conditions for which all the zeros of certain PSR polynomials lie on S (some open cases were also addressed by Botta & al. in [24]). Suzuki [25] presented necessary and sufficient conditions, relying on matrix algebra and differential equations, for all the zeros of PSR polynomials to lie on S. In [26] Botta & al. studied the distribution of the zeros of PSR polynomials with a small perturbation in their coefficients. Real SR polynomials of height 1 -namely, special cases of Littlewood, Newman and Borwein polynomials -were studied by several authors, see [27][28][29][30][31][32][33][34][35] and references therein 2 . Zeros of the so-called Ramanujan Polynomials and generalizations were analyzed in [37][38][39]. Finally, the Galois theory of PSR polynomials was studied in [40] by Lindstrøm, who showed that any PSR polynomial of degree less than 10 can be solved by radicals.

Complex self-reciprocal and self-inversive polynomials
Let us consider now the case of complex SR polynomials and SI polynomials. Here we remark that many of the theorems that hold for SI polynomials either also hold for SR polynomials or can be easily adapted to this case (the opposite is also true).

Theorem 18. (Cohn) An SI polynomial p(z) has as many zeros outside S as does its derivative p (z).
This follows directly from Cohn's Theorem 8 for the case where p(z) is SI. Besides, we can also conclude from this that the derivative of p(z) has no zeros on S except at the multiple zeros of p(z). Furthermore, if an SI polynomial p(z) of degree n has exactly k zeros on S, while its derivative has exactly l zeros in or on S, both counted with multiplicity, then n = 2(l + 1) − k.
O'Hara & Rodriguez [41] showed that the following conditions are always satisfied by SI polynomials whose zeros are all on S:

Theorem 19. (O'Hara & Rodriguez)
Let p(z) be an SI polynomial of degree n whose zeros are all on S. Then, the following inequality holds: n j=0 |p j | 2 p(z) 2 , where p(z) denotes the maximum modulus of p(z) on the unit circle; besides, if this inequality is strict then the zeros of p(z) are rotations of nth roots of unity. Moreover, the following inequalities are also satisfied: |a k | 1 2 p(z) if k n/2 and |a k | √ 2 2 p(z) for k = n/2.

Schinzel in [42], generalized Lakatos Theorem 14 for SI polynomials:
Theorem 20. (Schinzel) Let p(z) be an SI polynomial of degree n. If the inequality |p n | inf a,b∈C:|b|=1 n k=0 ap k − b n−k p n , then all the zeros of p(z) lie on S. These zero are simple whenever the equality is strict.
In a similar way, Losonczi & Schinzel [43] generalized theorem 15 for the SI case: In [45] Lakatos & Losonczi also formulated a theorem that contains as special cases many of the previous results: Let p(z) = p 0 + · · · + p n z n be an SI polynomial of degree n 2 and a, b and c be complex numbers such that a 0, |b| = 1 and c/p n ∈ R, 0 c/p n 1. If |p n + c| |ap 0 − b n p n | + n−1 k=1 ap k − b n−k (c − p n ) + |ap n − p n |, then, all the zeros of p(z) lie on S. Moreover, these zeros are simple if the inequality is strict.
In [46] Losonczi presented the following necessary and sufficient conditions for all the zeros of a (complex) SR polynomial of even degree to lie on S: Theorem 24. (Losonczi) Let p(z) be a monic complex SR polynomial of even degree, say n = 2m. Then, all the zeros of p(z) will lie on S if, and only if, there exist real numbers α 1 , . . . , α 2m , all with moduli less than or equal to 2, that satisfy the inequalities: . . . , α 2m ) denotes the kth elementary symmetric function in the 2m variables α 1 , . . . , α 2m .
Losonczi in [46] also showed that if all the zeros of a complex monic reciprocal polynomial are on S then its coefficients are all real and satisfy the inequality |p n | n k for 0 k n. The theorems above give conditions for all the zeros of SI or SR polynomials to lie on S. In many cases, however, we need to verify if a polynomial has a given number of zeros (or none) on the unit circle. Considering this problem, Vieira in [47] found sufficient conditions for an SI polynomial of degree n to have a determined number of zeros on the unit circle. In terms of the length L p(z) = |p 0 | + · · · + |p n | of a polynomial p(z) of degree n, this theorem can be stated as follows: Theorem 25. (Vieira) Let p(z) be an SI polynomial of degree n. If the inequality |p n−m | 1 4 n n−m L p(z) , m < n/2, holds true, then p(z) will have exactly n − 2m zeros on S; besides, all these zeros are simple when the inequality is strict. Moreover, p(z) will have no zero on S if, for n even and m = n/2, the inequality |p m | > 1 2 L p(z) is satisfied. The case m = 0 corresponds to Lakatos & Losonczi Theorem 14 for all the zeros of p(z) to lie on S. The necessary counterpart of this theorem was considered by Stankov in [48], with an application to the theory of Salem numbers -see Section 5.1.
Other results on the distribution of zeros of SI polynomials include the following: Sinclair & Vaaler [49] showed that a monic SI polynomial p(z) of degree n satisfying the inequalities L r p(z) 2+2 r (n − 1) 1−r or L r p(z) 2+2 r (l − 2) 1−r , where r 1, L r p(z) = |p 0 | r +· · ·+|p n | r and l is the number of non-null terms of p(z), has all their zeros on S; the authors also studied the geometry of SI polynomials whose zeros are all on S. Choo & Kim applied Theorem 11 to SI polynomials in [50]. Hypergeometric polynomials with all their zeros on S were considered in [51,52]. Kim [53] also obtained SI polynomials which are related to Jacobi polynomials. Ito & Wimmer [54] studied SI polynomial operators in Hilbert space whose spectrum is on S.

Where these polynomials are found?
In this section, we shall briefly discuss some important or recent applications of the theory of polynomials with symmetric zeros. We remark, however, that our selection is by no means exhaustive: for example, SR and SI polynomials also find applications in many fields of mathematics (e.g., information and coding theory [55], algebraic curves over a finite field and cryptography [56], elliptic functions [57], number theory [58] etc.) and physics (e.g., Lee-Yang theorem in statistical physics [59], Poincaré Polynomials defined on Calabi-Yau manifolds of superstring theory [60] etc.).

Polynomials with small Mahler measure
Given a monic polynomial p(z) of degree n, with integer coefficients, the Mahler measure of p(z), denoted by M[p(z)], is defined as the product of the modulus of all those zeros of p(z) that lie in the exterior of S [61]. That is, where ζ 1 , . . . , ζ n are the zeros 3 of p(z). Thus, if a monic integer polynomial p(z) has all its zeros in or on the unit circle, we have M[p(z)] = 1; in particular, all cyclotomic polynomials (which are PSR polynomials whose zeros are the primitive roots of unity, see [1]) have Mahler measure equal to 1. In a sense, the Mahler measure of a polynomial p(z) measures how close it is to the cyclotomic polynomials. Therefore, it is natural to raise the following: This is an 80 years old open problem of mathematics. Of course, we can expect that the polynomials with the smallest Mahler measure be among those with only a few number of zeros outside S, in particular among those with only one zero outside of S. A monic integer polynomial that has exactly one zero outside S is called a Pisot polynomial and its unique zero of modulus greater than 1 is called its Pisot number [62]. A breakthrough towards the solution of Mahler's problem was given by Smyth in [63]: The Mahler problem is, however, still open for SR polynomials. A monic integer SR polynomial with exactly two (real and positive) zeros (say, ζ and 1/ζ) not lying on S is called a Salem polynomial [62,64]. It can be shown that a Pisot polynomial with at least one zero on S is also a Salem polynomial. The unique positive zero greater than one of a Salem polynomial is called its Salem number, which also equals the value of its Mahler measure. A Salem number s is said to be small if s < σ; up to date, only 47 small Salem numbers are known [65,66] and the smallest known one was found about 80 years ago by Lehmer [67]. This gave place to the following: The monic integer polynomial with the smallest Mahler measure is the Lehmer polynomial L(z) = z 10 + z 9 − z 7 − z 6 − z 5 − z 4 − z 3 + z + 1, a Salem polynomial whose Mahler measure is Λ ≈ 1.17628081826, known as Lehmer's constant.
The proof of this conjecture is also an open problem. To be fair, we do not even know if there exists a smallest Salem number at all. This is the content of another problem raised by Lehmer: Lehmer's polynomial also appears in connection with several fields of mathematics. Many examples are discussed in Hironaka's paper [68]; here we shall only present an amazing identity found by Bailey & Broadhurst in [69] in their works on polylogarithm ladders: if λ is any zero of the aforementioned Lehmer's polynomial L(z), then,

Knot theory
A knot is a closed, non-intersecting, one-dimensional curve embedded on R 3 [70]. Knot theory studies topological properties of knots as, for example, criteria under which a knot can be unknot, conditions for the equivalency between knots, the classification of prime knots etc. -see [70] for the corresponding definitions. In Figure 5.1 we plotted all prime knots up to six crossings. In the Alexander-Briggs notation these knots are, in order, 0 1 , 3 1 , 4 1 , 5 1 , 5 2 , 6 1 , 6 2 and 6 3 .
One of the most important questions in knot theory is to determine whether or not two knots are equivalent. This, however, is not an easy task. A way of attacking this question is to look for abstract objects -mainly the so-called knot invariants -rather than to the knots themselves. A knot invariant is a (topologic, combinatorial, algebraic etc.) quantity that can be computed for any knot and that is always the same for equivalents knots 4 . An important class of knot invariants is constituted by the so-called Knot Polynomials. Knot polynomials were introduced in 1928 by Alexander [71]. They consist in polynomials with integer coefficients that can be written down for every knot. For about 60 years since its creation, Alexander polynomials were the only known kind of knot polynomial. It was only in 1985 that Jones [72] came up with a new kind of knot polynomials -today known as Jones polynomials -and since then other kinds were discovered as well, see [70]. What is interesting for us here is that the Alexander polynomials are PSR polynomials of even degree (say, n = 2m) and with integer coefficients 5 . Thus, they have the following general form: where δ i ∈ N, 0 i m. In table 1 we present the Alexander polynomials for the prime knots up to six crossings. Knots theory finds applications in many fields of mathematics in physics -see [70]. In mathematics, we can cite a very interesting connection between Alexander polynomials and the theory of Salem numbers: more precisely, the Alexander polynomial associated with the so-called Pretzel Knot P(−2, 3, 7) is nothing but the Lehmer polynomial L(z) introduced in Section 5.1; it is indeed the Alexander polynomial with the smallest Mahler measure [73]. In physics, knot theory is connected with quantum groups and it also can be used to one construct solutions of the Yang-Baxter equation [74] through a method called baxterization of braid groups.

Bethe Equations
The Bethe Equations were introduced in 1931 by Hans Bethe [75] together with his powerful method -the so-called Bethe Ansatz method -for solving spectral problems associated with exactly integrable models of statistical mechanics. They consist in a system of coupled and nonlinear equations that ensure the consistency of the Bethe Ansatz. In fact, for the XXZ Heisenberg spin chain, the Bethe Equations consist in a coupled system of trigonometric equations; however, after a change of variables is performed, we can write them in the following rational form: where L ∈ N is the length of the chain, N ∈ N is the excitation number and ∆ ∈ R is the so-called anisotropy parameter. A solution of (5.5) consists in a (non-ordered) set X = {x 1 , . . . , x N } of the unknowns x 1 , . . . , x N so that (5.5) is satisfied. Notice that the Bethe equations satisfy the important relation x L 1 x L 2 · · · x L N = 1, which suggests an inversive symmetry of their zeros. In [76], Vieira and Lima-Santos showed that the solutions of (5.5), for N = 2 and arbitrary L, are given in terms of the zeros of certain SI polynomials. In fact, (5.5) becomes a system of two coupled algebraic equations for N = 2, namely, Now, from the relation x L 1 x L 2 = 1 we can eliminate one of the unknowns in (5.6) -for instance, by setting x 2 = ω a /x 1 , where ω a = exp (2πia/L), 1 a L, are the roots of unity of degree L.
Replacing these values for x 2 into (5.6), we obtain the following polynomial equations fixing x 1 : p a (z) = (1 + ω a ) z L − 2∆ω a z L−1 − 2∆z + (1 + ω a ) = 0, 1 a L, (5.7) We can easily verify that the polynomial p a (z) are SI for each value of a. They also satisfy the relations p a (z) = z L p(ω a /z), 1 a L, which means that the solutions of (5.6) have the general form X = {ζ, ω a /ζ} for ζ any zero of p a (z). In [76] the distribution of the zeros of the polynomials p a (z) was analyzed through an application of Vieira's Theorem 25. It was shown that the exact behaviour of the zeros of the polynomials p a (z), for each a, depends on two critical values of ∆, namely, ∆ (1) a = 1 2 |ω a + 1| , and ∆ (2) a = 1 2 L L−2 |ω a + 1| , (5.8) as follows: if |∆| ∆ (1) a , then all the zeros of p a (z) are on S; if |∆| ∆ (2) a , then all the zeros of p a (z) but two are on S; (see [76] for the case ∆ (1) a < |∆| < ∆ (2) a and more details). Finally, we highlight that the polynomial p a (z) becomes a Salem polynomial for a = L and integer values of ∆. This was one of the first appearances of Salem polynomials in physics.

Orthogonal polynomials
An infinite sequence P = {P n (z)} n∈N of polynomials P n (z) of degree n is said to be an orthogonal polynomial sequence on the interval (l, r) of the real line if there exists a function w(x), positive in (l, r) ∈ R, such that, r l P m (z)P n (z)w(z)dz =        K n , m = n, 0, m n, m, n ∈ N, (5.9) where K 0 , K 1 etc. are positive numbers. Orthogonal polynomial sequences on the real line have many interesting and important properties -see [77].

Conclusions
In this work, we reviewed the theory of self-conjugate, self-reciprocal and self-inversive polynomials. We discussed their main properties, how they are related to each other, the main theorems regarding the distribution of their zeros and some applications of these polynomials both in physics and mathematics. We hope that this short review suits for a compact introduction of the subject, paving the way for further developments in this interesting field of research.