Next Article in Journal
Quasisymmetric Minimality on Packing Dimension for Homogeneous Perfect Sets
Previous Article in Journal
Weakly B-Symmetric Warped Product Manifolds with Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Novel Approach to Polynomial Approximation in Multidimensional Cylindrical Domains via Generalized Kronecker Product Bases

Mathematics Department, College of Science, King Khalid University, Abha 61413, Saudi Arabia
Axioms 2025, 14(10), 750; https://doi.org/10.3390/axioms14100750
Submission received: 22 August 2025 / Revised: 22 September 2025 / Accepted: 28 September 2025 / Published: 2 October 2025

Abstract

The Kronecker product has been commonly seen in various scientific fields to formulate higher-dimensional spaces from lower-dimensional ones. This paper presents a generalization of the Cannon–Kronecker product bases by introducing generalized Kronecker product bases of polynomials within an analytic framework. It investigates the convergence behavior of infinite series formed by these generalized products in various polycylindrical domains, including both open and closed configurations. The paper also delves into essential analytic properties such as order, type, and the T ρ -property to analyze the growth and structural characteristics of these bases. Moreover, the theoretical insights are applied to a range of classical special functions, notably Bernoulli, Euler, Gontcharoff, Bessel, and Chebyshev polynomials.

1. Introduction

The Kronecker product of matrices is a powerful and versatile tool in linear algebra, with profound implications across numerous areas of mathematics, engineering, and computational sciences. Originally introduced by the German mathematician Leopold Kronecker in the 19th century, the Kronecker product enables the construction of large structured matrices from smaller ones and facilitates the representation and analysis of complex systems in a compact, algebraically elegant form. The Kronecker product is not merely a theoretical construct but finds extensive applications in real-world problems, system theory and control engineering [1], quantum mechanics [2], image processing and signal analysis [3,4,5], statistics and econometrics [6,7], system identification [8,9], system theory [10,11], matrix calculus [12,13,14,15], including matrix equations [16,17], approximation theory [18] and several other areas [19].
An important area of approximation theory is the study of polynomial bases, a concept initially introduced by Whittaker and Cannon [20,21,22,23,24]. This theory has evolved along three principal directions. The first focuses on the convergence properties of polynomial bases in several complex variables, particularly within hyper-spherical, hyper-elliptical, and polycylindrical domains [25,26,27,28,29,30,31]. The second extends this study to the field of Clifford analysis, emphasizing convergence in hyper-spherical regions [32,33,34,35]. The third approach investigates the approximation of analytic functions in Fréchet spaces using polynomial bases constructed from complex conformable fractional derivatives [36,37,38].
It should be emphasized that the convergence properties, such as effectiveness, order, type, and the T ρ -property of various other products of polynomial bases, have been the subject of extensive study. Notably, these include the usual product bases [39,40] Hadamard product bases [41,42,43,44], similar bases [45], and equivalent bases [46]. In practical applications, special functions are frequently expressed in terms of polynomial bases. The convergence properties of polynomial bases related to Bernoulli and Euler functions, Bessel polynomials, Chebyshev polynomials, and the Gontcharoff polynomial basis have been thoroughly investigated (see, for example, [47,48,49,50,51]).
Recent advancements have highlighted the versatility of the Kronecker product in constructing high-dimensional analytical frameworks from lower-dimensional structures. In 2025, a significant study [52] examined the representation of analytic functions over hyper-elliptical regions using infinite series formed from Cannon–Kronecker product polynomial bases. The authors of [52] not only analyzed the growth order, type, and T ρ -property of entire functions expressed in this form, but also extended convergence results to Cannon–Kronecker product bases involving special functions such as Bernoulli, Euler, Gontcharoff, Bessel, and Chebyshev polynomials. These findings broaden the theoretical foundation previously established in hyper-spherical domains, offering deeper insights into the structure and behavior of function representations in more generalized geometric settings.
In this paper, we extend the classical concept of Cannon–Kronecker product bases by developing an analytic framework for generalized Kronecker product bases of polynomials (GKPBPs). Our approach involves a rigorous study of the convergence behavior of associated infinite series within various polycylindrical domains. Additionally, we investigate important analytic characteristics of these bases, including their order, type, and the T ρ -property, which are essential for understanding their functional and structural properties. Moreover, we study the effectiveness properties of the generalized Kronecker product associated with exponential bases and algebraic bases in polycylindrical domains. Furthermore, we demonstrate the applicability of these generalized bases by establishing connections with several classes of special functions, notably Bessel, Euler, Bernoulli, Chebyshev, and Gontcharoff polynomials.
The structure of this paper is as follows. Section 2 presents key definitions, notations, and previously established results that are utilized throughout the study. In Section 3, we define the generalized Kronecker product of certain bases and show that it forms a valid basis. Section 4 studies the convergence properties of the GKPBPs in closed polycylinders. We provide conditions under which these bases are effective, assuming they are constructed via general polynomial bases that are known to be effective in closed circles for one complex variable. In Section 5, we study the effectiveness of GKPBPs in open polycylinders and closed regions. Section 6 examines the effectiveness of the generalized Kronecker product of exponential bases in closed polycylinders. The effectiveness criteria of the generalized Kronecker product of algebraic bases in closed polycylinders are characterized in Section 7. Section 8 determines the order, type and T ρ -property of these GKPBPs. Finally, Section 9 concludes the paper.

2. Notations and Basic Results

