Next Article in Journal
Some New Oscillation Results for Fourth-Order Neutral Differential Equations with Delay Argument
Next Article in Special Issue
A Collocation Method Using Radial Polynomials for Solving Partial Differential Equations
Previous Article in Journal
Research on Stress Characteristics of Segment Structure during the Construction of the Large-Diameter Shield Tunnel and Cross-Passage
Previous Article in Special Issue
Durrmeyer-Type Generalization of Parametric Bernstein Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Explicit Properties of q-Cosine and q-Sine Euler Polynomials Containing Symmetric Structures

by
Cheon Seoung Ryoo
1 and
Jung Yoog Kang
2,*
1
Department of Mathematics, Hanman University, Daejeon 10216, Korea
2
Department of Mathematics Education, Silla University, Busan 469470, Korea
*
Author to whom correspondence should be addressed.
Symmetry 2020, 12(8), 1247; https://doi.org/10.3390/sym12081247
Submission received: 27 June 2020 / Revised: 25 July 2020 / Accepted: 25 July 2020 / Published: 28 July 2020
(This article belongs to the Special Issue Polynomials: Special Polynomials and Number-Theoretical Applications)

Abstract

:
In this paper, we introduce q-cosine and q-sine Euler polynomials and determine identities for these polynomials. From these polynomials, we obtain some special properties using a power series of q-trigonometric functions, properties of q-exponential functions, and q-analogues of the binomial theorem. We investigate the approximate roots of q-cosine Euler polynomials that help us understand these polynomials. Moreover, we display the approximate roots movements of q-cosine Euler polynomials in a complex plane using the Newton method.

1. Introduction

