1. Calculation Formula
q-binomial: , abbreviated as .
.
. The following relationship is established:
Definition 1.1.
Recursively define , ; , , .
Definition 1.2. =Number of .
=Number of , =Number of .
=Number of , =Number of .
Obviously, , . Use the auxiliary form and each cannot be exchanged:
Theorem 1.1.
.
Following a similar form, we are able to prove inductively:
Theorem 1.2. ,
.
Definition 1.3. .
.
2. Property
Definition 2.1. similarly defining .
Theorem 2.1.
(1). .
(2). At , can exchange orders.
(3). , .
(4). . So can great than 1, .
(5). .
(6) At , .
Proof. (1) and (2) is derived from the definition of .
(3) is derived from , which has already used in the proof of [1.1].
,
, , which proves (4) and (5).
(6) is actually . □
Theorem 2.2. ,
(1). .
(2). .
(3). .
(4). .
In the calculation of , .
Definition 2.2.
Theorem 2.3. PT = [T,T+1...T+M-1] and ,.
So , we can always choose , , , can take any value. So can be converted to . For an arbitrary PT1, can be converted into constant .
In this article, if , then c is a constant,
, , . From [2.2], [2.1(3)]:
Theorem 2.4. .
If , then
can be coverted to is equivalent to
The latter part refers to the necessary and sufficient conditions for merging, which correspond to .
3. Application
Proposition 3.1.
(1). .
(2). .
(3). .
(4). .
(5). .
(6). .
(7). .
Proposition 3.2.
(1)., .
(2). .
(3). .
(4). .
Proposition 3.3. If then .
For and T are not related, similar equations exist.
Proposition 3.4.
(1). .
(2). .
Proposition 3.5. ; .
Proposition 3.6. .
Proposition 3.7. , .
(1). .
(2). .
(3).
.
Definition 3.1. Set come from p Source: .
. .
Proposition 3.8.
,
.
Proposition 3.9.
.
Definition 3.2. .
Easy to obtain: , so .
Proposition 3.10.
.
Proposition 3.12.
(1). .
(2). .
(3).
.
Proposition 3.13.
(1).,
.
(2). , .
(3). , .
q-Vandermorde: K=T+1+M, A=0, X=N+T, .
Proposition 3.14.
.
.
4. The Extension of q-Euler Polynomials and the Relationship Between Three Forms
In this section, .
Lemma 4.1.
Theorem 4.1. , ,
(1). ,define as .
(2). .
(3). .
(4). .
,
is q-Eularian polynomials.[
2] pp 332. From [3.10], we can get three expressions for
. In particular, we can get expressions for Eularian polynomials:
.
More clearly, we can reformulate (1) as: if , then
.
At [2.4], some relationships have been obtained, and now the remaining ones can be deduced:
Theorem 4.2. , if , then
(1). .
(2). , .
Theorem 4.3.
(1). .
(2). .
(3). .
Theorem 4.4. . If , , then
(1).
.
(2).
.
(3). .