In this section, we recall some main results from [25,26,28] which are required throughout this study. We have z C , that is z = z 1 , z 2 , z are complex variables and z k = s = 1 z s k s , where the modulus of z is
| z | 2 = z 1 2 + z 2 2 + + z 2 .
Let k = k 1 , k 2 , , k , are non-negative integers, (in short k s , s I = { 1 , 2 , , } ), k Σ = k 1 + k 2 + k and α r = α 1 r , α 2 r , , α r .
The study of approximating complex functions in terms of bases of polynomials is one of the significant topics in analysis where functions can be represented as infinite series of simpler polynomial terms, facilitating theoretical and practical insights.
Definition 1.
Let
G k [ z ] = G 0 [ z ] , G 1 [ z ] , , G n [ z ] ,
be a set of polynomials in the variables z s for s I . We say that G k [ z ] is a base (or basis) if every polynomial in the variables z s , s I can be uniquely expressed as a finite linear combination of the elements of the set G k [ z ] . Equivalently, the set G k [ z ] is a base if and only if there exists a unique row-finite matrix G = G k , h , called the coefficient matrix, and its inverse G 1 = G k , h 1 , called the operator matrix, such that
G G 1 = G 1 G = I ,
where I is the identity matrix. Accordingly, for the base G k [ z ] , we have
G k [ z ] = h G k , h z h , z k = h G k , h 1 G h [ z ] .
Let f ( z ) = k a k z k be any regular function at the origin 0 . Using (2), we substitute for z k and rearrange the terms to obtain the following:
f ( z ) = k Π k G k [ z ] , Π k = h G h , k 1 a h ,
which represents the associated basic series of the function f ( z ) .
In the space C of the complex variables z s , s I , an open polycylinder of radii r s > 0 , s I denoted by Γ [ r ] and its closure by Γ ¯ [ r ] . Moreover, D Γ ¯ [ r + ] denotes an unspecified domain containing the closed polycylinder. In terms of the introduced notations, the regions Γ [ r ] ,   Γ ¯ [ r ] ,   Γ ¯ [ r ] * and D Γ ¯ r + satisfy the following:
Γ [ r ] = Γ r 1 , r 2 , , r = z C : z s < r s , s I , Γ ¯ [ r ] = Γ ¯ r 1 , r 2 , , r = z C : z s r s , s I , Γ ¯ [ r ] * = Γ ¯ r , r , , r , D Γ ¯ r + = D Γ ¯ r 1 + , r 2 + , , r + = z C : z s r s + , s I .
Definition 2.
Let k Π k G k [ z ] be the associated basic series. We say that this series represents the function f ( z ) in Γ ¯ [ r ] , Γ [ r ] or D Γ ¯ r + , if the series converges uniformly to f ( z ) in Γ ¯ [ r ] , Γ [ r ] or in some polycylinder containing Γ ¯ [ r ] , respectively.
Definition 3
([26,28]). The base G k [ z ] is said to be effective in Γ ¯ [ r ] , Γ [ r ] or D Γ ¯ r + if the associated basic series represents every regular function in Γ ¯ [ r ] , Γ [ r ] or in some polycylinder containing Γ ¯ [ r ] , respectively.
Definition 4
([30]). Let N k = N k 1 , k 2 , , k denote the number of non-zero coefficients in the representation (2). A base G k [ z ] of polynomials is called a Cannon base, if N k satisfies that
lim k Σ N k 1 k Σ = 1 .
If lim k Σ N k 1 k Σ = a , where a > 1 , then the base G k [ z ] is called a general base of polynomials (GBP).
To examine the convergence properties of such bases, we use the following notations as indicated below:
M G k , Γ ¯ [ r ] = sup Γ ¯ [ r ] G k [ z ] , ψ ( G k , Γ ¯ [ r ] ) = s = 1 r s k Σ k s max i , j , Γ ¯ [ r ] h = i j G k , h 1 G h ( z ) , χ G , Γ ¯ [ r ] = lim sup k Σ ψ G k , Γ ¯ [ r ] 1 k Σ .
Regarding the effectiveness of the GBP G k [ z ] in polycylindrical regions, the following results have been established [25,41].
Theorem 1.
Let G k [ z ] be a GBP. Then
(i) 
G k [ z ] is effective in Γ ¯ [ r ] iff χ G , Γ ¯ [ r ] = s = 1 r s .
(ii) 
G k [ z ] is effective in Γ [ r ] iff χ G , Γ ¯ [ ρ ] < α [ r ] , [ ρ ] where
α [ r ] , [ ρ ] = max r 1 s = 2 ρ s , r ν s = 1 s ν ρ s , r s = 1 1 ρ s .
(iii) 
G k [ z ] is effective in D Γ ¯ r + iff
χ G , D ( Γ ¯ [ r + ) = s = 1 r s .

3. The Generalized Kronecker Product Bases of Polynomials

The Kronecker product of matrices of arbitrary size was introduced over any ring (see [53,54,55]). It maps the matrices X C i × j and Y C s × t into the matrix Z = X Y C i s × j t . Unlike the standard matrix product, which requires that j = s unless one operand is a scalar, the Kronecker product is defined for matrices of any size. The following properties are true for the Kronecker product.
(1)
X Y Z = ( X Y ) Z = X ( Y Z ) ;
(2)
( X Y ) ( Z W ) = X Z Y W if X Z and Y W exist;
(3)
If X and Y are non-singular, then ( X Y ) 1 = X 1 Y 1 ;
(4)
I m I n = I m n .
If G s , k s z s ; s I are GBPs of one complex variables z s , s I , the product set:
K k [ z ] = s = 1 G s , k s z s
defines the GKPBPs of the several complex variables z s , s I where
K k [ z ] = h K k , h z h , z k = h K k , h 1 K h [ z ] .
Note that K = K k , h denotes the coefficient matrix and K 1 = K k , h 1 denotes the operator matrix of the GKPBPs K k [ z ] for which
K = G 1 G 2 G , K 1 = G 1 1 G 2 1 G 1 ,
Here, G s and G s 1 , s I , denote the coefficient matrix and the corresponding operator matrix of the bases G s , k s z s , respectively.
Now, we prove that the general Kronecker product set K k [ z ] is indeed a base of polynomials. Observe that
K K 1 = G 1 G 2 G G 1 1 G 2 1 G 1 = G 1 G 1 1 G 2 G 2 1 . G G 1 = I I I = I
and
K 1 K = G 1 1 G 2 1 G k 1 G 1 G 2 G k = G 1 1 G 1 G 2 1 G 2 . G k 1 G k = I I I = I .
According to (1), the general Kronecker product set is a base.
In this study, we will provide a comprehensive investigation of the convergence properties of the constructed GKPBPs through the following scenarios:
  • Will the GKPBP K k [ z ] be effective in Γ ¯ [ r ] if its constituent bases G s , k s z s are effective in the closed discs | z s | r s where s I ?
  • Will the GKPBP K k [ z ] be effective in Γ [ r ] if its constituent bases G s , k s z s are effective in the open discs | z s | < r s where s I ?
  • Will the GKPBP K k [ z ] be effective in D Γ ¯ r + if its constituent bases G s , k s z s are effective in | z s | < r s + where s I ?
  • How are the orders, types and the T ρ -property of the constituent bases related to the order, type and the T ρ -property of the GKPBP K k [ z ] ?
  • Are our results applicable to specific special functions like Gontcharoff, Chebyshev, Bessel, Bernoulli, and Euler?

4. Effectiveness of GKPBPs in Closed Polycylinder

Let G s , k s z s , s I be GBP of a single complex variable. Then the monomials z s k s , I admit the unique finite representations
z s k s = j s G s , k s , j s 1 G j s z s , s I ,
where G s 1 = G s , k s , j s 1 and G s = G s , k s , j s are the matrices of operators and coefficients of the base G s , k s z s , s I , respectively. In this section, we examine the effectiveness criterion of the GKPBPs in closed polycylinders Γ ¯ [ r ] , r s > 0 , s I .
Theorem 2.
Let K k [ z ] be the GKPBPs of the several complex variables z s , s I whose constituents are the GBPs G s , k s z s , s I . Then K k [ z ] is effective in the closed polycylinder Γ ¯ [ r ] , r s > 0 , s I , if and only if G s , k s z s , s I are effective in z s r s , s I , respectively.
Proof. 
Suppose that K k [ z ] is the GKPBP of the bases G s , k s z s , s I . Then as in [52], any monomial z k = s = 1 z s k s , k s 0 , s I , admits a unique finite representation of the form
z k = j K k , j 1 K j [ z ]
where
K k [ z ] = s = 1 G s , k s z s , K k , j 1 = s = 1 G s , k s , j s 1 .
Suppose that G s , k s z s , s I are effective in z s r s , s I . Then
χ G s , r s = lim sup k s ψ G s , k s , r s 1 k s = r s , s I
where
ψ G s , k s , r s = max α s , β s , z s = r s j s = α s β s G s , k s , j s 1 G s , j s z s .
Observe that χ G s , r s and ψ G s , k s , r s , s I are the Cannon functions and Cannon sums of the bases G s , k s z s , s I . Thus, according to (5), there exists a constant K > 1 and a positive finite integer M s such that
ψ G s , k s , r s < K r s k s , k s > M s , s I .
Let f [ z ] = k a k z k be any function that is regular in Γ ¯ [ r ] . Then
lim sup k Σ s = 1 R s k Σ k s a k 1 k Σ = s = 1 R s 1
where R s , s I are positive numbers such that R s > r s , s I . Write
u k [ r ] = max Γ ¯ [ r ] a k K k , j 1 K j [ z ] .
Owing to (4), (6)–(8), we obtain
u k [ r ] = max z s = r s a k s = 1 G s , k s , h s 1 G s , h s z s s = 1 R s k Σ k s a k s = 1 R s k Σ k s ψ G s , k s , r s < K s = 1 R s k Σ k s a k s = 1 R s k Σ k s r s k s = K s = 1 R s k Σ k s a k r 1 R 2 R 3 R k 1 R 1 r 2 R 3 R k 2 R 1 R 2 R 1 r k K s = 1 R s k Σ k s a k max r 1 R 2 R 3 R k Σ , R 1 r 2 R 3 R k Σ , , R 1 R 2 R 1 r k Σ
for k Σ > max s M s . Hence using (8), it follows that
lim sup k Σ u k [ r ] 1 k Σ s = 1 R s 1 max r 1 R 2 R 3 R , R 1 r 2 R 3 R , , R 1 R 2 R 1 r < 1 .
Since the series k u k [ r ] majorities in Γ ¯ [ r ] the series k a k K k , j 1 K j [ z ] . Then the latter is absolutely and uniformly convergent in Γ ¯ [ r ] . Moreover, it can be easily seen that the series k a k K k , j 1 is bounded and convergent for all j .
Now, choose the positive integers N i , i = 1 , 2 , 3 , 4 such that K k , j 1 = 0 for all j > N 2 ; this is possible since the matrix G 1 is row-finite, and for given ε 1 , ε 2 we have
max Γ ¯ [ r ] k N 3 a k z k < ε 1 2 , max Γ ¯ [ r ] k N 4 a k K k , j 1 K j [ z ] < ε 2 2 .
This follows directly from the convergence of the two series in Γ ¯ [ r ] . Thus,
z k = j = 0 N 2 K k , j 1 K j [ z ] .
Consider the following difference:
max Γ ¯ [ r ] f [ z ] j = 0 N 2 k = 0 a k K k , j 1 K j [ z ] = max Γ ¯ [ r ] k N 1 a k z k k N 1 a k j = 0 N 2 K k , j 1 K j ( z ) < ε 1 2 + ε 2 2 1 + N 2 < ε ,
for ε max ϵ 1 , ϵ 2 1 + N 2 .
Thus, the basic series represents in Γ ¯ [ r ] the function f [ z ] , which is regular there. Since the function f [ z ] is arbitrarily chosen, we infer that the GKPBP K j [ z ] is effective in Γ ¯ [ r ] .
To prove the other direction of the theorem, suppose that the GKPBP K k [ z ] is effective in the polycylinder Γ ¯ [ r ] . Then it follows that
s = 1 r s = χ ( K , Γ ¯ [ r ] ) = lim sup k Σ ψ ( K k , Γ ¯ [ r ] ) 1 k Σ lim sup k Σ s = 1 r s k Σ k s s = 1 max j s , s I max z s = r s G s , k , j s 1 , G s , j s z s 1 k Σ lim sup k 1 s = 2 r s k 1 max j 1 max z 1 = r 1 G 1 , k 1 , j 1 1 G 1 , j 1 z 1 s = 2 G s , 0 , 0 1 G s , 0 ( 0 ) 1 k 1 = lim sup k 1 s = 2 r s k 1 ϕ G 1 , k 1 , r 1 s = 2 G s , 0 , 0 1 G s , 0 ( 0 ) 1 k 1 = s = 2 r s ϕ G 1 , r 1 .
Let ϕ G 1 , k 1 , r 1 = max j 1 max z 1 = r 1 G 1 , k 1 , j 1 1 G 1 , j 1 z 1 . Accordingly, it follows that
ϕ G 1 , r 1 = lim sup k 1 ϕ G 1 , k 1 , r 1 1 k 1 = lim sup k 1 max j 1 max z 1 = r 1 G 1 , k 1 , j 1 1 , G 1 , j 1 z 1 1 k 1 r 1
Write
u G 1 , k 1 , r 1 = a k 1 ( 1 ) ϕ G 1 , k 1 , r 1
and suppose that f 1 z 1 = k 1 a k 1 ( 1 ) z 1 k 1 is regular in z 1 r 1 , then its radius of regularity R 1 will be greater than r 1 . Hence, by combining (11) and (12), we obtain
lim sup k 1 u G 1 , k 1 , r 1 1 k 1 r 1 R 1 < 1 , 0 < r 1 < R 1 .
Therefore, by applying the Weierstrass M-test for uniform convergence, it follows that the series k 1 = 0 u G 1 , k 1 , r 1 and k 1 a k 1 ( 1 ) G 1 , k 1 , j 1 1 G 1 , j 1 z 1 are absolutely and uniformly convergent in the disk z 1 r 1 . Following similar steps as in (9), the basic series k 1 a k 1 ( 1 ) j 1 G 1 , k 1 , j 1 1 G 1 , j 1 z 1 associated with the base G 1 , k 1 z 1 converges uniformly to f 1 ( z 1 ) in the disk z 1 r 1 . Consequently, the base G 1 , k 1 z 1 is effective in the disk z 1 r 1 .
Moreover, we can proceed in a manner similar to the above to show that each of the bases G s , k s z s , s = 2 , 3 , , is effective in the disks z s r s , s = 2 , 3 , , when the GKPBP K k [ z ] is effective in Γ ¯ r ] . Therefore, we completely establish the result. □
In the following examples, we illustrate the efficiency and applicability of Theorem 2 where the constituents of GKPBPs involve certain bases of polynomials.
Example 1.
The base of polynomials
G s , k s z s = 1 , k s i s e v e n , 1 + z s k s + z s 2 k s 4 k s , k s i s o d d s I ,
is effective in | z s | r s , 1 r s 4 , s I . Applying Theorem 2, we conclude that the Kronecker product bases
K K ( G ) [ z ] = s = 1 G s , k s z s
are also effective in the closed polycylinder Γ ¯ [ r ] , 1 r s 4 , s I .
Example 2.
The base of polynomials
G s , k s z s = z s k s , k s i s e v e n , z s k s + z s 2 k s , k s i s o d d s I ,
is effective in | z s | r s , r s 1 , s I . Applying Theorem 2, we conclude that the Kronecker product bases
K K ( G ) [ z ] = s = 1 G s , k s z s
are also effective in the closed polycylinder Γ ¯ [ r ] , r s 1 , s I .
Example 3.
The base of polynomials
G s , k s z s = 1 , k s = 0 , z s k s a s z s k s 1 , k s 1 , s I ,
where a s > 0 , is effective in | z s | r s , r s a s , s I . Applying Theorem 2, we conclude that the Kronecker product bases
K K ( G ) [ z ] = s = 1 G s , k s z s
are also effective in the closed polycylinder Γ ¯ [ r ] , r s a s , s I .
The following example examines the case in which the constituents of GKPBPs involve certain well-known special polynomials.
Example 4.
(1)
As deduced [48,49], the base of the proper Bessel polynomials
F s , k s z s = 1 , k s = 0 , h s = 0 k s k s + h s ! h s ! k s h s ! z s 2 h s , k s 1 , s I ,
and also the base of the general Bessel polynomials, where a s and b s are given numbers,
H s , k s z s = 1 , k s = 0 , 1 + h s = 1 k s k s ! j s = 1 h s k s + j s + a s 2 h s ! k s h s ! z s b s h s , k s 1 , s I ,
are effective in | z s | r s for all r s > 0 . We can conclude, directly applying Theorem 2, that the Kronecker product bases constructed by these bases
K k ( F ) [ z ] = s = 1 F s , k s z s
and
K k ( H ) [ z ] = s = 1 H s , k s z s
are effective in the closed polycylinder Γ ¯ [ r ] for all r s > 0 , s I .
(2) 
In [50], the Chebyshev polynomials
T s , k s z s = 1 , k s = 0 h s = 0 k s 2 k s ! 2 h s ! k s 2 h s ! z s k s 2 h s z s 2 1 h s , k s 1 , s I
are proved to be effective in | z s | < 1 , s I . By applying Theorem 2, the Kronecker product bases
K k ( T ) [ z ] = s = 1 T s , k s z s
are also effective in the closed equi-polycylinder Γ ¯ [ 1 ] .
(3)
In [47], the Gontcharoff base of polynomials { G s , k s z s } , associated with a given set ( α s t s k s ) of points, was given in the form
G s , 0 z s = 1 , G s , k s ( z s ; α s , α s t s , α s t s 2 , , α s t s k s 1 ) = α s z s d l 1 s α s t s l 1 s d l 2 s α s t s 2 l 2 s d l 3 s α s t s k s 1 l k s 1 s d l k s s , k s 1
where α s and t s are given complex numbers. For the case when | t s | < 1 , the authors [47] proved that the Gontcharoff polynomials { G s , k s z s } are effective in | z s | r s for all r s | α s | . Applying Theorem 2, we conclude that the Kronecker product bases
K k ( G ) [ z ] = s = 1 G s , k s z s
are effective in the closed polycylinder Γ ¯ [ r ] for all r s | α s | .