In 1990, Jackson who published influential papers on the subject introduced the q-number and its notation stems, see [1]. Floreanini and Vinet found that some properties of q-orthogonal polynomials are connected to the q-oscillator algebra in [1,2,3,4]. We begin by introducing several definitions related to q-numbers used in this paper, see [3,5,6,7,8].
Throughout this paper, the symbols, N , Z , R and C denotes the set of natural numbers, the set of integers, the set of real numbers and the set of complex numbers, respectively.
For a C , n N and | q | < 1 , the q-shifted factorial is defined by
( a ; q ) 0 = 1 , ( a ; q ) n = j = 0 n 1 ( 1 q j a ) , ( a ; q ) = j = 0 ( 1 q j a ) .
It is well known that
( a ; q ) n = k = 0 n n k q q ( 1 / 2 ) k ( k 1 ) ( 1 ) k a k .
Let x , q R with q 1 . The number
[ x ] q = 1 q x 1 q
is called q-number. We note that lim q 1 [ x ] q = x . In particular, for k Z , [ k ] q is a q-integer.
After the appearance of q-numbers, many mathematicians have studied topics such as q-differential equations, q-series, and q-trigonometric functions. Of course, mathematicians also constructed and researched q-Gaussian binomial coefficients, see [2,3,4,7,8,9,10,11].
Definition 1.
For r m and m , r N , the q-Gaussian binomial coefficients are defined by
m r q = ( q ; q ) m ( q ; q ) m r ( q ; q ) r .
For r = 0 , we note that m 0 q = 0 with 0 r m , and also, we note that [ n ] q ! = [ n ] q [ 2 ] q [ 1 ] q and [ 0 ] q !=1.
Definition 2.
Let 0 < | q | < 1 and | z | < 1 | 1 q | . Then, the q-exponential function is defined by
e q ( z ) = n = 0 z n [ n ] q ! = k = 0 1 ( 1 ( 1 q ) q k z ) .
For 0 < q < 1 and | z | < 2 1 q , the other form of q-exponential function can be defined as
E q ( z ) = e q 1 ( z ) = n = 0 q n 2 z n [ n ] q ! = k = 0 ( 1 + ( 1 q ) q k z ) .
We note that lim q 1 e q ( z ) = e z . Exponential function is expanded to the power series expressions of the two q-exponential functions by combining with q-numbers. Also, q-derivatives and q-integrals were extensively studied by many mathematicians, see [1,5,12]. Following the determination of the limit formulas for q-exponential functions taken from Rawlings [10], several other interesting q-series expansions were presented in the classical book by Andrews [5].
Theorem 1.
From Definition 2, we note that
( i ) e q ( x ) e q ( y ) = e q ( x + y ) , i f y x = q x y . ( i i ) e q ( x ) E q ( x ) = 1 .
The proof of Theorem 1 and more properties of q-exponential functions can be found in [2,13].
Definition 3.
For real variable function f where x 0 , the q-derivative operator is defined as
D q f ( x ) = f ( x ) f ( q x ) ( 1 q ) x .
We note that D q f ( 0 ) = f ( 0 ) . It is possible to prove that f is differentiable at 0 and it is clear that D q x n = [ n ] q x n 1 .
In 2002, Kac and Pokman published a book about quantum calculus including q-derivatives and q-analogue of ( x a ) n and q-trigonometric functions, see [14].
Definition 4.
Let n be a nonnegative integer. The q-analogues of subtraction and addition are defined by
( i )   ( x a ) q n = { 1 i f n = 0 ( x a ) ( x q a ) ( x q n 1 a ) i f n 1 = k = 0 n n k q ( 1 ; q ) k ( 1 ; q ) n k 2 n x k a n k , ( i i )   ( x a ) q n = 1 i f n = 0 ( x + a ) ( x + q a ) ( x + q n 1 a ) i f n 1 = k = 0 n n k q ( 1 ; q ) k ( 1 ; q ) n k 2 n x k ( a ) n k , r e s p e c t i v e l y .
Definition 5.
Let x R and i = 1 . Then, the q-trigonometric functions are defined by
sin q ( x ) = e q ( i x ) e q ( i x ) 2 i , sin q ( x ) = E q ( i x ) E q ( i x ) 2 i cos q ( x ) = e q ( i x ) + e q ( i x ) 2 , cos q ( x ) = E q ( i x ) + E q ( i x ) 2 ,
where sin q ( x ) = sin q 1 ( x ) , cos q ( x ) = cos q 1 ( x ) .
Theorem 2.
Using Theorem 1 ( i i ) and applying the chain rule, we have
( i ) cos q ( x ) cos q ( x ) + sin q ( x ) sin q ( x ) = 1 . ( i i ) D q sin q ( x ) = cos q ( x ) , D q sin q ( x ) = cos q ( x ) , D q cos q ( x ) = sin q ( x ) , D q cos q ( x ) = sin q ( x ) .
Moreover, we note Theorem 2 ( i ) is the q-analogue of the identity sin 2 x + cos 2 x = 1 , see [3,4,7].
In 2004, Gasper and Rahman introduced a comprehensive account of the basic q-hypergeometric series, see [4]. During the last three decades, one of the bridges between science and applied mathematics has been q-calculus, see [10]. Based on the above concepts, many mathematicians explored various fields of mathematics including q-differential equations, q-series, q-hypergeometric functions, and q-gamma and q-beta functions. Moreover, various discrete distributions combining q-numbers can be found in [2]. Therefore, q-calculus plays an important role in many different areas of mathematics.
Many researchers who studied the Bernoulli, Euler, and Genocchi polynomials in various fields realized the important role of q-calculus in mathematics. For a long time, the topics of Bernoulli, Euler, and Genocchi polynomials have been extensively researched in many mathematical applications including analytical number theory, combinatorial analysis, p-adic analytic number theory, and other fields. Therefore, many mathematicians have started researching Bernoulli, Euler, and Genocchi polynomials combining q-numbers, see [9,13,15,16,17,18,19,20,21].
The following diagram briefly explains the relation between the various types of degenerate Euler polynomials, Euler polynomials, and q-Euler polynomials. The polynomials in the first row are researched by Calitz [21], Kim and Ryoo [16], respectively. The study of the second row of the diagram has brought about beneficial results in combinatorics and number theory. In particular, the cosine and sine Euler polynomials in the second row of the diagram contain a motive in this paper. This is because we hold several questions regarding what is a definition form of q-cosine and q-sine Euler polynomials and what is different properties between the q-cosine, q-sine Euler polynomials and the cosine, sine Euler polynomials.
The main subject of this paper is to construct q-cosine and q-sine Euler polynomials using Definitions 4 and 5. Also, we derive identities and properties for these polynomials in the third row of the diagram.
Symmetry 12 01247 i001
The definition of q-Euler polynomials of the third row are as follows.
Definition 6.
The q-Euler numbers and polynomials are defined respectively as see [19]
n = 0 E n , q t n n ! = 2 e q ( t ) + 1 , n = 0 E n , q ( z ) t n n ! = 2 e q ( t ) + 1 e q ( t z ) ,
.
Recently, Kim and Ryoo introduced the basic concepts of cosine and sine Euler polynomials. In [16], the definitions and representative properties of cosine and sine Euler polynomials are as follows.
Definition 7.
The cosine Euler polynomials E n ( C ) ( x , y ) and the sine Euler polynomials E n ( S ) ( x , y ) are defined by means of the generating functions
n = 0 E n ( C ) ( x , y ) t n n ! = 2 e t + 1 e t x cos ( t y ) , n = 0 E n ( S ) ( x , y ) t n n ! = 2 e t + 1 e t x sin ( t y ) .
In this paper, we denote that E n ( C ) ( x , y ) = C E n ( x , y ) and E n ( S ) ( x , y ) = S E n ( x , y ) .
Theorem 3.
For n 1 , we have
( i ) E n ( C ) ( x + 1 , y ) E n ( C ) ( x , y ) = 2 C n ( x , y ) , ( i i ) E n ( S ) ( x + 1 , y ) E n ( S ) ( x , y ) = 2 S n ( x , y ) .
Based on [16], which contains Definition 7 and Theorem 3, many researchers found various expanded numbers and polynomials and their identities, see [15,20].
The main goal of this paper is to find various properties of q-cosine and q-sine Euler polynomials such as addition theorem, partial q-derivative, basic symmetric properties so on. In Section 2, we construct q-cosine and q-sine Euler polynomials. Then, using q-calculus, we identify basic properties of these polynomials. Section 3 presents an investigation of the special properties of q-cosine and q-sine Euler polynomials such as the identity of q-sine Euler polynomials using q-analogues of subtraction and addition. This is based on the properties of q-trigonometric and q-exponential functions. Moreover, we derive relationships between q-cosine and q-sine Euler polynomials and q-cosine and q-sine Bernoulli polynomials. In Section 4, we display the structure of approximate roots for q-cosine and q-sine Euler polynomials and find properties of these polynomials. We present some figures of the approximate roots of these polynomials in a complex plane using Newton’s method.

2. Some Basic Properties of q-cosine and q-sine Euler Polynomials

In this section, we construct the q-cosine and q-sine Euler polynomials by using Theorem 4. From the generating functions of these polynomials, we obtain some basic properties and identities. Moreover, we derive symmetric properties and partial q-derivatives for q-cosine and q-sine Euler polynomials.
Definition 8.
The generating functions of q-cosine Euler polynomials and q-sine Euler polynomials are correspondingly defined by
n = 0 C E n , q ( x , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) a n d n = 0 S E n , q ( x , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) S I N q ( t y ) .
From Definition 8, q-sine Euler polynomials can be confirmed as the following:
S E 0 , q ( x , y ) = 0 , S E 1 , q ( x , y ) = y 1 + q , S E 2 , q ( x , y ) = ( 1 + q + q 2 2 x ) y 2 ( 1 + q + q 2 ) , S E 3 , q ( x , y ) = y ( 1 + 2 x + 2 q x 4 x 2 + q 2 ( 1 + 2 x ) + q 5 ( 1 + 4 y 2 ) + q 3 ( 1 + 2 x + 4 y 2 ) ) 4 ( 1 + q ) ( 1 + q 2 ) , .
We will introduce the certain form of q-cosine Euler polynomials in Section 4. The motivation to derive the definition of q-cosine Euler polynomials and q-sine Euler polynomials can be found in Theorem 4.
Theorem 4.
For x , y R and i = 1 , we have
( i ) n = 0 E n , q ( ( x i y ) q ) + E n , q ( ( x i y ) q ) 2 t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) , ( i i ) n = 0 E n , q ( ( x i y ) q ) E n , q ( ( x i y ) q ) 2 i t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) S I N q ( t y ) .
Proof. 
( i ) We defined the generating function of q-Euler polynomials in Definition 6. Let us substitute ( x i y ) q instead of z in the q-Euler polynomials. By using a property of q-analogues of the sine and cosine functions and by using Definition 1, we can find
n = 0 E n , q ( ( x i y ) q ) t n [ n ] q ! = 2 e q ( t ) + 1 n = 0 ( x i y ) q n t n [ n ] q ! = 2 e q ( t ) + 1 n = 0 k = 0 n n k q q n k 2 x k ( i y ) n k t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) E q ( i t y ) = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) + i S I N q ( t y ) .
By using a similar method as when finding Equation (17), we can also obtain
n = 0 E n , q ( ( x i y ) q ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) E q ( i t y ) = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) i S I N q ( t y ) .
( i i ) We can prove Theorem 4 ( i i ) through Equations (17) and (18). ☐
Remark 1.
From the Theorem 4 and Definition 8, the following holds
( i ) C E n , q ( x , y ) = E n , q ( ( x i y ) q ) + E n , q ( ( x i y ) q ) 2 ( i i ) S E n , q ( x , y ) = E n , q ( ( x i y ) q ) E n , q ( ( x i y ) q ) 2 i .
In [15], C n , q ( x , y ) and S n , q ( x , y ) are defined as follows:
( i ) n = 0 C n , q ( x , y ) t n [ n ] q ! = e q ( t x ) C O S q ( t y ) , ( i i ) n = 0 S n , q ( x , y ) t n [ n ] q ! = e q ( t x ) S I N q ( t y ) .
Theorem 5.
For any real numbers x , y , we have
( i ) C E n , q ( x , y ) = k = 0 n n k q E k , q C n k , q ( x , y ) , ( i i ) S E n , q ( x , y ) = k = 0 n n k q E k , q S n k , q ( x , y ) ,
where E n , q is the q-Euler numbers.
Proof. 
( i ) From the generating function of q-cosine Euler polynomials, we can find a relation between the q-Euler numbers and C n , q ( x , y ) as follows.
n = 0 C E n , q ( x , y ) t n [ n ] q ! = n = 0 C E n , q t n [ n ] q ! n = 0 C n , q ( x , y ) t n [ n ] q ! = n = 0 k = 0 n n k q E k , q C n k , q ( x , y ) t n [ n ] q ! ,
and we obtain the required result of Theorem 5 ( i ) .
( i i ) We also find a relation between the q-Euler numbers and S n , q ( x , y ) in a similar way as in the proof of ( i ) and we have the required result. ☐
Theorem 6.
For a nonnegative integer k and | q | < 1 , we derive
( i ) C E n , q ( x , y ) = k = 0 [ n 2 ] n 2 k q ( 1 ) k q ( 2 k 1 ) k y 2 k E n 2 k , q ( x ) , ( i i ) S E n , q ( x , y ) = k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k q ( 2 k + 1 ) k y 2 k + 1 E n ( 2 k + 1 ) , q ( x ) ,
where [ x ] is the greatest integer not exceeding x and E n , q ( x ) is the q-Euler polynomials.
Proof. 
( i ) From the generating function of q-Euler polynomials, we can change the q-cosine Euler polynomials as follows
n = 0 C E n , q ( x , y ) t n [ n ] q ! = n = 0 E n , q ( x ) t n [ n ] q ! C O S q ( t y ) .
By using the power series of C O S q ( x ) , the right-hand side of Equation (24) is transformed as
n = 0 E n , q ( x ) t n [ n ] q ! n = 0 ( 1 ) n q ( 2 n 1 ) n y 2 n t 2 n [ 2 n ] q ! = n = 0 k = 0 n n + k 2 k q ( 1 ) k q ( 2 k 1 ) k y 2 k E n k , q ( x ) t n + k [ n + k ] q ! = n = 0 k = 0 [ n 2 ] n 2 k q ( 1 ) k q ( 2 k 1 ) k y 2 k E n 2 k , q ( x ) t n [ n ] q ! ,
and we complete the proof of Theorem 6 ( i ) .
( i i ) By applying the power series of S I N q ( x ) in the generating function of q-sine Euler polynomials, we have
n = 0 S E n , q ( x , y ) t n [ n ] q ! = n = 0 E n , q ( x ) t n [ n ] q ! n = 0 ( 1 ) n q ( 2 n + 1 ) n y 2 n + 1 t 2 n + 1 [ 2 n + 1 ] q ! = n = 0 k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k q ( 2 k + 1 ) k y 2 k + 1 E n 2 ( k + 1 ) , q ( x ) t n [ n ] q ! ,
and we finish the proof of Theorem 6 ( i i ) . ☐
Corollary 1.
Let y = 1 in Theorem 6. Then, the following holds
( i ) C E n , q ( x , 1 ) = k = 0 [ n 2 ] n 2 k q ( 1 ) k q ( 2 k 1 ) k E n 2 k , q ( x ) , ( i i ) S E n , q ( x , 1 ) = k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k q ( 2 k + 1 ) k E n ( 2 k + 1 ) , q ( x ) ,
where [ x ] is the greatest integer not exceeding x and E n , q ( x ) is the q-Euler polynomials.
Theorem 7.
Let x , y R , | q | < 1 , and e q ( t ) 1 . Then, we have
( i ) C n , q ( x , y ) = 1 2 k = 0 n n k q C E k , q ( x , y ) + C E n , q ( x , y ) , ( i i ) S n , q ( x , y ) = 1 2 k = 0 n n k q S E k , q ( x , y ) + S E n , q ( x , y ) .
Proof. 
( i ) When e q ( t ) 1 , we can consider the generating function of the q-cosine Euler polynomials to be
n = 0 C E n , q ( x , y ) t n [ n ] q ! ( e q ( t ) + 1 ) = 2 e q ( t x ) C O S q ( t y ) .
The left-hand side of Equation (29) is changed as follows.
n = 0 k = 0 n n k q C E k , q ( x , y ) + C E n , q ( x , y ) t n [ n ] q ! = n = 0 C E n , q ( x , y ) t n [ n ] q ! ( e q ( t ) + 1 ) .
The right-hand side of (29) is transformed as
2 e q ( t x ) C O S q ( t y ) = 2 n = 0 C n , q ( x , y ) t n [ n ] q ! .
By using Equations (30) and (31), we find the required result.
( i i ) In a similar method as in the proof of ( i ) , we have
n = 0 S E n , q ( x , y ) t n [ n ] q ! ( e q ( t ) + 1 ) = 2 e q ( t x ) S I N q ( t y ) .
Then, we obtain
n = 0 k = 0 n n k q S E k , q ( x , y ) + S E n , q ( x , y ) t n [ n ] q ! = 2 n = 0 S n , q ( x , y ) t n [ n ] q ! .
Therefore, we finish the proof of Theorem 7 ( i i ) . ☐
Corollary 2.
If q 1 in Theorem 7, we have
( i ) C n ( x , y ) = 1 2 k = 0 n n k C E k ( x , y ) + C E n ( x , y ) , ( i i ) S n ( x , y ) = 1 2 k = 0 n n k S E k ( x , y ) + S E n ( x , y ) ,
where C E n ( x , y ) is the cosine Euler polynomials and S E n ( x , y ) is the sine Euler polynomials.
Theorem 8.
For any real number x , y and | q | < 1 , we have
( i ) x C E n , q ( x , y ) = [ n ] q C E n 1 , q ( x , y ) , y C E n , q ( x , y ) = [ n ] q S E n 1 , q ( x , q y ) . ( i i ) x S E n , q ( x , y ) = [ n ] q S E n 1 , q ( x , y ) , y S E n , q ( x , y ) = [ n ] q C E n 1 , q ( x , q y ) .
Proof. 
( i ) For any real number x, we can find the partial q-derivative for q-cosine Euler polynomials as
n = 0 x C E n , q ( x , y ) t n [ n ] q ! = 2 e q ( t ) + 1 C O S q ( t y ) x e q ( t x ) = 2 t e q ( t ) + 1 e q ( t x ) C O S q ( t y ) .
Using the q-derivative of the q-cosine function, we find
D q C O S q ( t y ) = t S I N q ( q t y ) .
From Equation (37), we get
n = 0 y C E n , q ( x , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) y C O S q ( t y ) = 2 t e q ( t ) + 1 e q ( t x ) S I N q ( q t y )
and we obtain the required results.
( i i ) We also consider the partial q-derivative of q-sine Euler polynomials as
n = 0 x S E n , q ( x , y ) t n [ n ] q ! = 2 t e q ( t ) + 1 e q ( t x ) S I N q ( t y ) ,
and note that D q S I N q ( t y ) = t C O S q ( q t y ) . Then, we obtain the results of Theorem 8. ☐
In [18], Liu and Wang studied some symmetric properties of the Bernoulli and Euler polynomials. Based on the above paper, we observe some symmetric properties of the q-cosine and q-sine Euler polynomials. Moreover, symmetric properties can be found in the cosine and sine Euler polynomials.
Theorem 9.
For any integers a , b , we have
( i ) k = 0 n n k q a n k b k C E n k , q ( b x , b y ) C E k , q ( a x , a y ) = k = 0 n n k q b n k a k C E n k , q ( a x , a y ) C E k , q ( b x , b y ) , ( i i ) k = 0 n n k q a n k b k S E n k , q ( b x , b y ) S E k , q ( a x , a y ) = k = 0 n n k q b n k a k S E n k , q ( a x , a y ) S E k , q ( b x , b y ) .
Proof. 
( i ) To find a symmetric property, we assume form A such that
A : = 4 e q ( a b t x ) C O S q ( a b t y ) 2 ( e q ( a t ) + 1 ) ( e q ( b t ) + 1 ) .
By considering the generating function of q-cosine Euler polynomials in Equation (41), we can find the following equation:
A = 2 e q ( a t ) + 1 e q ( a b t x ) C O S q ( a b t y ) 2 e q ( b t ) + 1 e q ( a b t x ) C O S q ( a b t y ) = n = 0 k = 0 n n k q a n k b k C E n k , q ( b x , b y ) C E k , q ( a x , a y ) t n [ n ] q ! ,
and
A = 2 e q ( b t ) + 1 e q ( a b t x ) C O S q ( a b t y ) 2 e q ( a t ) + 1 e q ( a b t x ) C O S q ( a b t y ) = n = 0 k = 0 n n k q b n k a k C E n k , q ( a x , a y ) C E k , q ( b x , b y ) t n [ n ] q ! .
From Equations (42) and (43), we can find the required result.
( i i ) In a similar way as with form A, we can make form A such that
A : = 4 e q ( a b t x ) S I N q ( a b t y ) 2 ( e q ( a t ) + 1 ) ( e q ( b t ) + 1 ) ,
and we can find Theorem 9 ( i i ) in a same manner as ( i ) . ☐
Corollary 3.
Assume a = 1 in Theorem 9. Then, the following holds
( i ) k = 0 n n k q b k C E n k , q ( b x , b y ) C E k , q ( x , y ) = k = 0 n n k q b n k C E n k , q ( x , y ) C E k , q ( b x , b y ) , ( i i ) k = 0 n n k q b k S E n k , q ( b x , b y ) S E k , q ( x , y ) = k = 0 n n k q b n k S E n k , q ( x , y ) S E k , q ( b x , b y ) .
Corollary 4.
Assume q 1 in Theorem 9. Then, the following holds
( i ) k = 0 n n k a n k b k C E n k ( b x , b y ) C E k ( a x , a y ) = k = 0 n n k b n k a k C E n k ( a x , a y ) C E k ( b x , b y ) , ( i i ) k = 0 n n k a n k b k S E n k ( b x , b y ) S E k ( a x , a y ) = k = 0 n n k b n k a k S E n k ( a x , a y ) S E k ( b x , b y ) ,
where C E n is the cosine Euler polynomials and S E n is the sine Euler polynomials.
Theorem 10.
For any integers a , b , and | q | < 1 . Then, we obtain
k = 0 n n k q a n k b k C E n k , q ( b x , b y ) S E k , q ( a x , a y ) = k = 0 n n k q b n k a k C E n k , q ( a x , a y ) S E k , q ( b x , b y ) .
Proof. 
To derive a symmetric relation mixing the q-cosine Euler polynomials and the q-sine Euler polynomials, we take form B as the following.
B : = 4 C O S q ( a b t y ) S I N q ( a b t y ) ( e q ( a b t x ) ) 2 ( e q ( a t ) + 1 ) ( e q ( b t ) + 1 ) .
From form B, we can find the following equations:
B = 2 e q ( a t ) + 1 e q ( a b t x ) C O S q ( a b t y ) 2 e q ( b t ) + 1 e q ( a b t x ) S I N q ( a b t y ) = n = 0 k = 0 n n k q a n k b k C E n k , q ( b x , b y ) S E k , q ( a x , a y ) t n [ n ] q ! ,
and
B = 2 e q ( b t ) + 1 e q ( a b t x ) C O S q ( a b t y ) 2 e q ( a t ) + 1 e q ( a b t x ) S I N q ( a b t y ) = n = 0 k = 0 n n k q b n k a k C E n k , q ( a x , a y ) S E k , q ( b x , b y ) t n [ n ] q ! .
From (49) and (50), we can immediately complete the proof of Theorem 10. ☐
Corollary 5.
Suppose q 1 in Theorem 10. Then the following holds
k = 0 n n k a n k b k C E n k ( b x , b y ) S E k ( a x , a y ) = k = 0 n n k b n k a k C E n k ( a x , a y ) S E k ( b x , b y ) .

