1. Introduction
Orthogonal polynomial sequences play a fundamental role in mathematics (approximation theory, Fourier series, numerical analysis, special functions,
…), but also in many other computational and applied sciences, physics, chemistry, engineering, etc. In this paper we give an account on polynomials orthogonal on the radial rays in the complex plane, as well as some new results and examples for such kinds of orthogonal polynomials. We introduced and studied such polynomials in several papers [
1,
2,
3,
4,
5], including an electrostatic interpretation of their zeros in the case of the generalized Gegenbauer polynomials, assuming a logarithmic potential [
6]. Polynomials orthogonal on radial rays was mentioned in the book [
7] (p. 111). Also, an extended Dunkl oscillator model based on our generalized Hermite polynomials on radial rays [
1,
2] was discussed very recently by Bouzeffour [
8] (see also [
9]).
The paper is organized as follows. In
Section 2 we present some basic facts from the standard theory of orthogonality on the real line, necessary for the development of orthogonality on the radial rays in the complex plane, while in
Section 3 we very briefly mention some classes of orthogonal polynomials in the complex plane. Orthogonal polynomials on the radial rays are presented in
Section 4, including the existence and uniqueness of such polynomials, the general distribution of their zeros, and some interesting examples. The numerical construction of this class of orthogonal polynomials is treated in
Section 5. In particular, the cases on finite and infinite radial rays are considered, as well as the cases with Jacobi weight functions on equidistant rays. An approach, called the
discretized Stieltjes-Gautschi procedure has been developed as the main method for the numerical construction of orthogonal polynomials on arbitrary radial rays and with arbitrary weight functions. The fully symmetric cases of orthogonal polynomials on radial rays and their zero distributions are studied in
Section 6. In particular, the cases with Jacobi and Legendre weight functions on
and generalized Laguerre and Hermite weights on
, as well as their connection with the standard orthogonal polynomials on the real line, are discussed, including differential equations and one application in electrostatic.
2. Orthogonal Polynomials on the Real Line
Orthogonal polynomials on the real line
, related to the inner product
are the most important in applications. Here,
is a positive measure on
, with finite or unbounded support, for which all moments
,
, exist and are finite, and
(cf. [
10,
11]). If we work with complex polynomials
1, then the second component
in (
1) should be conjugated, i.e.,
.
An interesting class of the measures are those when is an absolutely continuous function. Then is a weight function, which is non-negative and measurable in Lebesgue’s sense for which all moments exist and .
Because of the property
, the orthogonal polynomials
on
satisfy a three–term recurrence relation of the form
with
and
. The recursion coefficients
and
in (
2) can be expressed over the inner product as
and they depend on the weight function
w (in general, on the measure
). The coefficient
which is multiplied by
in (
2) can be arbitrary, but usually it is convenient to take
. In that case we have
.
Alternatively, these recursion coefficients can be expressed in terms of the Hankel determinants
where
The polynomials
,
, orthogonal with respect to the inner product (
1), have only real zeros, mutually different and located in the support of the measure
. Moreover, the zeros of two consecutive polynomials,
and
, interlace, i.e.,
where
denote the zeros of
in increasing order (see [
11], pp. 99–101).
The zeros of the orthogonal polynomials
, in notation
,
, play important role in the Gauss quadrature formula related to the measure
. Namely, for each
, there exists the
n-point Gauss formula
which is exact for all algebraic polynomials of degree at most
, i.e.,
for each
(
denotes the space of all algebraic polynomials, and
is its subspace of polynomials of degree at most
m). Thus, there is a deep connection between the Gauss quadrature formula (
3) and the orthogonal polynomial sequence
. The quadrature nodes
,
, are zeros of the polynomial
, i.e., the eigenvalues of the symmetric tridiagonal Jacobi matrix
while the weight coefficients in the quadrature rule (
3) are given by
,
, where
is the first component of the (normalized) eigenvector
, corresponding to the eigenvalue
, with Euclidean norm equal to unity (
).
The Golub-Welsch procedure [
12] is one of standard methods for solving this eigenvalue problem. Thus, the knowledge of the coefficients
and
in the three-term recurrence relation (
2) is of exceptional importance. Unfortunately, only for certain narrow classes of orthogonal polynomials, these coefficients are known in the explicit form, including
classical orthogonal polynomials, which can be classified as
the Jacobi polynomials, with the weight on the finite interval ;
the generalized Laguerre polynomials, with the wight on ;
the Hermite polynomials, with the weight function on .
There are several characterizations of the classical orthogonal polynomials (cf. [
13,
14,
15]). Orthogonal polynomials for which the recursion coefficients are not known in explicit form are known as
strongly non-classical polynomials [
11] (p. 159), and they must be constructed numerically, but such a construction is usually an ill-conditioned process. Because of that the use of strongly non-classical polynomials has long been limited.
Four decades ago, Walter Gautschi developed the so-called
constructive theory of orthogonal polynomials on for numerical generating orthogonal polynomials with respect to an arbitrary measure (see [
16] and [
10]). Three approaches for generating recursion coefficients were developed: the
method of modified moments as a generalization of the classical
Chebyshev method of moments, the
discretized Stieltjes-Gautschi procedure, and the
Lanczos algorithm. This constructive theory opened the door for extensive computational work on orthogonal polynomials, many applications, as well as further development of the theory of orthogonality in different directions (
s and
-orthogonality [
17,
18,
19,
20], Sobolev type of orthogonality, multiple orthogonality [
21], etc.).
Recently, however, there has been a big progress in computer architecture (arithmetic of variable precision), as well as a progress in symbolic calculations. These advances enabled the direct generation of recurrence coefficients in the relation (
2), using only the original Chebyshev method of moments, but with an arithmetic of sufficiently high precision, which avoids the ill-conditioning of the numerical process. The corresponding symbolic/variable-precision software for orthogonal polynomials and quadrature formulas is now available: Gautschi’s
Matlab package
SOPQ and our
Mathematica package
OrthogonalPolynomials (see [
22,
23]).
4. Orthogonal Polynomials on Radial Rays
We consider
radial rays
, given by complex points
,
,
,
, with different arguments
,
. Some of
(or all) can be
∞. The case
, with
, is shown in
Figure 1.
Define now an inner product
over all radial rays
, which connect the origin
and the points
,
, in the following way
where
are suitable complex (weight) functions on the radial rays
, respectively. Here, we suppose that the functions
are weight functions on
, i.e., they are nonnegative on
and
. In the case
, it is required that all moments exist and are finite.
As we can see, these inner product (
5) can be also expressed in the form
Remark 1. Without loos of generality we can assume that .
Remark 2.
In a simple case when , and , (6) becomes
i.e.,
where , , and
which means that it reduces to the case of polynomials orthogonal to by the weight function.
By the characteristic function of a set
L, defined by
and taking
, the inner product (
5) reduces to a standard form
with the measure
4.1. Existence and Uniqueness of Polynomials Orthogonal on the Radial Rays
Consider again the inner product defined by (
6). As we can see
and
except
. The corresponding moments are given by
Let
denote the single moments (of order
k), which correspond to the weight functions
on the rays
, i.e.,
then
Since
for each
, from (
10) we conclude that
Now, we use the so-called Gram matrix of order
n, constructed by the moments (
9), i.e., (
10),
According to (
11) the matrix
is Hermitian (
) and non-singular, i.e.,
, because the system of functions
is linearly independent. Moreover, the Gram matrix is also positive definite, which means that the moment determinant
. Formally, we introduce
.
The existence of a sequence of orthogonal polynomials is ensured by the following result:
Theorem 1.
For each the monic polynomials , with respect to the inner product (
6)
, exist uniquely. Their determinant representation is given by
as well as the norm of polynomials
Proof. Let us denote the monic polynomial of order
n, from the sequence
, by
and consider the orthogonality conditions
where
is Kronecker’s delta. These conditions give the system of equations
Since
, the system (
14) has a unique solution for the coefficients
,
. Notice that the leading coefficient
is given by
, according to (
13).
Similar to the proof for orthonormal polynomials (cf. [
11], Thm. 2.1.1), we prove the equality (
12) for monic polynomials, orthogonal with respect to the inner product (
6). □
4.2. General distribution of zeros of orthogonal polynomials on the radial rays
Let
be monic polynomials orthogonal with respect to the inner product
, where the measure is given by (
8), i.e.,
Let
be the smallest convex set containing
A, known as the
convex hull of a set
, and let the support of the measure
be denoted by
. Since
, using a result of Fejér, we can state (cf. Saff [
38]):
Theorem 2. All the zeros of the orthogonal polynomial lie in the convex hull of the rays .
Furthermore, an improvement can be also done.
Theorem 3. If the support of the measure, , is not a line segment, then all the zeros of the polynomial are in the interior of .
4.3. Some examples
Using the previous “determinant approach”, here we give a few simple examples of polynomials orthogonal on the radial rays, including the distribution of their zeros.
Example 1. We consider the case with thee unit rays (, , ), with , , , and the Legendre weight on the rays , (see Figure 2).
The moments (
10)
are
so that, for example, for we get the symmetric matrix
The determinants are
as well as the corresponding orthogonal polynomials, with respect to the inner product (
12),
Zeros of the polynomial are presented in Figure 3. According to Theorem 3 these zeros lie in the convex hull of the rays (see Figure 3, left).
Notice that , so that we can calculate its zeros in the explicit form. Indeed, (double zero), and other six zeros are solutions of the equations
where and . Thus,
As we can see all zeros lie also on the concentric circles with radii and . This property will be analyzed in the sequel.
Example 2. (i)
An interesting inner product is
with the same (Legendre) weight function on the all rays. It is a case with four unit rays (), equidistantly distributed: , , .
Since , the moments (
10)
are
i.e.,
so that, e.g., for we have
As we can see this matrix is symmetric. The corresponding determinants are
so that the orthogonal polynomials with respect to the inner product (
15)
are
etc. In particular, these polynomials are discussed in detail in [
2]
. Their zeros are simple and located symmetrically on the radial rays, with the possible exception a zero of order at the origin .
(ii)
Similarly, introducing an inner product with the weight function , instead of Legendre’s as in (
15)
, we have
In the same way, after much calculation, we obtain the corresponding orthogonal polynomials
etc.
Remark 3.
The subset of the previous polynomials from (ii)
in Example 2, appeared much earlier in an investigation a diffusion problem connected to a non-linear diffusion equation, which can be approximated by the Erdogan-Chatwin equation
where is the dispersion coefficient. The increased dispersion rate associated with buoyancy-driven currents is represented by the coefficient (cf. [
39,
40]).
Analytic expressions for the similarity solutions of the previous equation were derived by Smith [
39]
, in the case when , i.e., for
Smith also studied the asymptotic stability of the obtained solutions. This analysis of stability for the finite discharge involves a sequence of orthogonal polynomials , which satisfy the following second-order ordinary differential equation
These polynomials are just elements of Π.
Example 3. We consider the case with four unit rays (, , ), with , , , and the Legendre weight on the rays , .
Since , the moments (
10)
are
For example, for we have
while for we can calculate
so that
etc., with norms, according to (
13),
The zeros of polynomials for are presented on Figure 4.
Example 4. Consider now a case with three rays , given by , , with , , and the weight functions on the rays , .
Since the inner product is defined by
the moments are
so that the corresponding orthogonal polynomials are
where .
These three rays and zeros of polynomials , , are presented in Figure 5.
5. Numerical Construction of Orthogonal Polynomials Related to the Inner Product (6)
In this Section we describe a much better and simpler numerical method for constructing orthogonal polynomials on arbitrary radial rays.
Let
be monic orthogonal polynomials related to the inner product (
6), i.e., (
7). Since
and the polynomial
is of degree at most
, then for each
, it can be expressed in the form
i.e.,
where
are some constants. If for a fixed
we introduce two
n-dimensional vectors
as well as the following lower (unreduced)
n-order Hessenberg matrix,
then the system of equalities (
19) can be expressed in the matrix form
Now, we state an important result on the determinant form of the monic orthogonal polynomials and their zeros.
Theorem 4.
The monic orthogonal polynomials can be expressed in the following determinant form
where is the identity matrix. Moreover, , , are zeros of this polynomial if and only if they are eigenvalues of the Hessenberg matrix .
Proof. Let
,
, be zeros of the polynomial
. Taking
z in (
20) to be any of
, then the matrix relation (
20) reduces to the eigenvalue problem
for the the Hessenberg matrix
, where
,
…,
are eigenvalues of the matrix
, and
,
…,
are the corresponding eigenvectors.
From (
20), i.e.,
, we conclude that
,
, are zeros of the polynomial
if and only if they are the eigenvalues of the matrix
. Evidently, (
21) is true. □
Using the relation (
18) and orthogonality of the polynomials
, from
for
we obtain
Now we have a problem how to numerically compute these coefficients.
5.1. Case when all are finite
The inner product (
6), in this case, can be transformed to
M integrals over
, with respect to the weight functions
,
. Namely,
Since we have
M integrals with the weight functions
,
, it is enough to apply the
n-point quadrature rules of Gaussian type, with respect to the weight functions (i.e., w.r.t. the measures
,
),
where
and
,
, are the corresponding nodes and weight coefficients of these quadratures (see (
3)).
The construction of these quadrature parameters (with respect to the weight functions
) can be done by using our
Mathematica package
OrthogonalPolynomials (see [
22,
23]).
Since each of quadratures in (
24) has the maximal degree of precision
, i.e.,
for each
, we conclude that the inner product (
23) can be calculated exactly as
Since for each
and
, the maximal degree of polynomials in the inner product
in the numerator of (
22) is
it is really enough to take
n nodes in the quadrature formulas (
24).
Thus, in this way, the all elements of the Hessenberg matrix can be computed exactly, except for rounding errors.
5.2. Cases When Some of (or all) Are Infinity
In these cases we should take the corresponding
n-point quadrature rules of Gaussian type over
. For example, in the case considered in Example 4, for the first integral in the inner product (
17), we can use the one-side Gauss-Hermite quadrature formula
where
and
,
, are the corresponding nodes and weight coefficients. Since the moments for this weight function are
,
, the recurrence coefficients in the relation (
2) (i.e., in the Jacobi matrix (
4)), as well as the quadrature parameters in (
26), can be calculated by our
Mathematica package
OrthogonalPolynomials (see [
23], p. 176). Therefore, only knowledge of the moments of the weight function is required.
5.3. Discretized Stieltjes-Gautschi procedure
The main problem is how to numerically calculate the elements of the Hessenberg matrix
in an efficient way. Our proposal to solve this problem is to use a kind of Stieltjes procedure, which we call
discretized Stieltjes-Gautschi procedure [
11] (pp. 162–166).
Namely, we apply the formulas (
22) for recurrence coefficients
, with the inner products in a discretized form, in tandem with the basic linear relations (
18). As we have seen, a good way of discretizing the original measures on the radial rays can be obtained by applying suitable quadrature formulae to the corresponding integrals like (
25).
In the general (asymmetric) cases we have to use the discretized Stieltjes-Gautschi procedure as a basic method in numerical construction.
5.4. Jacobi Weight Functions on the Equidistant Rays
We consider now an important case with
M equidistant points on the unit circle in the complex plane,
,
, but with different Jacobi weight functions on the rays, when
where
, with
,
.
In this case, we can successfully apply the discretized Stieltjes-Gautschi procedure, with discretization using Gauss-Jacobi quadratures, to construct the corresponding orthogonal polynomials on the radial rays. Namely, for
,
so that the weights of the integrals in (
27) reduce to the Jacobi weights on
. For calculating these integrals (
27) on
, we simply apply the standard Gauss-Jacobi quadrature formulas
where
and
,
, are nodes and weights of the
n-point Gauss-Jacobi quadrature formula, with respect to the Jacobi weight
,
. These parameters are connected with the symmetric tridiagonal Jacobi matrix (
4), via the Golub-Welsch algorithm [
12], which is realized in our software
OrthogonalPolynomials (see [
22,
23]) as
<< orthogonalPolynomials‘
{nodes, weights} =
aGaussianNodesWeights[n,{aJacobi,alpha,beta},
WorkingPrecision -> WP,Precision ->PR];
giving, e.g., WorkingPrecision->40 and required Precision->30, if we need parameters with the relative errors about .
Now we give a few examples.
Example 5.
Let M be the number of unit rays and n be the degree of the orthogonal polynomial , related to the inner product (
27)
, with the same weight function on all rays. In this example we consider two cases.
(i) Chebyshev case of the first kind, when , with rays. Using the discretized Stieltjes-Gautschi procedure we obtain the corresponding polynomials:
etc.
In Figure 6 we present zeros of and . In the first case ten zeros are on the five rays and two concentric circles and one double zero is at the origin, while in the second case all 20 zeros lie on the five rays and the four concentric circles (see Theorem 8 in the sequel).
(ii) Chebyshev case of the second kind, with rays.
As in (i) we obtain the polynomials:
etc.
In Figure 7 we present zeros of and . Figure 7 (left) shows 12 zeros on six rays and two concentric circles and one triple zero at the origin, while the figure (right) displays 18 zeros on three concentric circles and six rays.
Example 6.
Here we consider eight rays () and the inner product (
27)
, with eight different Jacobi weights on :
Using the discretized Stieltjes-Gautschi procedure, we calculate , so that we are able now to construct all polynomials for and determine their zeros by solving the eigenvalue problem for the Hessenberg matrix .
To save space, now we only mention the matrix , whose elements are given with only a few decimal digits,
The first five orthogonal polynomials are
The zeros of the polynomials , , , and are presented in Figure 8 and Figure 9. We notice that as the degree of the orthogonal polynomial increases, we have a buildup of zeros towards the ends of the radial rays.
6. Symmetric Cases of Orthogonal Polynomials on the Radial Rays
In some special cases it is possible to find the moment determinants in an explicit form. Then we can get the corresponding orthogonal polynomials, as well as some other properties of these orthogonal polynomials, including recurrence relations, zero distribution, or even an electrostatic interpretation of their zeros (see [
6]).
6.1. Symmetrical Case of Equal Rays, Equidistantly Spaced and with the Same Weight Function
Consider the symmetric case with
,
,
, with the same weight function on the rays
Some of such cases are presented in Examples 1 and 2, with Legendre weight
on
, except Example 2 (ii)), where we used
on
.
The inner product, in this case, becomes
and the moments are given by (see also (
9))
Note that
and
. Like in [
2] we get that
as well as the following result (see [
3]):
Theorem 5.
The monic orthogonal polynomials , related to the inner product (
29)
, satisfy the recurrence relation
with for . The recursion coefficients in (
31)
are given by
and for .
In the case of even number of rays
, the previous result can be simplified (see [
2]). Notice that, in that case, for the inner product we have
.
Theorem 6.
Let in the inner product (
29)
. The monic polynomials satisfy the recurrence relation
with for . The coefficient in (
32)
is given by
Because for , the coefficients are arbitrary for , and we can take, e.g., for
Remark 4.
There is a connection between the recurrence relations (
32)
and (
31)
. Namely, using (
32)
one can get the recurrence relation
i.e., (
31)
, where and
We return again to the general case. For
, where
and
, we see that (
31) reduces to
so that, for
and
, we have
etc. We can conclude that the monic polynomials
can be expressed in the following form, with the real coefficients,
where
and
. Thus, we have the following representation
where
,
, are monic polynomials of the degree
k. Putting (
34) in (
33), we get
i.e., the following result (see [
3]).
Theorem 7.
For each , the monic polynomials satisfy the three-term recurrence relations
with , , where and for , , and . Moreover, these polynomials are orthogonal on with respect to the weight function
where is the weight function in the inner product (
29).
The second part of this theorem can be proved by using the equality
obtained by (
29) and (
34) and the change of variables
.
6.2. Zero Distribution
The following theorem gives the zero distribution of the polynomials .
Theorem 8.
All zeros of the orthogonal polynomials , , related to the inner product (
29)
, are simple and lie on the radial rays, with possible exception of a multiple zero at the origin of the order ν if .
Let
,
, denote the zeros of the polynomial
, defined in (
34), in an increasing order, i.e.,
Then each zero
generates
M zeros
of the polynomial
. On each ray we have
If , where and , then there exists one zero of of order at the origin .
6.3. Legendre Weight on
Let
be Jacobi weight on the interval
, where
. Suppose this weight on all rays, i.e., the inner product (
29) in the form
Then, the moments (36) become
i.e.,
and
in other cases. In fact, this is a special case of the general one considered earlier in §
5.4. Here, we study Legendre’s case (
) in particular, for which we can obtain some analytical results.
Thus, we take
and the moments (36) become
i.e., for
and
,
In tis case, the corresponding moment-determinants can be evaluated as (see [
3,
5])
where
and
Lemma 1.
The value of is
Using Theorem 1 and the previous lemma we calculate the norm
of the orthogonal polynomial in this symmetric case, when
,
and
, because (see Eq. (
13))
Theorem 9.
We have
where .
Using these explicit expressions we can state the following corollary of Theorem 5, for the Legendre weight.
Corollary 1.
Let , and . The monic orthogonal polynomials , with respect to the inner product (
29)
, with , satisfy the recurrence relation (
31)
, where
except , when .
Example 7.
Recurrence coefficients and in (
31)
for polynomials from Example 1 (), regarding Corollary 1, are
Consider now an interesting simple case when
(even number of rays
) and inner product is given by (
15), as in Example 2 (i). Then, Theorem 6 reduces to following result (see [
2]):
Corollary 2.
The sequence of monic orthogonal polynomials , related to the inner product (
15)
, satisfies the recurrence relation
with , , where
6.4. An analogue of the Jacobi polynomials
We consider a symmetric case of
M unit rays, equidistantly spaced (
,
), with the same weight function on the rays
The inner product given by
Let
be the monic Jacobi polynomial on
, orthogonal with respect to the weight function
. It is connected with the standard monic Jacobi polynomial
on
as
Using the three-term recurrence relation for
(cf. [
11], p. 132) we obtain the corresponding recurrence relation for the polynomial
,
where
and
According to Theorems 5 and 7 we can prove the following result:
Theorem 10.
The monic polynomials , orthogonal with respect to the inner product (
38)
, with the weight function (
37)
, satisfy the recurrence relation of the form (
31)
, and can be expressed in the form
where and
Remark 5. The case when was considered in [2].
6.5. Some Analogs of the Generalized Laguerre and Hermite Polynomials
We consider now a symmetric case of
M infinity rays, equidistantly spaced as in
$6.4, with the same weight function on the rays
and the inner product given by
With
denote the monic generalized Laguerre polynomials orthogonal related to the weight function
on
. Such polynomials satisfy the three-term recurrence relation ([
11], p. 141)
Using Theorems 5 and 7 we can prove the following result:
Theorem 11.
The monic orthogonal polynomials , related to the inner product (
41)
, with the weight function (
40)
, satisfy the recurrence relation of the form (
31)
, and can be expressed in the form
where
Remark 6.
The case when was considered in [1,2]. Then, according to Theorem 6, the polynomials , , satisfy (
32)
, where for
Recently, Bouzeffour [8] (see also [9]) used these polynomials to introduce the extended Dunkl oscillator, writing the inner product (
41)
in the simpler form
with the generalized Hermite weight on .
6.6. Differential equation
In the completely symmetric case, with
M rays, using (
34), we can prove the following result (cf. [
3]).
Theorem 12.
If polynomials , , defined in (
34)
, satisfy linear differential equations of the second order of the form
then the monic orthogonal polynomial satisfies the following second-order linear differential equation
where
Starting from the Jacobi differential equation for
(cf. [
41], p. 781)
i.e., from the corresponding equation for polynomials
orthogonal on
,
and Theorem 12, we conclude that the monic polynomials
from Theorem 11 satisfy the second-order linear differential equation
Similar result can be obtained for orthogonal polynomials from Theorem 11 (see [
1]).
6.7. Electrostatic Interpretation of the Zeros of Orthogonal Polynomials
As an application of our polynomials
, orthogonal on the symmetric radial rays in the complex plane, we give an electrostatic interpretation of their zeros. We mention that the first electrostatic interpretation for the zeros of Jacobi polynomials was given in 1885 by Stieltjes ([
42,
43]), who studied an electrostatic problem with particles of positive charge
p and
q placed at the points
and
, respectively, and with
n unit charges placed on the interval
at the points
,
. Assuming a logarithmic potential, Stieltjes showed that the electrostatic equilibrium occurs when
,
, are zeros of the Jacobi polynomial
, where the parameters
and
take values
and
, respectively. In that case, the energy of this electrostatic system, defined by Hamiltonian
reaches its minimum. Indeed, this is a unique global minimum of
(see Szegő [
26], p. 140). There are several results on the similar electrostatic problems (cf. [
5,
6,
26]).
Here we consider a symmetric electrostatic problem with M positive charges of the same strength q, placed at the fixed points , , and a charge of strength p at the point , as well as n positive free unit charges, positioned at the points , , …, . Assuming a logarithmic potential, it is interesting to find the positions of these n points, so that this electrostatic system be in equilibrium.
As in [
6] we are interested only in a solution with the rotational symmetry. Denoting
, with
,
, and using the approach of equilibrium conditions from [
6], we arrive at the differential equation
Comparing this equation with (
42), we find that
as well as
, so that the following result holds:
Theorem 13.
The previous electrostatic system is in equilibrium if the points , , are zeros of the polynomial , orthogonal with respect to (
38)
, with . This monic polynomial , where and , can be expressed in terms of the monic Jacobi polynomials as .