5. Effectiveness of GKPBPs in Open Polycylinders and Closed Regions

This section characterizes the effectiveness of GKPBPs in open polycylinders and closed regions.
Theorem 3.
The GKPBP K k [ z ] is effective in the open polycylinder Γ [ r ] if and only if the bases G s , k s z s , s I are effective in z s < r s , s I , respectively.
Proof. 
Suppose that the GBPs G s , k s z s , s I are effective in z s < r s , s I , respectively. Then from the properties of Cannon functions, it follows that
χ G s , ρ s < r s ρ s < r s , s I .
Thus, there exist positive numbers b s < 1 such that ρ s < b s r s and a constant K > 1 such that
ψ G s , k s , ρ s < K b s r s k s , k s 0 .
Hence,
s = 1 ψ G s , k s , ρ s < K b k Σ s = 1 r s s k s , k s 0 , s I ,
where b = max s { b s : s I } . Now, suppose that f [ z ] = k a k z k is any function regular in the polycylinder Γ r . Then, it follows that
lim sup k Σ s = 1 r s k Σ k s a k 1 k Σ s = 1 r s 1 .
Using (15) and (16), we get
lim sup k Σ max Γ ¯ [ ρ ] a k K k , j 1 K j [ z ] 1 k Σ lim sup k Σ a k s = 1 ψ G s , k s , ρ s 1 k Σ = lim sup k Σ s = 1 r s k Σ k s a k s = 1 r s k Σ k s ψ G s , k s , ρ s 1 k Σ < 1 .
Therefore, the series k a k K k , j 1 K j [ z ] is absolutely and uniformly convergent in Γ ¯ [ ρ ] , which means that the GKPBP K k [ z ] is effective in Γ [ r ] .
To prove the only if statement of the theorem, suppose that the GKPBP K k [ z ] is effective in Γ [ r ] , R s , s I are any numbers such that 0 < R s < r s , s I and r i ( s ) , s I , i = 0 , 1 , 2 , are chosen such that
r i + 1 ( s ) = 1 2 r s + r i ( s ) , i = 0 , 1 , 2 , , s I ,
where
0 < r 0 ( s ) < r s , r 0 ( s ) r 0 ( j ) = r s r j , s , j I .
Thus, it follows that
r 1 ( s ) r 1 ( j ) = r s r j , s , j I , i = 0 , 1 , 2 ,
Therefore, R s < r 1 ( s ) < r s , s I , i = 0 , 1 , 2 , , and
r 1 r 1 ( 2 ) r 1 ( 3 ) r 1 ( ) = r 1 ( 1 ) r 1 ( 2 ) r 1 ( ν 1 ) r v r 1 ( ν + 1 ) r 1 ( ) = r 1 ( 1 ) r 1 ( 2 ) r 1 ( 1 ) r ,
where v = 2 , 3 , , ( 1 ) . Using the effectiveness of the GKPBPs K k [ z ] , it follows that
χ ( K , Γ ¯ [ R ] ) < χ K , r 1 ( 1 ) , r 1 ( 2 ) , , r 1 ( ) = r 1 ( 1 ) r 1 ( 2 ) r 1 ( 1 ) α < r 1 ( 1 ) r 1 ( 2 ) r 1 ( 1 ) r J ( ) , 0 < r 1 ( ) < α < r j ( ) < r .
Thus, it follows, as in (10), by using (17), that
s = 2 r 1 ( s ) χ G 1 , r 1 ( 1 ) χ K , r 1 ( 1 ) , r 1 ( 2 ) , , r 1 ( ) < r 1 ( 1 ) r 1 ( 2 ) r 1 ( 1 ) r j ( ) ,
which leads to
χ G 1 , r 1 ( 1 ) < r 1 ( 1 ) r j ( ) r i ( ) = r 1 ( 1 ) r j ( 1 ) r i ( 1 ) = r j ( 1 ) .
Since R 1 < r i ( 1 ) < r j ( 1 ) < r 1 , we obtain
χ G 1 , R 1 < χ G 1 , r i ( 1 ) < r j ( 1 ) < r 1
for all R 1 < r 1 .
Thus, if f 1 z 1 = k 1 a k 1 ( 1 ) z 1 k is any function regular in z 1 < r 1 , then we can easily see as in (13) by using (18) that
lim sup k 1 u G 1 , k 1 , R 1 1 / k 1 < 1 ,
which means that the series k 1 u G 1 , k 1 , R 1 < and the series k 1 a 1 ( 1 ) G 1 , k 1 , i 1 1 G 1 , i 1 z 1 converge absolutely and uniformly in z 1 R 1 < r 1 . Therefore, the base G 1 , k 1 z 1 is effective in z 1 < r 1 . Now, using the same procedure we can easily prove that the bases G s , k s z s , s = 2 , 3 , , will be effective in z s < r s , s = 2 , 3 , , respectively, when the GKPBP K k [ z ] is effective in Γ [ r ] . Hence, Theorem 3 is established. □
Proceeding in a similar way as before, we can prove the following result.
Theorem 4.
The GKPBPs K k [ z ] will be effective in the closed region D Γ ¯ [ r + ] if and only if the GBP G s , k s z s , s I is effective in z s r s + , s I , respectively.