3. Some Special Properties of q-cosine Euler Polynomials and q-sine Euler Polynomials

In this section, we obtain some special properties of q-cosine and q-sine Euler polynomials using the properties of q-trigonometric functions, ( x y ) q , and so on. Moreover, we find various types of relationships between q-cosine, sine Euler polynomials and other polynomials.
Theorem 11.
For | q | < 1 , we obtain
( i ) C E n , q ( 1 , y ) = k = 0 n n k q ( 1 ) n k q n k 2 2 C k , q ( x , y ) C E k , q ( x , y ) x n k , ( i i ) S E n , q ( 1 , y ) = k = 0 n n k q ( 1 ) n k q n k 2 ( 2 S k , q ( x , y ) S E k , q ( x , y ) ) x n k .
Proof. 
( i ) When x = 1 in the generating function of q-cosine Euler polynomials, C E n , q ( x , y ) , we have
n = 0 C E n , q ( 1 , y ) t n [ n ] q ! = 2 C O S q ( t y ) 2 e q ( t ) + 1 C O S q ( t y ) .
Using e q ( x ) E q ( x ) = 1 and [ n ] q 1 ! = q n 2 [ n ] q ! , the left-hand side of Equation (53) can be written as the following:
n = 0 C E n , q ( 1 , y ) t n [ n ] q ! = 2 e q ( t x ) C O S q ( t y ) 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) E q ( t x ) = n = 0 ( 2 C n , q ( x , y ) C E n , q ( x , y ) ) t n [ n ] q ! n = 0 ( 1 ) n q n 2 x n t n [ n ] q ! = n = 0 k = 0 n n k q ( 1 ) n k q n k 2 ( 2 C k , q ( x , y ) C E k , q ( x , y ) ) x n k t n [ n ] q ! .
Comparing the both sides of Equation (54), we obtain the required result.
( i i ) By using the same method as in the proof of ( i ) , we have the proof of Theorem 11 ( i i ) . ☐
Corollary 6.
When q 1 in Theorem 11, the following holds
( i ) C E n ( 1 , y ) = k = 0 n n k ( 1 ) n k ( 2 C k ( x , y ) C E k ( x , y ) x n k , ( i i ) S E n ( 1 , y ) = k = 0 n n k ( 1 ) n k 2 S k ( x , y ) S E k ( x , y ) x n k ,
where C E n ( x , y ) is the cosine Euler polynomials and S E n ( x , y ) is the sine Euler polynomials.
Lemma 1.
For | q | < 1 and a real number r, we have
( i ) C E n , q ( ( x r ) q , y ) = k = 0 n n k q q n k 2 C E k , q ( x , y ) r n k , ( i i ) C E n , q ( ( x r ) q , y ) = k = 0 n n k q ( 1 ) n k q n k 2 C E k , q ( x , y ) r n k , ( i i i ) S E n , q ( ( x r ) q , y ) = k = 0 n n k q q n k 2 S E k , q ( x , y ) r n k , ( i v ) S E n , q ( ( x r ) q , y ) = k = 0 n n k q ( 1 ) n k q n k 2 S E k , q ( x , y ) r n k .
Proof. 
( i ) By substituting ( x r ) q instead of x in the generating function of q-cosine Euler polynomials and using q-exponential functions, we derive
n = 0 C E n , q ( ( x r ) q , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) E q ( t r ) = n = 0 k = 0 n n k q q n k 2 C E k , q ( x , y ) r n k t n [ n ] q ! ,
Thus, we find the required result immediately.
( i i ) Putting ( x r ) q into x in the generating function of q-cosine Euler polynomials and using q-exponential functions, we have
n = 0 C E n , q ( ( x r ) q , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) E q ( t r ) .
We find the required result in a similar way as in the proof of ( i ) .
( i i i ) We consider that
n = 0 S E n , q ( ( x r ) q , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) S I N q ( t y ) E q ( t r ) .
Then, we have the following result.
( i v ) If we set ( x r ) in x in the generating function of q-sine Euler polynomials, then we have
n = 0 S E n , q ( ( x r ) q , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) S I N q ( t y ) E q ( t r ) .
From Equation (60), we obtain the desired result. ☐
Theorem 12.
Let | q | < 1 and r , x , y R . From the Lemma 1, we have
( i ) C E n , q ( ( x r ) q , y ) + C E n , q ( ( x r ) q , y ) = 2 k = 0 n n 2 k + 1 q q n ( 2 k + 1 ) 2 C E 2 k + 1 , q ( x , y ) r n ( 2 k + 1 ) , i f n = o d d 2 k = 0 n n 2 k q q n 2 k 2 C E 2 k , q ( x , y ) r n 2 k , i f n = e v e n . ( i i ) S E n , q ( ( x r ) q , y ) + S E n , q ( ( x r ) q , y ) = 2 k = 0 n n 2 k + 1 q q n ( 2 k + 1 ) 2 S E 2 k + 1 , q ( x , y ) r n ( 2 k + 1 ) , i f n = o d d 2 k = 0 n n 2 k q q n 2 k 2 S E 2 k , q ( x , y ) r n 2 k , i f n = e v e n .
Proof. 
( i ) By using Lemma 1 ( i ) and ( i i ) , we obtain
C E n , q ( ( x r ) q , y ) + C E n , q ( ( x r ) q , y ) = k = 0 n n k q q n k 2 C E k , q ( x , y ) + ( 1 ) n k C E k , q ( x , y ) r n k .
If n is an odd or even number, then we derive the required result.
( i i ) We omit the proof of Theorem 12 ( i i ) because we obtain the desired result in the same manner. ☐
Corollary 7.
Let r = 1 in Theorem 12. Then, we have
( i ) C E n , q ( ( x 1 ) q , y ) + C E n , q ( ( x 1 ) q , y ) = 2 k = 0 n n 2 k + 1 q q n ( 2 k + 1 ) 2 C E 2 k + 1 , q ( x , y ) , i f n = o d d 2 k = 0 n n 2 k q q n 2 k 2 C E 2 k , q ( x , y ) , i f n = e v e n , ( i i ) S E n , q ( ( x 1 ) q , y ) + S E n , q ( ( x 1 ) q , y ) = 2 k = 0 n n 2 k + 1 q q n ( 2 k + 1 ) 2 S E 2 k + 1 , q ( x , y ) , i f n = o d d 2 k = 0 n n 2 k q q n 2 k 2 S E 2 k , q ( x , y ) , i f n = e v e n .
Corollary 8.
Let q 1 in Theorem 12. Then, we have
( i ) C E n ( x + r , y ) + C E n ( x r , y ) = 2 k = 0 n n 2 k + 1 C E 2 k + 1 ( x , y ) r n ( 2 k + 1 ) , i f n = o d d 2 k = 0 n n 2 k C E 2 k ( x , y ) r n 2 k , i f n = e v e n , ( i i ) S E n ( x + r , y ) + S E n ( x r , y ) = 2 k = 0 n n 2 k + 1 S E 2 k + 1 ( x , y ) r n ( 2 k + 1 ) , i f n = o d d 2 k = 0 n n 2 k S E 2 k ( x , y ) r n 2 k , i f n = e v e n .
Corollary 9.
From Lemma 1, one holds
( i ) C E n , q ( ( x r ) q , y ) + S E n , q ( ( x r ) q , y ) = k = 0 n n k q q n k 2 C E k , q ( x , y ) + C E k , q ( x , y ) r n k , ( i i ) C E n , q ( ( x r ) q , y ) + S E n , q ( ( x r ) q , y ) = k = 0 n n k q ( 1 ) n k q n k 2 C E k , q ( x , y ) + C E k , q ( x , y ) r n k .
Theorem 13.
For | q | < 1 , we have the following relation:
E n , q ( x ) = k = 0 [ n 2 ] n 2 k q ( 1 ) k y 2 k C E n k , q ( x , y ) + k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k y 2 k + 1 S E n ( 2 k + 1 ) , q ( x , y ) ,
where E n , q ( x ) is the q-Euler polynomials and [ x ] is the greatest integer not exceeding x.
Proof. 
( i ) We consider a multiplication between the generating function of q-cosine Euler polynomials and the q-cosine function such as
n = 0 C E n , q ( x , y ) t n [ n ] q ! c o s q ( t y ) = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) c o s q ( t y ) .
By using the power series of a q-cosine function, the left-hand side of Equation (67) is written as
n = 0 C E n , q ( x , y ) t n [ n ] q ! c o s q ( t y ) = n = 0 C E n , q ( x , y ) t n [ n ] q ! n = 0 ( 1 ) n y 2 n t 2 n [ 2 n ] q ! = n = 0 k = 0 n n + k 2 k q ( 1 ) k y 2 k C E n k , q ( x , y ) t n + k [ n + k ] q ! = n = 0 k = 0 [ n 2 ] n 2 k q ( 1 ) k y 2 k C E n k , q ( x , y ) t n [ n ] q ! .
From Equations (67) and (68), we have
n = 0 k = 0 [ n 2 ] n 2 k q ( 1 ) k y 2 k C E n k , q ( x , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) C O S q ( t y ) c o s q ( t y ) .
In a similar way, we find the multiplication between the q-sin Euler polynomials and the q-sin function as follows.
n = 0 S E n , q ( x , y ) t n [ n ] q ! s i n q ( t y ) = 2 e q ( t ) + 1 e q ( t x ) S I N q ( t y ) s i n q ( t y ) .
Applying the power series of a q-sine function, the left-hand side of Equation (70) is obtained as
n = 0 S E n , q ( x , y ) t n [ n ] q ! s i n q ( t y ) = n = 0 S E n , q ( x , y ) t n [ n ] q ! n = 0 ( 1 ) n y 2 n + 1 t 2 n + 1 [ 2 n + 1 ] q ! = n = 0 k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k y 2 k + 1 S E n ( 2 k + 1 ) , q ( x , y ) t n [ n ] q ! .
We can find (72) by using c o s q ( t y ) C O S q ( t y ) + s i n q ( t y ) S I N q ( t y ) = 1 , which is a property of q-trigonometric functions.
n = 0 k = 0 [ n 2 ] n 2 k q ( 1 ) k y 2 k C E n k , q ( x , y ) + k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k y 2 k + 1 S E n ( 2 k + 1 ) , q ( x , y ) t n [ n ] q ! = 2 e q ( t ) + 1 e q ( t x ) c o s q ( t y ) C O S q ( t y ) + s i n q ( t y ) S I N q ( t y ) = n = 0 E n , q ( x ) t n [ n ] q ! .
From Equation (72), we can find the required result of Theorem 13. ☐
Corollary 10.
If q 1 in Theorem 13, then we have
E n ( x ) = k = 0 [ n 2 ] n 2 k ( 1 ) k y 2 k C E n k ( x , y ) + k = 0 [ n 1 2 ] n 2 k + 1 ( 1 ) k y 2 k + 1 S E n ( 2 k + 1 ) ( x , y ) .
Corollary 11.
Setting y = 1 in Theorem 13, one holds
E n , q ( x ) = k = 0 [ n 2 ] n 2 k q ( 1 ) k C E n k , q ( x , 1 ) + k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k S E n ( 2 k + 1 ) , q ( x , 1 ) .
Corollary 12.
From the Theorem 13 and Corollary 11, we have
k = 0 [ n 2 ] n 2 k q ( 1 ) k y 2 k C E n k , q ( x , y ) C E n k , q ( x , 1 ) = k = 0 [ n 1 2 ] n 2 k + 1 q ( 1 ) k S E n ( 2 k + 1 ) , q ( x , 1 ) y 2 k + 1 S E n ( 2 k + 1 ) , q ( x , y ) .
To find a relationship between the q-cosine Euler polynomials and the q-cosine Bernoulli polynomials, we recall the definitions of q-cosine and q-sine Bernoulli polynomials, see [15]. The q-cosine Bernoulli polynomials C B n ( x , y ) and q-cosine Bernoulli polynomials S B n ( x , y ) are defined by means of the generating functions
n = 0 C B n , q ( x , y ) t n n ! = t e q ( t ) 1 e q ( t x ) cos q ( t y ) , n = 0 S B n , q ( x , y ) t n n ! = t e q ( t ) 1 e q ( t x ) sin q ( t y ) .
Theorem 14.
Let x , y R and | q | < 1 . Then we derive
( i ) [ n ] q C E n 1 , q ( x , y ) + 2 C B n , q ( x , y ) = k = 0 n n k q 2 C B k , q ( x , y ) [ k ] q C E k 1 , q ( x , y ) , ( i i ) [ n ] q S E n 1 , q ( x , y ) + 2 S B n , q ( x , y ) = k = 0 n n k q 2 S B k , q ( x , y ) [ k ] q S E k 1 , q ( x , y ) ,
where C B n , q ( x , y ) is the q-cosine Bernoulli polynomials and S B n , q ( x , y ) is the q-sine Bernoulli polynomials.
Proof. 
( i ) We substitute the generating function of q-cosine Euler polynomials with an expression that is related to the q-cosine Bernoulli polynomials as
n = 0 C E n , q ( x , y ) t n [ n ] q ! = 2 ( e q ( t ) 1 ) t ( e q ( t ) + 1 ) n = 0 C B n , q ( x , y ) t n [ n ] q ! .
From Equation (78), we have
n = 0 C E n , q ( x , y ) t n + 1 [ n ] q ! n = 0 t n [ n ] q ! + 1 = 2 n = 0 C B n , q ( x , y ) t n [ n ] q ! n = 0 t n [ n ] q ! 1 .
We replace the left-hand side of (79) with the following equation.
n = 0 C E n , q ( x , y ) t n + 1 [ n ] q ! n = 0 t n [ n ] q ! + 1 = n = 0 [ n ] q C E n 1 , q ( x , y ) t n [ n ] q ! n = 0 t n [ n ] q ! + 1 = n = 0 k = 0 n n k q [ k ] q C E k 1 , q ( x , y ) + [ n ] q C E n 1 , q ( x , y ) t n [ n ] q ! .
Then, the right-hand side of (79) is transformed as
2 n = 0 C B n , q ( x , y ) t n [ n ] q ! n = 0 t n [ n ] q ! 1 = 2 n = 0 k = 0 n n k q C B k , q ( x , y ) C B n , q ( x , y ) t n [ n ] q ! .
By comparing Equations (80) and (81), we investigate a relation between the q-cosine Euler polynomials and q-cosine Bernoulli polynomials and complete the proof of Theorem 14.
( i i ) By using a similar method as in ( i ) , we derive the required result. ☐
Corollary 13.
When q 1 in Theorem 14, the following holds
( i ) n C E n 1 ( x , y ) + 2 C B n ( x , y ) = k = 0 n n k 2 C B k ( x , y ) k C E k 1 ( x , y ) , ( i i ) n S E n 1 ( x , y ) + 2 S B n ( x , y ) = k = 0 n n k 2 S B k ( x , y ) k S E k 1 ( x , y ) ,
where C B n ( x , y ) is the cosine Bernoulli polynomials, and S B n ( x , y ) is the sine Bernoulli polynomials.

