proved in | |||
Symmetric | Thm. 3.9 | ||
Thm. 3.10 | |||
|
Hankel | Thm. 3.13 | |
Lower triangular | Thm. 3.15 | ||
Thm. 3.15 | |||
Thm. 3.16 |
Biodiesel, a type of biofuel is a low-carbon substitute for fossil fuels. It has a flash point of 100 to 170 ℃ and an energy content of 33 MJ/L and can help to mitigate climate change by reducing greenhouse gas emissions. This review looked at the properties and benefits of biodiesel and the current situation of Nigeria's biodiesel industry. It examined the various feedstocks, including first-, second-, third- and fourth-generation options, and assesses their availability, viability and cost. The assessment analyzed the industry's challenges as well as the policies and incentives for biodiesel production, and use in Nigeria. Taking into account the cost of production, distribution and use, as well as prospective government subsidies and tax credits, the economic viability of biodiesel was also evaluated. Generally, the biodiesel industry in Nigeria has the potential for growth with the right assistance from the government and private sector.
Citation: Chidiebere Millicent Igwebuike. Biodiesel: Analysis of production, efficiency, economics and sustainability in Nigeria[J]. Clean Technologies and Recycling, 2023, 3(2): 92-106. doi: 10.3934/ctr.2023006
[1] | Shishuo Fu, Zhicong Lin, Yaling Wang . Refined Wilf-equivalences by Comtet statistics. Electronic Research Archive, 2021, 29(5): 2877-2913. doi: 10.3934/era.2021018 |
[2] | Ji-Cai Liu . Proof of Sun's conjectural supercongruence involving Catalan numbers. Electronic Research Archive, 2020, 28(2): 1023-1030. doi: 10.3934/era.2020054 |
[3] | Kelvyn Bladen, D. Richard Cutler . Assessing agreement between permutation and dropout variable importance methods for regression and random forest models. Electronic Research Archive, 2024, 32(7): 4495-4514. doi: 10.3934/era.2024203 |
[4] | Heesung Shin, Jiang Zeng . More bijections for Entringer and Arnold families. Electronic Research Archive, 2021, 29(2): 2167-2185. doi: 10.3934/era.2020111 |
[5] | Hanpeng Gao, Yunlong Zhou, Yuanfeng Zhang . Sincere wide τ-tilting modules. Electronic Research Archive, 2025, 33(4): 2275-2284. doi: 10.3934/era.2025099 |
[6] | Chengmin Wang, Ce Shi, Tatsuhiro Tsuchiya, Quanrui Zhang . Detecting arrays on graphs. Electronic Research Archive, 2025, 33(5): 3328-3347. doi: 10.3934/era.2025147 |
[7] | Zhifu Xie . Remarks on the inverse problem of the collinear central configurations in the N-body problem. Electronic Research Archive, 2022, 30(7): 2540-2549. doi: 10.3934/era.2022130 |
[8] | Bin Han . Some multivariate polynomials for doubled permutations. Electronic Research Archive, 2021, 29(2): 1925-1944. doi: 10.3934/era.2020098 |
[9] | Sidney A. Morris . Bohr compactification of separable locally convex spaces. Electronic Research Archive, 2025, 33(3): 1333-1336. doi: 10.3934/era.2025060 |
[10] | Shishuo Fu, Jiaxi Lu, Yuanzhe Ding . A skeleton model to enumerate standard puzzle sequences. Electronic Research Archive, 2022, 30(1): 179-203. doi: 10.3934/era.2022010 |
Biodiesel, a type of biofuel is a low-carbon substitute for fossil fuels. It has a flash point of 100 to 170 ℃ and an energy content of 33 MJ/L and can help to mitigate climate change by reducing greenhouse gas emissions. This review looked at the properties and benefits of biodiesel and the current situation of Nigeria's biodiesel industry. It examined the various feedstocks, including first-, second-, third- and fourth-generation options, and assesses their availability, viability and cost. The assessment analyzed the industry's challenges as well as the policies and incentives for biodiesel production, and use in Nigeria. Taking into account the cost of production, distribution and use, as well as prospective government subsidies and tax credits, the economic viability of biodiesel was also evaluated. Generally, the biodiesel industry in Nigeria has the potential for growth with the right assistance from the government and private sector.
Let
The notion of permutation pattern was introduced by Knuth [21,pp. 242-243] in 1968, but studied intensively and systematically for the first time by Simion and Schmidt [28] in 1985. Ever since then, it has become an active and prosperous research subject. The reader is referred to two book expositions, [5,Chapters 4 and 5] and [20], on this topic, as well as the numerous references therein. In the early 1980s, Herbert Wilf posed the problem of identifying equirestrictive sets of forbidden patterns. Let
In this paper, we will restrict ourselves to the case where
DES(π):={i∈[n−1]:π(i)<π(i+1)}, |
called the descent set of
des(π):=|DES(π)|andiar(π):=min(DES(π)∪{n}), |
called the descent number and the initial ascending run of
An(t):=∑π∈Sntdes(π). |
Another statistic highlighted in our study is
comp(π):=|{i:∀j≤i,π(j)≤i}|. |
It is equal to the maximum number of components (see [1,7,8]) in an expression of
∑n≥1f(n)zn=1−1∑n≥0n!zn. |
Thus, any statistic equidistributed with
For a (possibly set-valued) statistic
|Sn(P)st|=|Sn(Q)st|, |
meaning that for a fixed value of
Some highlights of our results will be outlined below. Before stating them, we need to recall some classical permutation statistics. For a permutation
LMAX(π):={π(i)∈[n]:π(j)<π(i),∀1≤j<i}andLMAXP(π):={i∈[n]:π(j)<π(i),∀1≤j<i}, |
the set of values and positions of the left-to-right maxima of
DESB(π):={π(i+1)∈[n−1]:i∈DES(π)}, |
which is another set-valued extension of
The first one of our main results concerns a single pattern of length
Theorem 1.1. For every
(i) the two triples
(ii) the two quadruples
(iii) the quadruples
The result on the symmetry of
Next, Claesson, Kitaev and Steingrímsson [20,Thm 2.2.48] constructed a bijection between separable permutations of length
Corollary 1.2. The double Comtet statistics
We take the opportunity to announce the following refinement of Corollary 1.2, which appears in a separate article.
Theorem 1.3 ([16]). There exists an involution on
∑π∈Sn(2413,3142)scomp(π)tiar(π)xLMAX(π)yDESB(π)=∑π∈Sn(2413,3142)siar(π)tcomp(π)xLMAX(π)yDESB(π), |
where
The proof of Theorem 1.1 provided in Sect. 3 is via two involutions on permutations that actually imply the even stronger symmetric phenomenon, namely the corresponding distribution matrices are Hankel; see Theorems 3.13 and 4.2. The proof of Theorem 1.3 is based on a combinatorial bijection on the so-called di-sk trees introduced in [17]. This bijection will also provide an alternative approach to Theorem 1.1(ii). The details will be given in [16].
Remark 1. Rubey's bijective proof of a slight modification (see Theorem 3.1) of Theorem 1.1(i) is via Dyck paths and the proof of Theorem 1.3 that will appear in [16] is based on di-sk trees. Our bijective and unified proof of Theorem 1.1(i)(ii), constructed directly on permutations, provides more insights into the symmetry of the double Comtet statistics, and therefore, it seems more likely to be extended to deal with such equidistributions over other classes of pattern-avoiding permutations.
Our third main result shows how
Recall that a polynomial in
{tk(1+t)n−2k}0≤k≤n/2 |
with non-negative coefficients. Many polynomials arising from combinatorics and discrete geometry have been shown to be
An(t)=∑π∈Sntdes(π)=⌊n−12⌋∑k=0|Γn,k|tk(1+t)n−1−2k, |
where
Sn(t):=∑π∈Sn(2413,3142)tdes(π)=⌊n−12⌋∑k=0|Γn,k(2413,3142)|tk(1+t)n−1−2k. | (1) |
In a recent work [24] of Lin and Kim, they proved that
Theorem 1.4. For
∑π∈Sn(2413,3142)tdes(π)xdd(π)yiar(π)=∑π∈Sn(2413,4213)tdes(π)xdd(π)yiar(π). | (2) |
Theorem 1.4 refines Wang's equidistribution [30,Thm. 1.5] by the Comtet statistic
Besides the above three main results, we will also calculate the joint distribution of
proved in | |||
Symmetric | Thm. 3.9 | ||
Thm. 3.10 | |||
|
Hankel | Thm. 3.13 | |
Lower triangular | Thm. 3.15 | ||
Thm. 3.15 | |||
Thm. 3.16 |
proved in | |||
Hankel | Thm. 4.2 | ||
Thm. 4.2 | |||
Diagonal | Thm. 4.3 | ||
Thm. 4.4 | |||
Lower triangular | Thm. 4.6 | ||
Thm. 4.6 | |||
Upper triangular | Thm. 4.6 | ||
Lower triangular | Thm. 4.8 | ||
Thm. 4.8 | |||
Lower triangular | Thm. 4.9 | ||
No pattern | Thm. 4.10 | ||
Thm. 4.11 | |||
Thm. 4.11 | |||
Thm. 4.11 | |||
Ultimately zero | Thm. 4.11 |
The rest of this paper is organized as follows. In Section 2, we review some notation and terminology and prove two general lemmas concerning the direct sum operation of permutations. The classification of refined Wilf-equivalences for a single pattern of length
For a given permutation
● its reversal
● its complement
● its inverse
One thing we would like to point out, before we barge into classifying
Observation 1.
On the other hand, the statistic
Observation 2. The two mappings
Let
S(P)des,iar,comp(t,r,p;z):=∑n≥0∑π∈Sn(P)tdes(π)riar(π)pcomp(π)zn. | (3) |
Most of the time we suppress the superindices
We also need the following operations on permutations.
Definition 2.1. For a word
There are two fundamental operations, called direct sum and skew sum, to construct a bigger permutation from two smaller ones. The direct sum
(π⊕σ)i={πi,for i∈[1,k];σi−k+k,for i∈[k+1,k+l] |
and
(π⊖σ)i={πi+l,for i∈[1,k];σi−k,for i∈[k+1,k+l]. |
For instance, we have
Proposition 2.2. A permutation is separable if and only if it can be built from the permutation
Definition 2.3. A nonempty permutation which is not the direct sum of two nonempty permutations is called indecomposable. Let
For instance,
Let
FP(t1,t2,…;z):=1+∑n≥1zn∑π∈Sn(P)∏itsti(π)i |
and
IP(t1,t2,…;z):=∑n≥1zn∑π∈In(P)∏itsti(π)i. |
We have the following general lemma regarding the direct sum decomposition of permutations, which is useful when considering the refinement of Wilf-equivalence by
Lemma 2.4. Let
1. We have the following functional equation:
FP(q)=11−qw+q(IP(t,t′)−w)(1−qIP(t,1))(1−qw), | (4) |
where
FP(q):=FP(q,t1,…,t′1,…;z)andIP(t,t′):=IP(t1,…,t′1,…;z) |
are the generating functions with respect to
2. If
Proof. Note that if
π is σ-avoiding⟺τi is σ-avoiding for each i. |
Therefore, with respect to totally
FP(q)=1+∑k≥1qk(wk+k−1∑i=0wi(IP(t,t′)−w)IP(t,1)k−1−i)=11−qw+IP(t,t′)−wIP(t,1)−w(qIP(t,1)1−qIP(t,1)−qw1−qw), |
which becomes 4 after simplification.
In view of 4, the following three statements are equivalent:
(i)
(ii)
(iii)
For example, to see that (i) implies (ii), we first set
The following general lemma indicates that for a collection of indecomposable patterns, say
Lemma 2.5. Let
|Sn(P)st′,comp,st1,st2,…|=|Sn(P)comp,st′,st1,st2,…|. |
In particular, if
Proof. Let
FP(r,s)=11−rsw+r(IP(s)−sw)(1−rIP(1))(1−rsw), | (5) |
where
11−sw+IP(s)−sw(1−IP(1))(1−sw)=11−sw+sIP(1)−sw(1−sIP(1))(1−sw). |
Solving this equation gives
IP(s)−sw=s(1−IP(1))(IP(1)−w)1−sIP(1). |
Plugging this into 5 results in
FP(r,s)=1−rsw+(rsw+rs−r−s)IP(1)(1−rIP(1))(1−sIP(1))(1−rsw), | (6) |
which is symmetric in
In this section, we deal with all patterns
{213,312,321},{132,231},and {123}. |
While the
{231,312,321},{132,213},and {123}. |
For the three patterns
Patterns
The pattern
ldes(π):=max({0}∪DES(π)) |
be the position of the last descent of
Theorem 3.1 (Rubey [27]). There exists an involution on
∑π∈Sn(321)scomp(π)tn−ldes(π−1)xLMAXP(π)=∑π∈Sn(321)sn−ldes(π−1)tcomp(π)xLMAXP(π). | (7) |
We explain here why Theorem 3.1 is equivalent to our Theorem 1.1 (i) up to the elementary transformation
n−ldes(πrc)=iar(π)andLMAXP(π)=LMIN(π−1)=¯LMAX((π−1)rc), |
where
∑π∈Sn(321)scomp(π)tn−ldes(π−1)xLMAXP(π)=∑(π−1)rc∈Sn(321)scomp((π−1)rc)tn−ldes(πrc)xLMAXP((π−1)rc)=∑(π−1)rc∈Sn(321)scomp(π)tiar(π)x¯LMAX(π)=∑π∈Sn(321)scomp(π)tiar(π)x¯LMAX(π). |
Therefore, equidistribution (7) is equivalent to Theorem 1.1 (i).
In Corollary 3.7 we present a bijection, say
π=251634↦ω(π)=215634,butπ=251634↦˜ω(π)=215364. |
In view of Lemma 2.4 (2),
Theorem 3.2. For each
(LMAX,LMAXP,iar,comp)π=(LMAX,LMAXP,iar,comp)σ. | (8) |
Sitting in the heart of our proof of Theorem 3.2, is a certain word composed of positive integers and a symbol
Definition 3.3. Given a nonempty set
wS,c:=s1⋄⋯⋄⏟c1s2⋄⋯⋄⏟c2s3⋯sk⋄⋯⋄⏟ck. |
It is said to be an admissible word with respect to
i∑j=1cj≤si−i. | (*) |
Let
We also need to introduce the counterparts on
Theorem 3.4. There exist two bijections
(LMAX,LMAXP,iar,comp)π=(S,SP,ics,equ)wS,c, | (9) |
(LMAX,LMAXP,iar,comp)σ=(T,SP,ics,equ)wT,d, | (10) |
where
Proof. Since the constructions for the two bijections
S:=LMAX(π)={π(i1)=π(1),π(i2),…,π(ik)}. |
Let
It should be clear that
LMAX(ˆπ)=S=LMAX(ˆσ),LMAXP(ˆπ)=SP(wS,c)=LMAXP(ˆσ),iar(ˆπ)=ics(wS,c)=iar(ˆσ),comp(ˆπ)=equ(wS,c)=comp(ˆσ). |
Now set
α−1(α(π))=π,β−1(β(σ))=σ, |
so
Proof of Theorem 3.2. Simply set
Remark 2. When composed with the complement map, our bijection
In view of (9), the pair
Definition 3.5. Given an admissible word
i∑j=1cj<si−i≤i+1∑j=1cj. |
For the previous example
Theorem 3.6. For
Proof. Take any
di={ci+1if a−1≤i≤ℓ−1,si−i−∑ih=1chif i=ℓ,∑ih=1ch−∑i−1h=1dhif i=ℓ+1,ciotherwise. |
We denote
All it remains is to show that
ci={di−1if a≤i≤ℓ,0if i=a−1,di−1+diif i=ℓ+1,diotherwise. |
It is routine to check that
The following result is the restatement of Theorem 1.1 (i) and (ii).
Corollary 3.7. For
Proof. For each permutation
(LMAX,iar,comp)π=(LMAX,comp,iar)ρ. |
If
ρ=α−1(ψk(α(π))). |
Combining Theorem 3.6 with (9), we verify that
LMAX(ρ)=LMAX(π),iar(ρ)=ics(ψk(α(π)))=ics(α(π))−k=iar(π)−k=comp(π),andcomp(ρ)=equ(ψk(α(π)))=equ(α(π))+k=comp(π)+k=iar(π), |
as desired. Now both
Finally, applying the bijection
For most of our calculations of the generating function
A square matrix is said to be Hankel if it has constant skew-diagonals. For the next theorem and Theorems 3.13 and 4.2, a key fact utilized by us is that
Lemma 3.8. Suppose
M(x,y)=xyx−y(N(x)−N(y)). | (11) |
Proof. The Hankel condition enables us to group together terms along the same skew-diagonal. Noting that
M(x,y)=n∑i=1(mi1xiy+mi−12xi−2y2+⋯+m1ixyi)=n∑i=1mi1(xiy+⋯+xyi)=xyx−yn∑i=1mi1(xi−yi)=xyx−y(N(x)−N(y)), |
as desired.
Recall the Narayana polynomial
N:=N(t;z):=∑n≥0Nn(t)zn=1+(t−1)z−√1−2(t+1)z+(t−1)2z22tz. | (12) |
Theorem 3.9. The generating function of the triple statistic
˜S(312)des,iar,comp(t,r,p)=1−(r+p+tN)z+(rp+(r+p−1)tN)z2(1−rpz)(1−rz−tNz)(1−pz−tNz). | (13) |
Proof. Conditioning on
S(t,r,p)=1+rpzS(t,r,p)+rpr−p(˜I(t,r)−˜I(t,p)), | (14) |
where
˜I(t,r):=∑n≥1zn∑π∈Sn(312)π(1)>1,comp(π)=1tdes(π)riar(π)=S(t,r,p)−1−rpzS(t,r,p)p|p=0=rz(˜S(t,r,0)−1). | (15) |
Indeed, the first summand
Next, plugging (15) into (14) yields
(r−p)(1−rpz)˜S(t,r,p)=r˜S(t,r,0)−p˜S(t,p,0). | (16) |
Setting
(r−p)(1−rpz)˜S(t,r,p)=(r−1)(1−rz)˜S(t,r,1)−(p−1)(1−pz)˜S(t,p,1). | (17) |
It remains to calculate
●
●
Summing up these two cases and noting that
rz˜S(t,r,1)=rzS(t,r,1)+(S(t,r,1)−1)tzN. |
Solving for
˜S(t,r,1)=11−rz−tNz. |
Plugging this back into (17), we establish (13) after simplification.
Recall that
C:=S(321)des,iar,comp(t,1,1)=1−√1−4tz2+4z2−4z2z(tz−z+1), | (18) |
which is the generating function of the descent polynomials on
Theorem 3.10. The generating function of the triple statistic
˜S(321)des,iar,comp(t,r,p)=(rpz−rz+tz)C2−(rpz+p−1)C+p(1−rpz)(1−rzC)(p+C−pC). | (19) |
Proof. Recently, Fu, Han and Lin [15,Lemma 4.5] generalized (18) to
H:=S(321)des,iar,comp(t,r,1)=1−rzC+trz2C2(1−rz)(1−rzC). |
For convenience, let
S(321)des,iar,comp(t,r,p)=11−rpz+p(I(r)−rz)(1−pI(1))(1−rpz)=1−p(I(1)−I(r))−rpz(1−pI(1))(1−rpz). | (20) |
It follows that
I(1)=1−1/CandI(r)−I(1)=(H/C−1)(1−rz). |
Substituting these back to (20) yields (19).
Pattern
Now we move onto the class of
Proposition 3.11. For any permutation
1. For
2. When read from left to right, the values of the left-to-right maxima of
3. The first
4. Provided
The next theorem strengthens Theorem 1.1 (iii).
Theorem 3.12. For all positive integers
∑π∈Sn(132)xLMAX(π)yLMIN(π)riar(π)pcomp(π)=∑π∈Sn(132)xLMAX(π)yLMIN(π)rcomp(π)piar(π). | (21) |
In particular, we have
∑π∈Sn(132)tdes(π)riar(π)pcomp(π)=∑π∈Sn(132)tdes(π)rcomp(π)piar(π). | (22) |
Proof. We begin by noting that for each
i.
ii.
iii.
In terms of the two operations deletion and insertion that we introduce in Definition 2.1, we let
σ=φ(π):=insn,n(delπ(1)(π)), |
with
π=φ−1(σ):=insσ(1),1(deln(σ)) |
being the inverse map. We illustrate this definition by giving an example, where the letters affected by this map have been overlined.
π=ˉ5ˉ6ˉ734ˉ82ˉ9¯101¯11σ=ˉ5ˉ634ˉ72ˉ8ˉ91¯10¯11 |
Applying Proposition 3.11, it is rountine to verify i, ii, and iii, and we leave the details to the reader. Items ii and iii ensure that
(LMAX,LMIN,iar,comp)τ=(LMAX,LMIN,comp,iar)π. |
Pairing permutations in this way leads to (21).
Finally, by Proposition 3.11 (1) we have
Theorem 3.13. We have
˜S(132)des,iar,comp(t,r,p)=11−rpz+(1−z)(N−1)t(1−rz)(1−pz)(1−z−(N−1)tz). | (23) |
Proof. The proof is analogous to that of Theorem 3.9. Noting that
S(t,r,p)=11−rpz+rpr−p∑n≥2zn∑π∈In(132)tdes(π)(riar(π)−piar(π))=1+(rpz)21−rpz+rpr−p∑n≥1zn∑π∈In(132)tdes(π)(riar(π)−piar(π)). |
Converting to
˜S(t,r,p)=rpz1−rpz+r˜S(t,r,0)−p˜S(t,p,0)r−p. | (24) |
Plugging in
˜S(t,r,1)=rz1−rz+r˜S(t,r,0)−˜S(t,1,0)r−1. |
Now solve for
˜S(t,r,p)=rpz1−rpz+(r−1)(˜S(t,r,1)−rz1−rz)−(p−1)(˜S(t,p,1)−pz1−pz)r−p. | (25) |
Next, we decompose each
˜S(t,r,1)=(1−z)(1+t(N−1))(1−rz)(1−z−tz(N−1)). |
We plug this back into (25) and simplify to arrive at (23).
We deal with the three remaining classes, namely,
Patterns
Theorem 3.14. For every
(des,iar,comp)π=(des,comp,iar)σ. |
In particular, the matrices
Proof. We define
σ:=θ(π):=insπ(1),1(θ(ν)⊕θ(μ)). |
The following facts can be readily verified.
So we see
The equidistribution between
Theorem 3.15. We have
˜S(213)des,iar,comp(t,r,p)=(1−rz)(tN−t+1)(1−rpz)(1−rz(tN−t+1))and | (26) |
˜S(231)des,iar,comp(t,r,p)=(1−pz)(tN−t+1)(1−rpz)(1−pz(tN−t+1)). | (27) |
Proof. We begin with the calculation of
●
●
●
Summing up these three cases and noting that
S(t,r,p)=1+rpz+trpz(N−1)+rpz(S(t,r,p)−1)+trpz(S(t,r,1)−1)(N−1). |
Now we plug in
Decomposing each
Pattern
For
˜S(123)des,iar,comp(t,r,p)=A(t,p)+rB(t,p), |
where
pzA(t,p):=∑n≥1zn∑π∈Sn(123),iar(π)=1tdes(π)pcomp(π)=pz+tpz2+(tp+t2p+tp2)z3+⋯,pzB(t,p):=∑n≥2zn∑π∈Sn(123),iar(π)=2tdes(π)pcomp(π)=p2z2+(tp+tp2)z3+⋯. |
By (18), the generating function for the descent polynomials on
C∗:=S(123)des,iar,comp(t,1,1)−1=S(321)des,iar,comp(t−1,1,1;tz)−1t=−1+2tz+2tz2−2t2z2+√1−4tz−4tz2+4t2z22t2z(tz−z−1). | (28) |
Theorem 3.16. We have
A(t,p)=(p−1)tz2(1−tz)2+(1−tz)C∗(1−tz+z)z, | (29) |
B(t,p)=(p−1)z1−tz+C∗1−tz+z. | (30) |
Thus,
˜S(123)des,iar,comp(t,r,p)=(1−p)z(trz−tz−r)(1−tz)2+(1+rz−tz)C∗z(1+z−tz). |
Proof. For
{A(t,p)=tpz2(1−tz)2+C∗z−B(t,1)−tz2(1−tz)2,B(t,p)=pz+z(A(t,1)−1)+tzB(t,p). |
Solving this system of equations gives rise to (29) and (30).
The following corollary can be proved combinatorially from analyzing the designated
Corollary 3.17. For
∑n≥2zn∑π∈S∗n(123)riar(π)pcomp(π)=r2p2z21−z+(r+p)rpz3(1−z)2+(z3+2z4)rp(1−z)2(1−2z). | (31) |
In particular, the distribution of
Proof. To calculate the generating function in (31), we need to extract the coefficients of
rpt(1−tz)C∗1−tz+z, |
then take partial derivative
In this section, we let
The Wilf-classification of pairs of length
{(132,213),(132,312),(213,231),(231,312),(231,321)},{(132,231)},{(213,312)},{(312,321)},{(123,132)},{(123,213)}; |
the class enumerated by
{(132,321)},{(123,231)},{(213,321)},{(123,312)}; |
and the terminating (i.e., enumerated by
{(132,231),(132,312),(213,231),(213,312)},{(132,213)}{(123,132),(123,213)},{(231,312),(231,321),(312,321)} |
and the class enumerated by
{(132,321),(213,321)},{(123,231),(123,312)}. |
All the above refined Wilf-equivalences can be easily proven by setting
For
Pattern pairs
First note that if the pattern
Theorem 4.1. For all positive integers
∑π∈Sn(P)xLMAX(π)yLMIN(π)riar(π)pcomp(π)=∑π∈Sn(P)xLMAX(π)yLMIN(π)rcomp(π)piar(π). |
In particular, we have
∑π∈Sn(P)tdes(π)riar(π)pcomp(π)=∑π∈Sn(P)tdes(π)rcomp(π)piar(π). |
This symmetry can also be seen directly from the following generating functions.
Theorem 4.2. We have
˜S(132,312)des,iar,comp(t,r,p)=11−rpz+(1−z)tz(1−rz)(1−pz)(1−z−tz), | (32) |
˜S(132,321)des,iar,comp(t,r,p)=11−rpz+tz(1−rz)(1−pz)(1−z). | (33) |
Proof. The proof is quite analogous to that of Theorem 3.13. First for (32), Theorem 4.1 tells us that
˜S(t,r,p)=rpz1−rpz+(r−1)(˜S(t,r,1)−rz1−rz)−(p−1)(˜S(t,p,1)−pz1−pz)r−p. | (34) |
Next, note that all
●
●
Summing up all cases gives us
S(t,r,p)=11−rpz+pz(S(t,r,p)−11−rpz)+trpz2(1−tz)(1−rz)+tpz21−tz(S(t,r,1)−11−rz). |
Set
˜S(132,312)des,iar,comp(t,r,1)=1−z(1−rz)(1−z−tz), |
then plug this back into (34) and simplify, we get (32). The proof of (33) is simpler noting that for
Pattern pair
The first thing to notice is that for every
S(t,r,p)=S(t,rp,1),andS(t,r,p)=1+rpzS(t,r,p)+trpz(S(t,1,1)−1). |
Solving these two functional equations gives us
Theorem 4.3.
˜S(213,231)des,iar,comp(t,r,p)=1−z(1−rpz)(1−z−tz). |
Pattern pair
For every permutation
●
●
●
●
Summing up all cases above gives rise to
Theorem 4.4.
˜S(123,312)des,iar,comp(t,r,p)=1+rpz1−tz+(r+p)tz2(1−tz)2+t2z3(1−tz)3. |
For the remaining choices of
Pattern pairs
Recall the two bijections,
●
●
Then the following theorem is a quick corollary of Theorems 3.2 and 3.14.
Theorem 4.5. For each
Next, we compute the generating functions for these three pairs.
Theorem 4.6. We have
˜S(213,312)des,iar,comp(t,r,p)=1−rz(1−rpz)(1−(r+t)z), | (35) |
˜S(231,312)des,iar,comp(t,r,p)=1−pz(1−rpz)(1−(p+t)z), | (36) |
˜S(231,321)des,iar,comp(t,r,p)=1−(1+p−t)z+(1−t)pz2(1−rpz)(1−(p+1)z+(1−t)pz2). | (37) |
Proof. In view of Theorem 4.5, (35) follows from (36) by switching variables
Pattern pairs
For the same reason that the bijection
Theorem 4.7. For each
Next, note that each permutation
S(t,r,p)=11−rpz+pz(S(t,r,p)−11−rpz)+trpz(S(t,1,1)−1). |
Solving this and applying Theorem 4.7, we can deduce the following theorem.
Theorem 4.8. We have
˜S(132,213)des,iar,comp(t,r,p)=11−rpz+tz(1−rz)(1−z−tz),˜S(132,231)des,iar,comp(t,r,p)=11−rpz+tz(1−pz)(1−z−tz). |
Pattern pair
Note that each permutation
Theorem 4.9. We have
˜S(213,321)des,iar,comp(t,r,p)=11−rpz+tz(1−z)(1−rz)(1−rpz). |
Pattern pair
Noting that both
FP(q)=11−qw+q(IP(t,t′)−w)(1−qIP(t,1))(1−qw) |
from Lemma 2.4 (1) to reduce the calculation to
I312,321(t,r):=∑n≥1zn∑π∈Sn(312,321)comp(π)=1tdes(π)riar(π). |
Now any indecomposable
I312,321(t,r)=rz+trz21−rz, |
with which we can deduce
Theorem 4.10.
˜S(312,321)des,iar,comp(t,r,p)=11−rpz+(1−z)tz(1−rpz)(1−rz)(1−(1+p)z+(1−t)pz2). |
Pattern pairs
These four pattern sets all contain the pattern
Theorem 4.11. We have
˜S(123,132)des,iar,comp(t,r,p)=1+rpz+tpz21−tz+tz(1+z−tz)(1+(r−t)z+(1−r)tz2)(1−tz)((1−tz)2−tz2),˜S(123,213)des,iar,comp(t,r,p)=1+rpz1−tz+tz(1−tz+rz)(1−tz+z)(1−tz)((1−tz)2−tz2),˜S(123,231)des,iar,comp(t,r,p)=1+rpz1−tz+(1+p−tpz)tz2(1−tz)3,˜S(123,321)des,iar,comp(t,r,p)=1+(t+rp)z+(1+r)(1+p)tz2+(2r+t+pt)tz3. |
This section aims to characterize the pattern pair
[1001],[210110001],[7310331011100001],[28124101211410443101111000001],[1215218510524617510181712410554310111110000001]. |
The integer sequence formed by the entries in the upper-left corner of
1,1,2,7,28,121,550,2591,…. |
This sequence matches A010683 in the OEIS [25], a sequence that counts, among many combinatorial objects, dissections of a convex polygon with
The first result in this section is a consequence of Theorems 1.3 and 1.4.
Corollary 5.1. For
∑π∈Sn(2413,3142)tdes(π)xcomp(π)yiar(π)=∑π∈Sn(2413,4213)tdes(π)xcomp(π)yiar(π). | (38) |
Consequently,
∑π∈Sn(2413,4213)tdes(π)xcomp(π)yiar(π)=∑π∈Sn(2413,4213)tdes(π)xiar(π)ycomp(π) | (39) |
Proof. Since the patterns
The identity (39) follows directly from (38) and Theorem 1.3.
Remark 3. In view of Corollary 5.1, one may wonder that if (2) can be further refined by
Lin and Kim [24,Theorem 5.1] showed that, among all permutation classes avoiding two patterns of length 4, the three classes below are the only nontrivial classes which are
Theorem 5.2 ([24]). We have the refined Wilf-equivalences:
(2413,3142)∼des(2413,4213)∼DES(2314,3214)∼DES(3412,4312). |
It should be noted that
Theorem 5.3. We have
(2413,3142)∼(des,iar,comp)(2413,4213)∼(des,iar,comp)(3412,4312). |
Consequently,
∑π∈Sn(3412,4312)tdes(π)xcomp(π)yiar(π)=∑π∈Sn(3412,4312)tdes(π)xiar(π)ycomp(π). | (40) |
In order to prove Theorem 5.3, we need a set-valued version of Lemma 2.4. For an integer
ST(π)=k⋃i=1ci+ST(τi), |
where
Lemma 5.4. Let
Proof. Since
Obviously, the assertion is true for
Proof of Theorem 5.3. The refined Wilf-equivalence
(2413,4213)∼(DES,comp)(3412,4312) |
is a direct consequence of Theorem 5.2 and Lemma 5.4, as the set-valued statistic
Next we compute the generating function
{(2413,3142),(2413,4213),(3412,4312)}. |
Theorem 5.5. Let
˜S(S)(t,r,p)=(1/z+1−r−p)S(t)+(1−r)(1−p)S(t)2(1−rpz)(1+(1−p)S(t))(1+(1−r)S(t)), | (41) |
where
S(t)=z+(1+t)zS(t)+tzS(t)2+tS(t)3. | (42) |
Proof. The functional equation (42) for the generating function
S(S)(t,r,p;z)=1−rpz+(rpz+rp−r−p)IS(1−rIS)(1−pIS)(1−rpz), | (43) |
where
IS=S(t)1+S(t). |
Substitute this into (43) and simplify, we get (41).
Aided by the computer program, we make the following conjecture, whose validity will complete the characterization of pattern pairs of length
Conjecture 1. Let
(1324,2134),(1324,3124),(1423,4123),(1432,4132),(2134,2314),(2314,3124)(2431,4231),(2431,3241),(3241,3421),(3421,4231),(3421,4321). |
Moreover, if
Remark 4. In view of Lemma 2.4, the second assertion for the
In the rest of this section, we aim to confirm Conjecture 1 for the pattern pair
Theorem 5.6. We have the refined Wilf equivalence
(2413,4213)∼(LMAXP,comp)(2431,4231). |
In particular,
In view of Lemma 5.4, to prove Theorem 5.6, it is sufficient to prove the refined Wilf-equivalence
For
AVA(π):={k∈[n]:insk(π)∈Sn(2431,4231)}={k1>k2>⋯}. |
Clearly, if
We have the following growth rule for
Lemma 5.7. Suppose
AVA(insj(π))={[j,n+1],if m≤j≤n−1;[m,n+1],if j=n. |
Proof. For
The definition of
Lemma 5.8. (Lin and Kim [24,Lemma 5.3]). Suppose
AVA(π)={n=k1>k2>⋯>km=1}. |
Then, for
AVA(inskj(π))={n+1≥kj+1>kj>kj+1>⋯>km=1}. |
We are ready to prove Theorem 5.6 by constructing the generating trees for both classes.
Proof of Theorem 5.6. Label each
(44) |
This means that the initial permutation
We can construct a generating tree (an infinite rooted and labeled tree) for
For instance, the second
It can be readily checked that Lemma 5.8 gives the same rewriting rule
The main purpose of this section is to prove Theorem 1.4. We begin with the motivation that leads to the discovery of Theorem 1.4.
Recall that a sequence
● constructed a bijection
(45) |
where
● proved combinatorially via the so-called modified Foata–Strehl action that
(46) |
Recall that
(47) |
for all
(48) |
where
Theorem 1.4 is a refinement of Wang's equidistribution (48) by the Comtet statistic
As we will see, some easy combinatorial arguments on
For each inversion sequence
(49) |
Thus,
by Theorem 1.4. We have the following recurrence relation for
Theorem 6.1. We have
(50) |
(51) |
Proof. Let
● each of the
● but all zeros after the first positive entry of
Recursion (51) follows from similar reasoning.
We will prove Theorem 1.4 by showing that the generating functions for both sides of (2) satisfy the same algebraic functional equation. We begin with the calculation of the generating function for the right-hand side of (2):
For any
Lemma 6.2. We have the algebraic functional equation for
(52) |
where
Proof. Let
For each
and
otherwise,
and
The reason of defining these two statistics in this way will become transparent when we decompose
For convenience, we use the convention that
Each
●
● and
This decomposition is reversible and satisfies
Turning the above decomposition into generating function yields
(53) |
Similar decomposition as above for
Eliminating
On the other hand, solving (53) gives
Next, we continue to compute the generating function for the left-hand side of (2):
This will be accomplished by applying Stankova's block decomposition [29] (see also [23]) of separable permutations that we now recall.
Lemma 6.3 (Stankova [29]). A permutation
(i)
where
(ii) The elements in any block form a permutation that avoids both
See Fig. 2 for a transparent illustration of this lemma. Condition (ii) is clear, while condition (i) is equivalent to saying that
For convenience, we need to introduce two variants of the double descents. Let
where
where
and
Set
Lemma 6.4. Let
(54) |
Proof. The first three equations of (54) were proved by Wang [30]. We begin with the proof of the fifth equation in (54) by writing
where
Summing over all the above cases gives the fifth equation of (54). The fourth equation of (54) is obtained by writing
We are ready to verify Theorem 1.4.
Proof of Theorem 1.4. We aim to verify that
where
In this paper, we launch a systematic study of the Wilf-equivalence refined by two permutation statistics, namely
In view of Lemmas 2.5 and 5.4, we pose the following open problem about a set-valued extension of Lemma 2.5 for further investigation.
Problem. Let
? |
In particular, we suspect that the equivalence above holds when
Conjecture 2. Let
It is our hope, that the results presented and conceived (see also Conjecture 1) here, would attract more people to work on Wilf-equivalences refined by Comtet statistics, or to unearth and study new Comtet statistics in general.
The authors thank the anonymous referees for their valuable comments and suggestions. Part of this work was initiated at the Research Center for Mathematics and Interdisciplinary Sciences at Shandong University. The authors would like to thank the center for the excellent working condition and the hospitality extended during their stay.
[1] | EESI, Fossil Fuels. Environmental and Energy Study Institute, 2021. Available from: https://www.eesi.org/topics/fossil-fuels/description#: ~: text = Fossil fuels-including coal%2C oil, percent of the world's energy. |
[2] |
Berhe T, Sahu O (2017) Chemically synthesized biofuels from agricultural waste: Optimization operating parameters with surface response methodology (CCD). MethodsX 4: 391–403. https://doi.org/10.1016/j.mex.2017.09.005 doi: 10.1016/j.mex.2017.09.005
![]() |
[3] | EIA, EIA projects nearly 50% increase in world energy use by 2050, led by growth in renewables. Energy Information Administration, 2021. Available from: https://www.eia.gov/todayinenergy/detail.php?id = 49876. |
[4] |
Alsaiari M, Rozina, Ahmad M, et al. (2022) Treatment of Saussurea heteromalla for biofuel synthesis using catalytic membrane reactor. Chemosphere 305: 135335. https://doi.org/10.1016/j.chemosphere.2022.135335 doi: 10.1016/j.chemosphere.2022.135335
![]() |
[5] |
Jariah NF, Hassan MA, Taufiq-yap YH, et al. (2021) Technological advancement for efficiency enhancement of biodiesel and residual glycerol refining: A mini review. Processes 9: 1198. https://doi.org/10.3390/pr9071198 doi: 10.3390/pr9071198
![]() |
[6] | Department of Transport, Renewable Fuels for Transport Policy Statement. Department of Transport, 2022. Available from: https://www.gov.ie/en/policy-information/168c6-renewable-fuels-for-transport-policy-statement/. |
[7] |
Komariah LN, Hadiah F, Aprianjaya F, et al. (2018) Biodiesel effects on fuel filter; Assessment of clogging characteristics. J Phys Conf Ser 1095: 012017. https://doi.org/10.1088/1742-6596/1095/1/012017 doi: 10.1088/1742-6596/1095/1/012017
![]() |
[8] |
Ishola F, Adelekan D, Mamudu A, et al. (2020) Biodiesel production from palm olein: A sustainable bioresource for Nigeria. Heliyon 6: e03725. https://doi.org/10.1016/j.heliyon.2020.e03725 doi: 10.1016/j.heliyon.2020.e03725
![]() |
[9] | Sertoğlu K, Ugural S, Bekun FV (2017) The contribution of agricultural sector on economic growth of Nigeria. Int J Econ Financ Issues 7: 547–552. |
[10] |
Sokan-Adeaga AA, Ana GREE (2015) A comprehensive review of biomass resources and biofuel production in Nigeria: Potential and prospects. Rev Environ Health 30: 143–162. https://doi.org/10.1515/reveh-2015-0015 doi: 10.1515/reveh-2015-0015
![]() |
[11] |
Karmakar R, Kundu K, Rajor A (2018) Fuel properties and emission characteristics of biodiesel produced from unused algae grown in India. Pet Sci 15: 385–395. https://doi.org/10.1007/s12182-017-0209-7 doi: 10.1007/s12182-017-0209-7
![]() |
[12] | Da Costa J, Martins J, Lopes DQ, et al., Comparison between diesel and biodiesel produced from used cooking oil on Diesel engine performance. ResearchGate, 2018. Available from: https://www.researchgate.net/publication/329091976_Comparison_between_diesel_and_biodiesel_produced_from_used_cooking_oil_on_Diesel_engine_performance. |
[13] |
Ramírez-Verduzco LF, Rodríguez-Rodríguez JE, Jaramillo-Jacob ADR (2012) Predicting cetane number, kinematic viscosity, density and higher heating value of biodiesel from its fatty acid methyl ester composition. Fuel 91: 102–111. https://doi.org/10.1016/j.fuel.2011.06.070 doi: 10.1016/j.fuel.2011.06.070
![]() |
[14] |
Dehaghani AHS, Rahimi R (2019) An experimental study of diesel fuel cloud and pour point reduction using different additives. Petroleum 5: 413–416. https://doi.org/10.1016/j.petlm.2018.06.005 doi: 10.1016/j.petlm.2018.06.005
![]() |
[15] |
Tat ME, Van Gerpen JH (2000) Specific gravity of biodiesel and its blends with diesel fuel. J Am Oil Chem Soc 77: 115–119. https://doi.org/10.1007/s11746-000-0019-3 doi: 10.1007/s11746-000-0019-3
![]() |
[16] | Oghenejoboh KM, Umukoro PO (2011) Comparative analysis of fuel characteristics of bio-diesel produced from selected oil-bearing seeds in Nigeria. Eur J Sci Res 58: 238–246. |
[17] |
Huang Y, Li F, Bao G, et al. (2022) Qualitative and quantitative analysis of the influence of biodiesel fatty acid methyl esters on iodine value. Environ Sci Pollut Res 29: 2432–2447. https://doi.org/10.1007/s11356-021-15762-w doi: 10.1007/s11356-021-15762-w
![]() |
[18] |
Guangul FM, Sulaiman SA, Raghavan VR (2012) Elemental and thermo-chemical analysis of oil palm fronds for biomass energy conversion. AIP Conf Proc 1440: 1197–1205. https://doi.org/10.1063/1.4704337 doi: 10.1063/1.4704337
![]() |
[19] | Alleman TL, McCormick RL, Christensen ED, et al. (2016) Biodiesel Handling and Use Guide, 5 Ed., Golden: National Renewable Energy Laboratory. https://doi.org/10.2172/1332064 |
[20] |
Gallagher KS (2013) Why & how governments support renewable energy. Daedalus 142: 59–77. https://doi.org/10.1162/DAED_a_00185 doi: 10.1162/DAED_a_00185
![]() |
[21] |
Banković-Ilić IB, Stamenković OS, Veljković VB (2012) Biodiesel production from non-edible plant oils. Renew Sust Energ Rev 16: 3621–3647. https://doi.org/10.1016/j.rser.2012.03.002 doi: 10.1016/j.rser.2012.03.002
![]() |
[22] | Shoen T, How to Add Lubricity, Improve Fleet Performance and Reduce Emissions. NACS, 2018. Available from: https://fuelsmarketnews.com/how-to-add-lubricity-improve-fleet-performance-and-reduce-emissions/. |
[23] | Gouveia L, Oliveira AC, Congestri R, et al. (2017) Biodiesel from microalgae, In: Muñoz R, Gonzalez-Fernandez C, Microalgae-Based Biofuels Bioprod From Feed Cultiv to End-Products, Cambridge: Woodhead Publishing, 235–258. https://doi.org/10.1016/B978-0-08-101023-5.00010-8 |
[24] |
Adewuyi A (2020) Challenges and prospects of renewable energy in Nigeria: A case of bioethanol and biodiesel production. Energy Rep 6: 77–88. https://doi.org/10.1016/j.egyr.2019.12.002 doi: 10.1016/j.egyr.2019.12.002
![]() |
[25] | Anyaoku OA, Official gazette of the Nigerian bio-fuel policy and incentives. Federal Republic of Nigeria, 2007. Available from: https://www.lse.ac.uk/GranthamInstitute/wp-content/uploads/laws/1517.pdf. |
[26] |
Izah SC, Ohimain EI, Izah SC, et al. (2012) The challenge of biodiesel production from oil palm feedstock in Nigeria By feedstock in Nigeria. Greener J Biol Sci 3: 1–12. https://doi.org/10.15580/GJBS.2013.1.010613363 doi: 10.15580/GJBS.2013.1.010613363
![]() |
[27] | Canciani P, Müller B, Report on barriers to biofuels deployment. European Biofuels Technology Platform, 2015. Available from: https://www.etipbioenergy.eu/images/d3.1-barriers-tobiofuels-deployment-final.pdf. |
[28] |
Bera T, Inglett KS, Wilkie AC (2020) Biofuel: Concepts and considerations. EDIS 2020: SL475. https://doi.org/10.32473/edis-ss688-2020 doi: 10.32473/edis-ss688-2020
![]() |
[29] | Aransiola EF, Daramola MO, Ojumu TV, et al. (2012) Nigerian jatropha curcas oil seeds: Prospect for biodiesel production in Nigeria. Int J Renew Energy Res 2: 317–325. |
[30] | STI, Technology Needs Assessments Report for Climate Change Mitigation—Thailand. National Science Technology and Innovation Policy Office, 2012. Available from: https://tech-action.unepccc.org/wp-content/uploads/sites/2/2013/12/technologyneedsassessment-mitigation-thailand-13.pdf. |
[31] | Christian II JA (2014) Feasibility of second and third generation biofuel in general aviation : A research report and analysis. McNair Sch Res J 1: 4. |
[32] |
Aro EM (2016) From first generation biofuels to advanced solar biofuels. Ambio 45: 24–31. https://doi.org/10.1007/s13280-015-0730-0 doi: 10.1007/s13280-015-0730-0
![]() |
[33] |
Brahma S, Nath B, Basumatary B, et al. (2022) Biodiesel production from mixed oils: A sustainable approach towards industrial biofuel production. Chem Eng J Adv 10: 100284. https://doi.org/10.1016/j.ceja.2022.100284 doi: 10.1016/j.ceja.2022.100284
![]() |
[34] |
Wilson P, Glithero NJ, Ramsden SJ (2014) Prospects for dedicated energy crop production and attitudes towards agricultural straw use: The case of livestock farmers. Energ Policy 74: 101–110. https://doi.org/10.1016/j.enpol.2014.07.009 doi: 10.1016/j.enpol.2014.07.009
![]() |
[35] |
Siqueira SF, Francisco EC, Queiroz MI, et al. (2016) Third generation biodiesel production from microalgae phormidium autumnale. Braz J Chem Eng 33: 427–433. https://doi.org/10.1590/0104-6632.20160333s20150134 doi: 10.1590/0104-6632.20160333s20150134
![]() |
[36] |
Yao Y, You Q, Duan G, et al. (2020) Quantitative trait loci analysis of seed oil content and composition of wild and cultivated soybean. BMC Plant Biol 20: 1–13. https://doi.org/10.1186/s12870-019-2199-7 doi: 10.1186/s12870-019-2170-7
![]() |
[37] |
Matthaus B, Özcan MM, Al Juhaimi F (2016) Some rape/canola seed oils: Fatty acid composition and tocopherols. Z Naturforsch C J Biosci 71: 73–77. https://doi.org/10.1515/znc-2016-0003 doi: 10.1515/znc-2016-0003
![]() |
[38] |
Charbonnier E, Fugeray-Scarbel A, Lemarié S (2019) Rapeseed: how to value varieties with higher nitrogen use efficiency in France. OCL 26: 26. https://doi.org/10.1051/ocl/2019021 doi: 10.1051/ocl/2019021
![]() |
[39] |
Jambo SA, Abdulla R, Azhar SHM, et al. (2016) A review on third generation bioethanol feedstock. Renew Sust Energ Rev 65: 756–769. https://doi.org/10.1016/j.rser.2016.07.064 doi: 10.1016/j.rser.2016.07.064
![]() |
[40] |
Mata TM, Martins AA, Caetano NS (2010) Microalgae for biodiesel production and other applications: A review. Renew Sust Energ Rev 14: 217–232. https://doi.org/10.1016/j.rser.2009.07.020 doi: 10.1016/j.rser.2009.07.020
![]() |
[41] |
Bošnjaković M, Sinaga N (2020) The perspective of large-scale production of algae biodiesel. Appl Sci 10: 8181. https://doi.org/10.3390/app10228181 doi: 10.3390/app10228181
![]() |
[42] |
Alalwan HA, Alminshid AH, Aljaafari HAS (2019) Promising evolution of biofuel generations. Subject review. Renew Energy Focus 28: 127–139. https://doi.org/10.1016/j.ref.2018.12.006 doi: 10.1016/j.ref.2018.12.006
![]() |
[43] | CDP, CDP Technical Note: Biofuels. CDP, 2023. Available from: https://cdn.cdp.net/cdp-production/cms/guidance_docs/pdfs/000/003/647/original/CDP-technical-note-on-biofuels.pdf?1651855056. |
[44] |
Ogbonna I, Moheimani N, Ogbonna J (2015) Potentials of microalgae biodiesel production in Nigeria. Niger J Biotechnol 29: 44. https://doi.org/10.4314/njb.v29i1.7 doi: 10.4314/njb.v29i1.7
![]() |
[45] | Eisentraut A, Sustainable production of second-generation biofuels: Potential and perspectives in major economies and developing countries. International Energy Agency, 2010. Available from: https://www.osti.gov/etdeweb/servlets/purl/21330793. |
[46] | Özçimen D, İnan B, An Overview of Bioethanol Production From Algae. Biofuels—Status and Perspective. InTech, 2015. Available from: https://doi.org/10.5772/59305. |
[47] | Amir N, The cost of algae-based biofuel is still too high. Popular Science, 2022. Available from: https://www.popsci.com/energy/algae-biofuel-too-expensive/. |
[48] |
Nwozor A, Owoeye G, Olowojolu O, et al. (2021) Nigeria's quest for alternative clean energy through biofuels: An assessment. IOP Conf Ser Earth Environ Sci 655: 012054. https://doi.org/10.1088/1755-1315/655/1/012054 doi: 10.1088/1755-1315/655/1/012054
![]() |
[49] |
Igwebuike CM, Awad S, Olanrewaju YA, et al. (2021) The prospect of electricity generation from biomass in the developing countries. Int J Smart Grid Clean Energy 10: 150–156. https://doi.org/10.12720/sgce.10.2.150-156 doi: 10.12720/sgce.10.2.150-156
![]() |
[50] |
Galadima A, Garba ZN, Ibrahim BM, et al. (2011) Biofuels production in Nigeria: The policy and public opinions. J Sustain Dev 4: 22. https://doi.org/10.5539/jsd.v4n4p22 doi: 10.5539/jsd.v4n4p22
![]() |
[51] |
Widenhorn S, Braving the Storm: How are Global Biofuel Policies Sustained Despite Being Contested? An Analysis of the Biofuel Discourses of the EU, Brazil and Mozambique. IBEI Working Papers, 2013. https://doi.org/10.2139/ssrn.2509888 doi: 10.2139/ssrn.2509888
![]() |
[52] | Dizon LSH, Pector AA, Demafelis RB, et al. (2020) Environmental and economic viability of biodiesel production from palm oil in the Philippines. PIChE J 19: 35–41. |
[53] |
Hanif S, Alsaiari M, Ahmad M, et al. (2022) Membrane reactor based synthesis of biodiesel from Toona ciliata seed oil using barium oxide nano catalyst. Chemosphere 308: 136458. https://doi.org/10.1016/j.chemosphere.2022.136458 doi: 10.1016/j.chemosphere.2022.136458
![]() |
[54] |
Monirul IM, Masjuki HH, Kalam MA, et al. (2015) A comprehensive review on biodiesel cold flow properties and oxidation stability along with their improvement processes. RSC Adv 5: 86631–86655. https://doi.org/10.1039/C5RA09555G doi: 10.1039/C5RA09555G
![]() |
[55] |
Malode SJ, Prabhu KK, Mascarenhas RJ, et al. (2021) Recent advances and viability in biofuel production. Energy Convers Manag X 10: 100070. https://doi.org/10.1016/j.ecmx.2020.100070 doi: 10.1016/j.ecmx.2020.100070
![]() |
[56] | Mohr A, Raman S (2015) Lessons from first generation biofuels and implications for the sustainability appraisal of second generation biofuels, In: Gikonyo B, Efficiency and Sustainability in Biofuel Production: Environmental and Land-Use Research, Palm Bay: Apple Academic Press, 281–310. |
[57] |
Hassan AB, Ayodeji OV (2019) Benefits and challenges of biodiesel production in West Africa. Niger J Technol 38: 621. https://doi.org/10.4314/njt.v38i3.12 doi: 10.4314/njt.v38i3.12
![]() |
[58] | Samuel PO, Patrick SO, Bello IM (2013) Biodiesel production in Nigeria: Prospects and challenges. Int J Mod Bot 3: 4–9. |
[59] |
Tudge SJ, Purvis A, De Palma A (2021) The impacts of biofuel crops on local biodiversity: a global synthesis. Biodivers Conserv 30: 2863–2883. https://doi.org/10.1007/s10531-021-02232-5 doi: 10.1007/s10531-021-02232-5
![]() |
[60] |
Popp J, Harangi-Rákos M, Gabnai Z, et al. (2016) Biofuels and their co-products as livestock feed: Global economic and environmental implications. Molecules 21: 1–26. https://doi.org/10.3390/molecules21030285 doi: 10.3390/molecules21030285
![]() |
[61] |
Kiehbadroudinezhad M, Merabet A, Hosseinzadeh-Bandbafha H (2023) A life cycle assessment perspective on biodiesel production from fish wastes for green microgrids in a circular bioeconomy. Bioresour Technol Rep 21: 101303. https://doi.org/10.1016/j.biteb.2022.101303 doi: 10.1016/j.biteb.2022.101303
![]() |
[62] |
Kiehbadroudinezhad M, Hosseinzadeh-Bandbafha H, Varjani S, et al. (2023) Marine shell-based biorefinery: A sustainable solution for aquaculture waste valorization. Renew Energ 206: 623–634. https://doi.org/10.1016/j.renene.2023.02.057 doi: 10.1016/j.renene.2023.02.057
![]() |
[63] |
Ambaye TG, Vaccari M, Bonilla-Petriciolet A, et al. (2021) Emerging technologies for biofuel production: A critical review on recent progress, challenges and perspectives. J Environ Manage 290: 112627. https://doi.org/10.1016/j.jenvman.2021.112627 doi: 10.1016/j.jenvman.2021.112627
![]() |
[64] |
Kiehbadroudinezhad M, Merabet A, Ghenai C, et al. (2023) The role of biofuels for sustainable MicrogridsF: A path towards carbon neutrality and the green economy. Heliyon 9: e13407. https://doi.org/10.1016/j.heliyon.2023.e13407 doi: 10.1016/j.heliyon.2023.e13407
![]() |
proved in | |||
Symmetric | Thm. 3.9 | ||
Thm. 3.10 | |||
|
Hankel | Thm. 3.13 | |
Lower triangular | Thm. 3.15 | ||
Thm. 3.15 | |||
Thm. 3.16 |
proved in | |||
Hankel | Thm. 4.2 | ||
Thm. 4.2 | |||
Diagonal | Thm. 4.3 | ||
Thm. 4.4 | |||
Lower triangular | Thm. 4.6 | ||
Thm. 4.6 | |||
Upper triangular | Thm. 4.6 | ||
Lower triangular | Thm. 4.8 | ||
Thm. 4.8 | |||
Lower triangular | Thm. 4.9 | ||
No pattern | Thm. 4.10 | ||
Thm. 4.11 | |||
Thm. 4.11 | |||
Thm. 4.11 | |||
Ultimately zero | Thm. 4.11 |
proved in | |||
Symmetric | Thm. 3.9 | ||
Thm. 3.10 | |||
|
Hankel | Thm. 3.13 | |
Lower triangular | Thm. 3.15 | ||
Thm. 3.15 | |||
Thm. 3.16 |
proved in | |||
Hankel | Thm. 4.2 | ||
Thm. 4.2 | |||
Diagonal | Thm. 4.3 | ||
Thm. 4.4 | |||
Lower triangular | Thm. 4.6 | ||
Thm. 4.6 | |||
Upper triangular | Thm. 4.6 | ||
Lower triangular | Thm. 4.8 | ||
Thm. 4.8 | |||
Lower triangular | Thm. 4.9 | ||
No pattern | Thm. 4.10 | ||
Thm. 4.11 | |||
Thm. 4.11 | |||
Thm. 4.11 | |||
Ultimately zero | Thm. 4.11 |