6. Effectiveness of the General Kronecker Product of Exponential Bases of Polynomials in Closed Polycylinders

Let G k [ z ] be a GBP in the several complex variables z s , where s I , with associated coefficient matrices and operators denoted by G and G 1 , respectively. Consider the associated set G E k [ z ] whose matrices of coefficients and operator are e G and e G 1 . Thus, e G e G 1 = e 0 = I and the set G E k [ z ] is a base. This set is defined here as the exponential base of polynomials.
When { G s E k s ( z s ) } , s I are the exponential bases associated with the general bases G s , k s z s , then the product
K E k [ z ] = s = 1 { G s E k s ( z s ) }
defines the general Kronecker product of exponential bases of polynomials (GKPEBP).
Now, we consider the following restriction:
G s , k s , h s M a s k s h s b s h s , 0 < b s < 1 , s I
and a s are positive numbers.
The elements of the power matrices of coefficients G s ( j s ) of the GBP G s , k s z s are
G s , k s , h s j s = ν s = 0 G s , k s , ν s G s , ν s , h s ( j s 1 ) ; j s 1 , s I .
Theorem 5.
The GKPEBPs K E k [ z ] of the several complex variables z s , s I will be effective in the closed polycylinder Γ ¯ [ r ] for all a s r s < a s b s , s I , when the general constituent bases G s , k s z s accord to the restriction (20) and may not be effective in Γ ¯ [ r ] for all r s < a s or r s a s b s , s I .
Proof. 
In the assumption that G s ( 0 ) = I , I is the unit matrix. Applying (20) in (21), we get the following inequality:
G s , k s , h s ( j s ) M j s 1 b s ( j s 1 ) a s k s h s b s h s .
Using (22) implies
M G s E k s , r s h s = 0 j s = 0 G s , k s , h s j s j s ! r s h s = h s = 0 G s , k s , h s ( 0 ) r s h s + h s = 0 j s = 1 G s , k s , h s ( j s ) j s ! r s h s G s , k s , k s ( 0 ) r s k s + h s = 0 j s = 1 M j s j s ! 1 b s ( j s 1 ) a s k s h s b s r s h s = 1 + e M 1 b s 1 1 1 b s h s = 0 k s a s r s k s h s b s h s + h s > k s a s r s k s b s r s a s h s r s k s 1 + e M 1 b s 1 1 1 b s 1 b s 1 + 1 b s r s a s 1 r s k s = K s r s k s K r s k s
for all a s r s < a s b s , s I , K = max s I K s . Using (20) and (23) in the Cannon sum, ψ K E k , Γ ¯ [ r ] , of the GKPEBPs, K E k [ z ] , yields
ψ K E k , Γ ¯ [ r ] = s = 1 r s k Σ k s max α , β , Γ ¯ [ r ] h = α β K E k , h 1 K E h [ z ] s = 1 r s k Σ k s h = 0 K E k , h 1 M K E h , Γ ¯ [ r ] s = 1 r s k Σ k s s = 1 h s = 0 j s G s , k s , h s j s j s ! M G s E h s , r s K s = 1 r s k Σ k s s = 1 h s = 0 j s = 0 | G s , k s , h s ( j s ) | j s ! r s h s < K s = 1 r s k Σ s = 1 K s < K + 1 s = 1 r s k Σ
for all a s r s < a s b s , s I . Thus, the Cannon function for the GKPEBPs K E k [ z ] is given by
χ ( K E k , Γ ¯ [ r ] ) = lim sup k { ψ K E k , Γ ¯ [ r ] } 1 k Σ s = 1 k r s , a s r s a s b s
but χ ( K E k , Γ ¯ [ r ] ) s = 1 k r s . Therefore, χ ( K E k , Γ ¯ [ r ] ) = s = 1 k r s , a s r s a s b s and the GKPEBP K E k [ z ] is effective in the polycylinder Γ [ r ] for all a s r s a s b s .
When r s < a s or r s a s b s for some s I , the GKPEBPs K E k [ z ] may fail to be effective in the polycylinder Γ ¯ [ r ] . We illustrate this with the following example.
Example 5. Consider the bases G s , k s z s , s I , constructed as follows:
G s , k s z s = 1 , k s = 0 h s = 0 s M a k s h s b h s z s h s , k s 0 , s I
Now, the Cannon sum of the GKPEBPs K E k [ z ] for the equi-polyclyinder Γ ¯ [ r ] * will be such that
ψ K E k , Γ ¯ [ r ] * = r k Σ ( 1 ) max α , β , Γ ¯ [ r * ] h = α β K E k , h 1 K E h [ z ] r k Σ ( 1 ) | K E k , 0 1 | M K E 0 , Γ ¯ [ r ] * = r k Σ ( 1 ) s = 1 | G s E k s , 0 1 | M G s E 0 , r r k Σ ( 1 ) s = 1 j s = 1 ( 1 ) j s G s , k s j s j s ! e G s 0 , 0 = a r 1 k Σ s = 1 e ( 1 b ) 1 1 e M ( 1 b ) 1 1 1 b 2
Thus, χ K E , Γ ¯ [ r ] * a r 1 > r k for r < a , and the GKPEBPs K E k [ z ] is not effective in Γ ¯ [ r ] * for r < a .
Moreover, applying (25) in the Cannon sum of the GKPEBPs K E k [ z ] , it follows that
ψ K E k , Γ ¯ [ r ] * r k Σ ( 1 ) K E k 1 , k M K E k , Γ ¯ [ r ] * = r k Σ ( 1 ) s = 1 G s E k s , k s 1 M G s E k s , r r k Σ ( 1 ) s = 1 j s = 1 ( 1 ) j s G s , k s , k s j s j s ! e G s k s , k s k Σ r k s k Σ K b r ( k 1 ) k Σ ( b r ) k Σ 2 a k Σ e k Σ 2 K b Na b k 1 k Σ b Na b k Σ 2 a k Σ k Σ 2 = K a k b k 2 k Σ N k Σ k Σ 2 , r = N a b , N > 1
Thus,
χ K E , N a b * a k b k 2 lim k Σ N 1 + k Σ = ,
which implies that the GKPEBPs K E k [ z ] is not effective in Γ ¯ [ r ] * , r > a b . Hence, the result is fully established. □