4. Symmetric Structures of Approximate Roots for q-cosine Euler Polynomials and Their Application

In this section, we show the actual forms for q-cosine and q-sine Euler polynomials using the theorems from Section 2 and the Mathematica program. We observe the structure of the approximate roots of these polynomials and find some properties. We also show examples of q-cosine Euler polynomials using Newton’s method.
First, we discuss q-cosine Euler polynomials. A few forms of q-cosine Euler polynomials are as follows:
C E 0 , q ( x , y ) = 1 , C E 1 , q ( x , y ) = 1 2 + x , C E 2 , q ( x , y ) = 1 4 ( 1 + q 2 x 2 q x + 4 x 2 4 q y 2 ) , C E 3 , q ( x , y ) = 1 8 ( 1 + 2 q + 2 q 2 q 3 2 x + 2 q 3 x 4 x 2 4 q x 2 4 q 2 x 2 + 8 x 3 ) 1 8 ( 4 q ( 1 + q + q 2 ) ( 1 + 2 x ) y 2 ) , C E 4 , q ( x , y ) = 1 16 ( 1 + 3 q + 3 q 2 3 q 4 3 q 5 + q 6 2 x + 2 q x + 6 q 2 x + 4 q 3 x + 6 q 4 x ) + 1 16 ( 2 q 5 x 2 q 6 x 4 x 2 4 q 2 x 2 + 4 q 3 x 2 + 4 q 5 x 2 8 x 3 8 q x 3 8 q 2 x 3 ) 1 16 ( 8 q 3 x 3 16 x 4 + 4 q ( 1 + q 2 ) ( 1 + q + q 2 ) ( 1 q + 2 ( 1 + q ) x 4 x 2 ) y 2 ) + q 6 y 4 , .
Next, we show the approximate roots table of q-cosine Euler polynomials. Based on Equation (83), we construct Table 1 for the approximate roots of q-cosine Euler polynomials. In Table 1, we vary the values of p and n when y = 7 . Then, we obtain only real roots with 1 n 7 in q = 0.5 and q = 0.9 .
From Table 1, we can consider two previews:
(1)
When n increases, the absolute values of the real roots approach to approximately 2.345 and 1 for q = 0.1 .
(2)
When q approaches 1, the approximate root distribution of q-cosine Euler polynomials are spread and most of them appear as real roots.
Figure 1 shows the structure of the approximate roots for q-cosine Euler polynomials. Let y = 7 and 1 n 30 . The left graph in Figure 1 is q=0.99, the middle graph is q = 0.9 , and the right graph is q = 0.8 . The blue color denotes that n is small, and the red color denotes that n is 30. In Figure 1, we show that the approximate roots of q-cosine Euler polynomials include all real numbers in q = 0.99 when n = 30 . In addition, we conject that the approximate roots of q-cosine Euler polynomials show a circle structure near 0 when q approaches 0 and n continues to increase.
Figure 2 shows the 3D structure of Figure 1 under the same conditions. The left shape is the approximate roots of q-cosine Euler polynomials when q = 0.99 , y = 7 , and 1 n 30 . This shape indicates that all the approximate roots are located on an imaginary axis. The middle shape in Figure 2 shows the approximate roots of q-cosine Euler polynomials when q = 0.9 , y = 7 , and 1 n 30 . Here, we can observe the movement of the approximate roots. When q = 0.8 and y = 7 , we can see the right shape of Figure 2. The shape variation in Figure 2 implies that the approximate roots change to imaginary numbers from real numbers and that the root structure for q-cosine Euler polynomials vary according to q.
Conjecture 1.
If n increases and q 0 , then the approximate roots of q-cosine Euler polynomials display a circle shape near the origin except for some zeros.
In Figure 3, q = 0.99 and y = 7 when 1 n 30 . Under these conditions, we observe that the approximate roots of q-cosine Euler polynomials have a symmetric property and include all real numbers. By observing the right graphs in Figure 1 and Figure 3, we can consider Conjecture 2.
Conjecture 2.
Prove that C E n , q ( x , y ) is reflection symmetry analytic complex functions which has Re ( x ) = 1 / 2 in addition to the usual Im ( x ) = 0 , when y is a fixed point in real numbers.
By using the Newton’s method(see [22]), we see the following Example 1. The equation of the left figure in Example 3 is 1.1965181875000004 + 2.912903125000001 x 5.745637500000002 x 2 0.5555 x 3 + x 4 , that is q = 0.1 . In Table 1, we note that the approximate roots are 2.33937 , 0.271276 , 0.795233 , and 2.37091 , where q = 0.1 and y = 7 . When we choose 4 Re ( x ) 4 and 4 Im ( x ) 4 , we obtain the left figure in a complex plane. The complex numbers in the red, violet, yellow, and sky-blue ranges move to 2.3397 , 0.271276 , 0.795233 , and 2.37091 , respectively. The right figure in Example 3 illustrates the 4-th q-cosine Euler polynomials when q = 0.5 and y = 7 . Numbers of the red, violet, yellow, and sky-blue ranges in the complex plane become 7.20113 , 0.610105 , 1.36484 , and 7.3839 , respectively (Figure 4).
Example 3.
The 4-th q-cosine Euler polynomials display the following figures in a complex plane:

5. Conclusions

In this paper, we have identified several properties of q-cosine Euler polynomials and q-sine Euler polynomials. In addition, the relationship between polynomials was confirmed according to the various conditions of the variables. We were able to assume the structure of the approximate roots of the q-cosine Euler polynomials and the q-sine Euler polynomials and finally, produce some speculations. The structure of the approximate roots will come out in various ways depending on the condition of the variables, and new methods and theorems related to approaching this needs to be created and proved.

Author Contributions

Conceptualization, J.Y.K.; Data curation, C.S.R.; Formal analysis, C.S.R.; Methodology, J.Y.K.; Software, J.Y.K.; Writing—Original draft, J.Y.K. These authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT and Future Planning (No. 2017R1E1A1A03070483).

Acknowledgments

The authors would like to thank the referees for their valuable comments, which improved the original manuscript in its present form.

Conflicts of Interest

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. Jackson, H.F. q-Difference equations. Am. J. Math. 1910, 32, 305–314. [Google Scholar] [CrossRef]
  2. Charalambides, C.A. Discrete q-distributions; Wiley: New York, NY, USA, 2016; ISBN 9781119119050. [Google Scholar]
  3. Ernst, T. A Comprehensive Treatment of q-calculus; Springer Science & Business Media: New York, NY, USA, 2012. [Google Scholar]
  4. Gasper, G.; Rahman, M. Basic Hypergeometric Series, 2nd ed.; Cambridge University Press: Cambridge, UK, 2004; ISBN 9780511526251. [Google Scholar]
  5. Andrews, G.E.; Crippa, D.; Simon, K. q-Series arising from the study of random graphs. SIAM J. Discrete Math. 1997, 10, 41–56. [Google Scholar] [CrossRef]
  6. Charalambides, C.A. On the q-differences of the generalized q-factorials. J. Statist. Plann. Inference 1996, 54, 31–43. [Google Scholar] [CrossRef]
  7. Exton, H. q-Hypergeometric Functions and Applications; Halstead Press: New York, NY, USA; Ellis Horwood: Chichester, UK, 1983; ISBN 0853124914. [Google Scholar]
  8. Kemp, A. Certain q-analogues of the binomial distribution. Sankhya A 2002, 64, 293–305. [Google Scholar]
  9. Ostrovska, S. q-Bernstein polynomials and their iterates. J. Approx. Theory 2003, 123, 232–255. [Google Scholar] [CrossRef] [Green Version]
  10. Rawlings, D. Limit formulas for q-exponential functions. Discrete Math. 1994, 126, 379–383. [Google Scholar] [CrossRef] [Green Version]
  11. Sparavigna, A.C. Graphs of q-exponentials and q-trigonometric functions. 2016. Available online: https://hal.archives-ouvertes.fr/hal-01377262 (accessed on 15 June 2020).
  12. Jackson, H.F. On q-functions and a certain difference operator. Trans. R. Soc. Edinb. 2013, 46, 253–281. [Google Scholar] [CrossRef]
  13. Phillips, G.M. Bernstein polynomials based on q-integers. Ann. Numer. Anal. 1997, 4, 511–518. [Google Scholar]
  14. Kac, V.; Pokman, C. Quantum Calculus Universitext; Springer: New York, NY, USA, 2002; ISBN 9781461300717. [Google Scholar]
  15. Kang, J.Y.; Ryoo, C.S. Various structures of the roots and explicit properties of q-cosine Bernoulli polynomials and q-sine Bernoulli polynomials. Mathematics 2020, 8, 463. [Google Scholar] [CrossRef] [Green Version]
  16. Kim, T.; Ryoo, C.S. Some identities for Euler and Bernoulli polynomials and their zeros. Axioms 2018, 7, 56. [Google Scholar] [CrossRef] [Green Version]
  17. Kim, T.; Ryoo, C.S. Sheffer Type Degenerate Euler and Bernoulli Polynomials. Filomat 2019, 33, 6173–6185. [Google Scholar] [CrossRef]
  18. Liu, H.; Wang, W. Some identities on the Bernoulli, Euler and Genocchi polynomials via power sums and alternate power sums. Discrete Math. 2009, 309, 3346–3363. [Google Scholar] [CrossRef] [Green Version]
  19. Mahmudov, N.I.; Momenzadeh, M. On a class of q-Bernoulli, q-Euler, and q-Genocchi polynomials. Abstr. Appl. Anal. 2014, 2014, 696454. [Google Scholar] [CrossRef]
  20. Park, M.J.; Kang, J.Y. A study on the cosine tangent polynomials and sine tangent polynomials. J. Appl. Pure Math. 2020, 2, 47–56. [Google Scholar]
  21. Carlitz, L. Degenerate Stiling, Bernoulli and Eulerian numbers. Utilitas Math. 1979, 15, 51–88. [Google Scholar]
  22. Kharab, A.; Guenther, R.B. An Introduction to Numerical Methods: A Matlab Approach, 3rd ed.; Chapman and Hall/crc: Boca Raton, FL, USA, 2018; ISBN-13 978-1439868997. [Google Scholar]