7. Effectiveness of the General Kronecker Product of Algebraic Bases of Polynomials in Closed Polycylinders

The base of polynomials G k [ z ] is called algebraic of degree j when its matrix of coefficients G satisfies the usual identity of least degree
α 0 G j + α 1 G j 1 + + α j I = 0
Thus, we have a relation of the form
G 1 k , h = δ k , h γ 0 + s = 1 j 1 γ s G k , h ( s )
where G k , h ( s ) denote the elements of the power matrix G ( s ) and γ s , s = 0 , 1 , 2 , , j 1 , are constant numbers.
When G s , k s z s , s I are the algebraic general bases, then the product
K k [ z ] = s = 1 G s , k s z s
defines the general Kronecker product of algebraic bases of polynomials (GKPABP).
Theorem 6.
The GKPABPs K k [ z ] , whose constituents are all algebraic general bases of polynomials will be effective in the closed polycylinder Γ ¯ [ r ] for all a s < r s < a s b s , s I when the elements of the matrices of coefficients G s , k s , h s , s I of the general constituent bases G s , k s ( z s ) , s I satisfy (20) and may not be effective in Γ ¯ [ r ] for all r s < a s or r s a s b s , s I .
Proof. 
Suppose that the GBPs G s , k s z s , s I are algebraic and obey the condition (20), then there exists a representation of the form:
G s , k s , h s 1 = j s = 0 N s C j s G s , k s , h s ( j s )
where C j , j s = 0 , 1 , 2 , , N s are constants and G s 1 = G s , k s , h s 1 is the matrix of operators of the base G s , k s z s , s I . Now, since G s , k s z s satisfy the condition (20), then we have
M G s , k s , r s = max z s = r s h s = 0 G s , k s , h s z s h s M b = 0 a s k s h s b s r s h s < M 1 b s 1 + 1 b s r s a s 1 r s m < K r k s
for all a s < r s < a s b s . A combination among (22), (24), (26) and (27) in the Cannon sum of the GKPABPs K k [ z ] yields
ψ K k , Γ ¯ [ r ] = s = 1 r s k Σ k s max α , β , Γ ¯ [ r ] h = α β K k , h 1 K h [ z ] s = 1 r s k Σ k s h = 0 K k , h 1 M K h , [ r ] s = 1 r s k Σ k s s = 1 h s = 0 G s , k s , h s 1 M G s , h s , r s s = 1 r s k Σ k s s = 1 h s = 0 j s = 0 N s C j s G s , k s , h s ( j s ) M G s , h s , r s K s = 1 r s k Σ k s s = 1 h s = 0 j s = 0 N s C j s M j s ( 1 b s ) ( j s 1 ) a s k s h s ( b s r s ) h s = K s = 1 r s k Σ k s s = 1 C ( N s + 1 ) M N s ( 1 b s ) ( N s 1 ) h s = 0 a s k s h s b s h s r s h s K s = 1 r s k Σ ,
where C = max 0 j s N s , s I C j s . Thus, the Cannon function χ ( K , Γ ¯ [ r ] ) of the set K k [ z ] will accord to the following inequality
χ ( K , Γ ¯ [ r ] ) s = 1 k x s
for all a s r s < a s b s , s I . Therefore, the theorem is deduced.
If r s < a s or r s a s b s for some s I , the GKPABPs K E k [ z ] may not be effective in the polycylinder Γ ¯ [ r ] . To illustrate this, we refer to Example 6.1 and proceed using analogous steps. □