Figure 1. Stacking structure of approximation roots in q-cosine Euler polynomials when q = 0.99 , 0.9 , and 0.8 and y = 7 .
Figure 1. Stacking structure of approximation roots in q-cosine Euler polynomials when q = 0.99 , 0.9 , and 0.8 and y = 7 .
Symmetry 12 01247 g001
Figure 2. Stacking structure of the approximation roots in q-cosine Euler polynomials when q = 0.99 , 0.9 , and 0.8 and y = 7 in 3D.
Figure 2. Stacking structure of the approximation roots in q-cosine Euler polynomials when q = 0.99 , 0.9 , and 0.8 and y = 7 in 3D.
Symmetry 12 01247 g002
Figure 3. Stacking structure of the approximate roots in q-cosine Euler polynomials when q = 0.99 and y = 7 .
Figure 3. Stacking structure of the approximate roots in q-cosine Euler polynomials when q = 0.99 and y = 7 .
Symmetry 12 01247 g003
Figure 4. The 4-th q-cosine Euler polynomials for q = 0.1 and y = 7 .
Figure 4. The 4-th q-cosine Euler polynomials for q = 0.1 and y = 7 .
Symmetry 12 01247 g004
Table 1. Approximate zeros of E n , q ( x , 7 ) .
Table 1. Approximate zeros of E n , q ( x , 7 ) .
nq = 0.1q = 0.5q = 0.9
10.50.50.5
2−2.00549,−4.60151,−6.18463,
2.555495.351517.13463
3−2.3461,−6.3923,−10.5354,
0.457296,0.496385,0.499698,
2.443816.7709111.3907
4−2.33937, −0.271276,−7.20113, −0.610105,−14.1519, −2.0322,
0.795233, 2.370911.36484, 7.38392.98714, 14.9165
5−2.34547,−7.58727, −1.07425,−17.2997, −3.75091,
−0.185877 − 0.259313i,0.403015,0.497805,
−0.185877 + 0.259313i,1.55082, 7.676444.617, 17.9833
0.92226, 2.35051
6−2.34484, −0.335526,−7.77643, −1.22901,−20.0834, −5.08688,
−0.0397254 − 0.350112i,−0.200224, 0.852848,−1.00794, 1.96854,
−0.0397254 + 0.350112i,1.51678, 7.820415.85703, 20.6955
0.969307, 2.34607
7−2.345,−7.87012, −1.28288,−22.5628, −6.18568,
−0.293507 − 0.196006i,−0.40639, 0.14643,−2.10138,
−0.293507 + 0.196006i,1.10906, 1.40412,0.493322,
0.0774528 − 0.366718i,7.891962.98756,
0.0774528 + 0.366718i, 6.86617, 23.1113
0.98748, 2.34519

Share and Cite

MDPI and ACS Style

Ryoo, C.S.; Kang, J.Y. Explicit Properties of q-Cosine and q-Sine Euler Polynomials Containing Symmetric Structures. Symmetry 2020, 12, 1247. https://doi.org/10.3390/sym12081247

AMA Style

Ryoo CS, Kang JY. Explicit Properties of q-Cosine and q-Sine Euler Polynomials Containing Symmetric Structures. Symmetry. 2020; 12(8):1247. https://doi.org/10.3390/sym12081247

Chicago/Turabian Style

Ryoo, Cheon Seoung, and Jung Yoog Kang. 2020. "Explicit Properties of q-Cosine and q-Sine Euler Polynomials Containing Symmetric Structures" Symmetry 12, no. 8: 1247. https://doi.org/10.3390/sym12081247

APA Style

Ryoo, C. S., & Kang, J. Y. (2020). Explicit Properties of q-Cosine and q-Sine Euler Polynomials Containing Symmetric Structures. Symmetry, 12(8), 1247. https://doi.org/10.3390/sym12081247

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