8. Mode of Increase and the T ρ -Property of GKPBPs

We determine the order and type of the GKPBPs K k [ z ] in relation with the constituent GBPs G s , k s z s . Suppose that the GBPs G s , k s z s are of respective increase orders ( f s ) and types ( g s ) . Moreover, let the G 1 , k 1 z 1 have the greatest rate of increase. In other words, we consider either f 1 > f 2 , f 3 , , f k or f 1 = f 2 = f 3 = = f k and g 1 > g 2 > g 3 > > g k or g 1 = g 2 = g 3 = = g k . We now evaluate the order F and type G of the GKPBPs in terms of the increase in the constituents.
Definition 5.
The order F of the base of polynomials G K [ z ] in the closed polycylinder Γ ¯ [ α r ] is given by
F = lim r lim sup k Σ log ψ G k , Γ ¯ [ α r ] k Σ log k Σ .
If 0 < F < , then the type G of the base of polynomial is given by
G = lim r e F lim sup k Σ { ψ G k , Γ ¯ [ α r ] } 1 Ω k Σ k Σ .
Remark 1.
Note that when the GBP G k [ z ] is of finite order F and finite type G, then it represents every entire function of order less than 1 F and type less than 1 G in any finite polycylinder.
Theorem 7.
Let G s , k s z s , s I be GBPs of respective increase orders f s and types g s , where G 1 , k 1 z 1 has the greater rate of increase. Then the order F of the GKPBPs K k [ z ] equals f 1 and the type G is determined as follows:
(i) 
If f 1 1 2 , then G = g 1 .
(ii) 
If f 1 < 1 2 , then g 1 G g 1 2 1 2 f 1 1 .
Proof. 
The proof can be carried out very similarly to the case of hyper-elliptical regions (see [52]); therefore, it is omitted. □
Now, we define the T ρ -property of the GBPs G k [ z ] in Γ ¯ [ r ] as follows:
Definition 6.
If the GBP G k [ z ] represents all entire functions of order less than ρ in Γ ¯ [ r ] , then it is said to have property T ρ in Γ ¯ [ r ] .
Let
F G , Γ ¯ [ r ] = lim sup k Σ log ψ G k , Γ ¯ [ r ] k Σ log k Σ .
The following theorem gives the property T ρ of the base G k [ z ] .
Theorem 8.
A GBP G k [ z ] is said to have the property T ρ for all entire functions of order less than ρ in Γ ¯ [ r ] if and only if F ( G , Γ ¯ [ r ] ) 1 ρ .
Proof. 
As the proof closely parallels that for complete Reinhardt domains (polycylindrical regions) (see [27]), it is omitted. □
Next, we construct the T ρ -property of the GKPBPs in K k [ z ] in closed polycylinder Γ ¯ [ r ] in terms of the T ρ -property of their constituents in z s r s , s I .
Theorem 9.
Let G s , k s z s , s I be the GBPs and suppose that K k [ z ] is their GKPBPs. Then the base K k [ z ] has T ρ -property in Γ ¯ [ r ] iff the bases G s , k s z s have the property T ρ s in z s r s , where s I and ρ = min { ρ s , s J } .
Proof. 
The proof proceeds in much the same way as in the case of hyper-elliptical regions (see [52]) and is therefore omitted. □
To illustrate Theorems 7 and 8, we provide examples involving certain special functions.
Example 6.
The order, the type and T ρ -property were determined for certain special polynomials such as Bernoulli polynomials { B s , k s ( z ) } [51], the Euler polynomials { E s , k s ( z ) } [51] and Gontcharoff polynomials { G s , k s z s } (when | t s | = 1 , ) [56]. Table 1 below lists these details, and according to Theorems 7 and 8, we conclude the corresponding properties of the general Kronecker product bases constructed via these special polynomials.
Note that μ in the last two rows of Table 1 denotes the modulus of a zero of the function f ( z s ) = k s = 0 t s k s ( k s 1 ) 2 z s k s k s ! of least modulus.
Remark 2.
Similar results for the GKPBPs { K k [ z ] } in hyper-elliptical regions can be obtained when the constituent bases are taken to be GBPs. This is considered a generalization of a recent study published in [52], extending the Cannon–Kronecker product bases to the generalized Kronecker product bases in hyper-elliptical regions.

9. Closing Remarks and Conclusions

In this study, I developed and analyzed generalized Kronecker product bases of polynomials within polycylindrical regions, offering substantial extensions of the classical Cannon–Kronecker framework. Our investigation into the convergence of infinite series generated by these generalized bases across a variety of polycylindrical domains, both open and closed, has revealed rich analytic structures governed by properties such as order, type, and the T ρ -property. These findings contribute to a deeper understanding of the growth behavior and analytic character of polynomial bases in multidimensional settings. Furthermore, the broad utility and expressive capability of the generalized Kronecker product approach were demonstrated by applying this generalized theory to a wide class of classical special functions including Bernoulli, Euler, Gontcharoff, Bessel and Chebyshev polynomials. The results suggest promising avenues for further exploration, particularly in the approximation theory of multivariate analytic functions, as well as potential applications in mathematical physics and numerical analysis. This work lays a foundational platform for future studies aimed at refining and extending the use of Kronecker-based constructions in higher-dimensional function spaces.

Funding

This work is funded by the Deanship of Research and Graduate Studies at King Khalid University through Large Research Project under grant number RGP2/181/46.

Data Availability Statement

Data are contained within the article.

Acknowledgments

The author extends her appreciation to the Deanship of Research and Graduate Studies at King Khalid University for funding this work through Large Research Project under grant number RGP2/181/46.

Conflicts of Interest

The author declares that there are no conflicts of interest.

References

  1. Loan, C.F.V. The ubiquitous Kronecker product. J. Comput. Appl. Math. 2000, 123, 85–100. [Google Scholar] [CrossRef]
  2. Fernández, F.M. The Kronecker product and some of its physical applications. Eur. J. Phys. 2016, 37, 065403. [Google Scholar] [CrossRef]
  3. Regaliat, P.A.; Mitra, S.K. Kronecker products, unitary matrices and signal processing applications. SIAM Rev. 1989, 31, 586–613. [Google Scholar] [CrossRef]
  4. Nagy, J.G.; Ng, M.K.; Perrone, L. Kronecker product approximations for image restoration with reflexive boundary conditions. SIAM J. Matrix Anal. Appl. 2004, 25, 829–841. [Google Scholar] [CrossRef]
  5. Kolda, T.G.; Bader, B.W. Tensor decompositions and applications. SIAM Rev. 2009, 51, 455–500. [Google Scholar] [CrossRef]
  6. Magnus, J.R.; Neudeckery, H. Matrix Differential Calculus with Applications in Statistics and Econometrics; John Wiley & Sons: Hoboken, NJ, USA, 2019. [Google Scholar]
  7. Santos, C.C.; Dias, C.C. Matrix Multiplication without Size Restrictions: An Approach to the Kronecker Product for Applications in Statistics. J. Math. Stat. Res. 2022, 4, 156. [Google Scholar]
  8. Dehghan, M.; Hajarian, M. An iterative algorithm for the reflexive solutions of the generalized coupled Sylvester matrix equations and its optimal approximation. Appl. Math. Comput. 2008, 202, 571–588. [Google Scholar] [CrossRef]
  9. Jodar, L.; Abou-Kandil, H. Kronecker products and coupled matrix Riccati differential systems. Linear Algebra Its Appl. 1989, 121, 39–51. [Google Scholar] [CrossRef]
  10. Ding, F. Transformations between some special matrices. Comput. Math. Appl. 2010, 59, 2676–2695. [Google Scholar] [CrossRef]
  11. Shi, Y.; Fang, H.; Yan, M. Kalman filter-based adaptive control for networked systems with unknown parameters and randomly missing outputs. Int. J. Robust Nonlinear Control 2009, 19, 1976–1992. [Google Scholar] [CrossRef]
  12. Bentler, P.M.; Lee, S.Y. Matrix derivatives with chain rule and rules for simple, Hadamard, and Kronecker products. J. Math. Psychol. 1978, 17, 255–262. [Google Scholar] [CrossRef]
  13. Graham, A. Kronecker Products and Matrix Calculus with Applications; John Wiley & Sons: New York, NY, USA, 1982. [Google Scholar]
  14. Magnus, J.R.; Neudecker, H. Matrix differential calculus with applications to simple, Hadamard, and Kronecker products. J. Math. Psychol. 1985, 29, 474–492. [Google Scholar] [CrossRef]
  15. Steeb, W.-H.; Hardy, Y. Matrix Calculus and Kronecker Product. In A Practical Approach to Linear and Multilinear Algebra; World Scientific: River Edge, NJ, USA, 2011. [Google Scholar]
  16. Ding, F.; Chen, T. Iterative least-squares solutions of coupled Sylvester matrix equations. Syst. Control Lett. 2005, 54, 95–107. [Google Scholar] [CrossRef]
  17. Ding, F.; Chen, T. On iterative solutions of general coupled matrix equations. SIAM J. Control Optim. 2006, 44, 2269–2284. [Google Scholar] [CrossRef]
  18. Tyrtyshnikov, E. Kronecker-product approximations for some function-related matrices. Linear Algebra Its Appl. 2004, 379, 423–437. [Google Scholar] [CrossRef]
  19. Zhang, H.; Ding, F. On the Kronecker products and their applications. J. Appl. Math. 2013, 2013, 296185. [Google Scholar] [CrossRef]
  20. Cannon, B. On the convergence of series of polynomials. Proc. Lond. Math. Soc. 1937, 43, 348–365. [Google Scholar] [CrossRef]
  21. Cannon, B. On the representation of integral functions by general basic series. Math. Z. 1939, 45, 185–208. [Google Scholar] [CrossRef]
  22. Whittaker, J.M. On Series of polynomials. Q. J. Math. 1934, 5, 224–239. [Google Scholar] [CrossRef]
  23. Whittaker, J.M. Interpolatory Function Theory; Cambridge Tracts in Math. 33: London, UK, 1935. [Google Scholar]
  24. Whittaker, J.M. Sur Les Séries de Base de Polynômes Quelconques. In Collection de Monographies Sur la Theorie des Fonctions; Gattegno, C., Ed.; Gauthier-Villars. VI.: Paris, France, 1949. [Google Scholar]
  25. Ahmed, A.E. On Some Classes and Spaces of Holomorphic and Hyperholomorphic Functions. Ph.D Thesis, Bauhaus University, Weimar, Germany, 2003. [Google Scholar]
  26. Ahmed, A.E.; Kishka, Z.M.G. On the effectiveness of basic sets of polynomials of several complex variables in elliptical regions. Prog. Anal. 2003, 265–278. [Google Scholar] [CrossRef]
  27. Kishka, Z.M.G.; El-Sayed Ahmed, A. On the order and type of basic and composite sets of polynomials in complete reinhardt domains. Period Math. Hung. 2003, 46, 67–79. [Google Scholar] [CrossRef]
  28. Kishka, Z.G.; Saleem, M.A.; Abul-Dahab, M.A. On Simple Exponential Sets of Polynomials. Mediterr. J. Math. 2014, 11, 337–347. [Google Scholar] [CrossRef]
  29. Kumuyi, W.F.; Nassif, M. Derived and integrated sets of simple sets of polynomials in two complex variables. J. Approx. Theory 1986, 47, 270–283. [Google Scholar] [CrossRef]
  30. Nassif, M. Composite sets of polynomials of several complex variables. Publ. Math. Debr. 1971, 18, 43–52. [Google Scholar] [CrossRef]
  31. Sayyed, K.A.M. Basic Sets of Polynomials of Two Complex Variables and Their Convergence Properties. Ph.D. Thesis, Assiut University, Assiut, Egypt, 1975. [Google Scholar]
  32. Abul-Ez, M.A.; Constales, D. Basic sets of polynomials in Clifford analysis. Complex Var. Elliptic Equ. 1990, 14, 177–185. [Google Scholar] [CrossRef]
  33. Abul-Ez, M.A.; Constales, D. On the order of basic series representing Clifford valued functions. Appl. Math. Comput. 2003, 142, 575–584. [Google Scholar] [CrossRef]
  34. Hassan, G.F.; Zayed, M. Approximation of monogenic functions by hypercomplex Ruscheweyh derivative bases. Complex Var. Elliptic Equ. 2022, 68, 2073–2092. [Google Scholar] [CrossRef]
  35. Hassan, G.F.; Zayed, M. Expansions of generalized bases constructed via Hasse derivative operator in Clifford analysis. AIMS Math. 2023, 8, 26115–26133. [Google Scholar] [CrossRef]
  36. Hassan, G.F.; Abdel-Salam, E.; Rashwan, R. Approximation of functions by complex conformable derivative bases in Fréchet spaces. Math. Method. Appl. Sci. 2022, 46, 2636–2650. [Google Scholar] [CrossRef]
  37. Zayed, M.; Hassan, G.F. On the approximation of analytic functions by infinite series of fractional Ruscheweyh derivatives bases. AIMS Math. 2024, 9, 8712–8731. [Google Scholar] [CrossRef]
  38. Zayed, M.; Hassan, G.F.; Abdel-Salam, E.A.-B. On the convergence of series of fractional Hasse derivative bases in Fréchet spaces. Math. Meth. Appl. Sci. 2024, 47, 8366–8384. [Google Scholar] [CrossRef]
  39. Hassan, G.F. A note on the growth order of the inverse and product bases of special monogenic. Math. Methods Appl. Sci. 2012, 35, 286–292. [Google Scholar] [CrossRef]
  40. Abul-Ez, M.; Abdallab, M.; AL-Ahmadic, A. On The Representation of Monogenic Functions by The Product Bases of Polynomials. Filomat 2020, 34, 1209–1222. [Google Scholar] [CrossRef]
  41. Ahmed, A.E. Hadamard Product of Simple Sets of Polynomials in Cn. Theory Appl. Math. Comput. Sci. 2014, 4, 26–30. [Google Scholar]
  42. Abul-Dahab, M.A.; Saleem, A.M.; Kishka, Z.M. Effectiveness of Hadamard product of basic sets of polynomials of several complex variables in hyperelliptical regions. Electrumic J. Math. Anal. Appl. 2015, 3, 52–65. [Google Scholar]
  43. Zayed, M. Lower Growth of Generalized Hadamard Product Functions in Clifford Setting. Bull. Malays. Math. Sci. Soc. 2020, 44, 805–826. [Google Scholar] [CrossRef]
  44. Zayed, M. Generalized Hadamard Product Bases of Special Monogenic Polynomials. Adv. Appl. Clifford Algebr. 2020, 30, 805–826. [Google Scholar] [CrossRef]
  45. Saleem, M.A.; Abul-Ez, M.; Zayed, M. On polynomial series expansions of Cliffordian functions. Math. Methods Appl. Sci. 2012, 35, 134–143. [Google Scholar] [CrossRef]
  46. Zayed, M.; Hassan, G.F. Equivalent base expansions in the space of Cliffordian functions. Axioms 2023, 6, 544. [Google Scholar] [CrossRef]
  47. Abd-El-Monem, A.A.; Nassif, M. On the convergence of certain classes of Gontcharoff polynomials. Indag. Math. 1965, 68, 615–621. [Google Scholar] [CrossRef]
  48. Abdalla, M.; Abul-Ez, M.A.; Morais, J. On the construction of generalized monogenic Bessel polynomials. Math. Methods Appl. Sci. 2018, 41, 9335–9348. [Google Scholar] [CrossRef]
  49. Abul-Ez, M.A. Bessel polynomial expansions in spaces of holomorphic functions. J. Math. Anal. Appl. 1998, 221, 177–190. [Google Scholar] [CrossRef]
  50. Abul-Ez, M.A.; Zayed, M. Criteria in Nuclear Fréchet spaces and Silva spaces with refinement of the Cannon–Whittaker theory. J. Funct. Spaces 2020, 2020, 15. [Google Scholar] [CrossRef]
  51. Hassan, G.F.; Aloui, L. Bernoulli and Euler polynomials in Clifford analysis. Adv. Appl. Clifford Algebr. 2015, 25, 351–376. [Google Scholar] [CrossRef]
  52. Zayed, M.; Hassan, G.F. Kronecker product bases and its applications in approximation theory. Electron. Res. Arch. 2025, 33, 1070–1092. [Google Scholar] [CrossRef]
  53. Henderson, H.V.; Pukelsheim, F.; Searle, S.R. On the History of the Kronecker Product. Linear Multilinear Algebra 1983, 14, 113–120. [Google Scholar] [CrossRef]
  54. Holmquist, B. The direct product permuting matrices. Linear Multilinear Algebra 1985, 17, 117–141. [Google Scholar] [CrossRef]
  55. Horn, R.A.; Johnson, C.R. Topics in Matrix Analysis; Cambridge University Press: Cambridge, UK, 1991. [Google Scholar]
  56. Nassif, M. A Class of a Gontcharoff Polynomials; Assiut University Bulletin of Science and Technology: Assiut, Egypt, 1958; Volume 1, pp. 1–8. [Google Scholar]
Table 1. Order, type and T ρ -property of certain bases.
Table 1. Order, type and T ρ -property of certain bases.
Polynomial’s NameOrderType T ρ -Property
Bernoulli polynomials { B s , k s ( z ) } 1 1 2 π T 1
K k ( B ) [ z ] = s = 1 B s , k s z s 1 1 2 π T 1
Euler polynomials { E s , m s ( z ) } 1 1 π T 1
K k ( E ) [ z ] = s = 1 E s , k s z s 1 1 π T 1
Gontcharoff polynomials { G s , k s z s } 1 | a | μ , T 1
K k ( G ) [ z ] = s = 1 G s , k s z s 1 | a | μ , T 1
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zayed, M. A Novel Approach to Polynomial Approximation in Multidimensional Cylindrical Domains via Generalized Kronecker Product Bases. Axioms 2025, 14, 750. https://doi.org/10.3390/axioms14100750

AMA Style

Zayed M. A Novel Approach to Polynomial Approximation in Multidimensional Cylindrical Domains via Generalized Kronecker Product Bases. Axioms. 2025; 14(10):750. https://doi.org/10.3390/axioms14100750

Chicago/Turabian Style

Zayed, Mohra. 2025. "A Novel Approach to Polynomial Approximation in Multidimensional Cylindrical Domains via Generalized Kronecker Product Bases" Axioms 14, no. 10: 750. https://doi.org/10.3390/axioms14100750

APA Style

Zayed, M. (2025). A Novel Approach to Polynomial Approximation in Multidimensional Cylindrical Domains via Generalized Kronecker Product Bases. Axioms, 14(10), 750. https://doi.org/10.3390/axioms14100750

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop