Discrete Hopfield Neural Network is widely used in solving various optimization problems and logic mining. Boolean algebras are used to govern the Discrete Hopfield Neural Network to produce final neuron states that possess a global minimum energy solution. Non-systematic satisfiability logic is popular due to the flexibility that it provides to the logical structure compared to systematic satisfiability. Hence, this study proposed a non-systematic majority logic named Major 3 Satisfiability logic that will be embedded in the Discrete Hopfield Neural Network. The model will be integrated with an evolutionary algorithm which is the multi-objective Election Algorithm in the training phase to increase the optimality of the learning process of the model. Higher content addressable memory is proposed rather than one to extend the measure of this work capability. The model will be compared with different order logical combinations k=3,2, k=3,2,1 and k=3,1. The performance of those logical combinations will be measured by Mean Absolute Error, Global Minimum Energy, Total Neuron Variation, Jaccard Similarity Index and Gower and Legendre Similarity Index. The results show that k=3,2 has the best overall performance due to its advantage of having the highest chances for the clauses to be satisfied and the absence of the first-order logic. Since it is also a non-systematic logical structure, it gains the highest diversity value during the learning phase.
Citation: Muhammad Aqmar Fiqhi Roslan, Nur Ezlin Zamri, Mohd. Asyraf Mansor, Mohd Shareduwan Mohd Kasihmuddin. Major 3 Satisfiability logic in Discrete Hopfield Neural Network integrated with multi-objective Election Algorithm[J]. AIMS Mathematics, 2023, 8(9): 22447-22482. doi: 10.3934/math.20231145
[1] | Houssem Eddine Khochemane, Ali Rezaiguia, Hasan Nihal Zaidi . Exponential stability and numerical simulation of a Bresse-Timoshenko system subject to a neutral delay. AIMS Mathematics, 2023, 8(9): 20361-20379. doi: 10.3934/math.20231038 |
[2] | Abdelkader Moumen, Fares Yazid, Fatima Siham Djeradi, Moheddine Imsatfia, Tayeb Mahrouz, Keltoum Bouhali . The influence of damping on the asymptotic behavior of solution for laminated beam. AIMS Mathematics, 2024, 9(8): 22602-22626. doi: 10.3934/math.20241101 |
[3] | Khaled zennir, Djamel Ouchenane, Abdelbaki Choucha, Mohamad Biomy . Well-posedness and stability for Bresse-Timoshenko type systems with thermodiffusion effects and nonlinear damping. AIMS Mathematics, 2021, 6(3): 2704-2721. doi: 10.3934/math.2021164 |
[4] | Tae Gab Ha, Seyun Kim . Existence and energy decay rate of the solutions for the wave equation with a nonlinear distributed delay. AIMS Mathematics, 2023, 8(5): 10513-10528. doi: 10.3934/math.2023533 |
[5] | Abdelbaki Choucha, Sofian Abuelbacher Adam Saad, Rashid Jan, Salah Boulaaras . Decay rate of the solutions to the Lord Shulman thermoelastic Timoshenko model. AIMS Mathematics, 2023, 8(7): 17246-17258. doi: 10.3934/math.2023881 |
[6] | Abdelbaki Choucha, Salah Boulaaras, Asma Alharbi . Global existence and asymptotic behavior for a viscoelastic Kirchhoff equation with a logarithmic nonlinearity, distributed delay and Balakrishnan-Taylor damping terms. AIMS Mathematics, 2022, 7(3): 4517-4539. doi: 10.3934/math.2022252 |
[7] | Yudhveer Singh, Devendra Kumar, Kanak Modi, Vinod Gill . A new approach to solve Cattaneo-Hristov diffusion model and fractional diffusion equations with Hilfer-Prabhakar derivative. AIMS Mathematics, 2020, 5(2): 843-855. doi: 10.3934/math.2020057 |
[8] | Afraz Hussain Majeed, Sadia Irshad, Bagh Ali, Ahmed Kadhim Hussein, Nehad Ali Shah, Thongchai Botmart . Numerical investigations of nonlinear Maxwell fluid flow in the presence of non-Fourier heat flux theory: Keller box-based simulations. AIMS Mathematics, 2023, 8(5): 12559-12575. doi: 10.3934/math.2023631 |
[9] | Saima Rashid, Fahd Jarad, Hajid Alsubaie, Ayman A. Aly, Ahmed Alotaibi . A novel numerical dynamics of fractional derivatives involving singular and nonsingular kernels: designing a stochastic cholera epidemic model. AIMS Mathematics, 2023, 8(2): 3484-3522. doi: 10.3934/math.2023178 |
[10] | José Luis Díaz Palencia, Saeed ur Rahman, Antonio Naranjo Redondo . Analysis of travelling wave solutions for Eyring-Powell fluid formulated with a degenerate diffusivity and a Darcy-Forchheimer law. AIMS Mathematics, 2022, 7(8): 15212-15233. doi: 10.3934/math.2022834 |
Discrete Hopfield Neural Network is widely used in solving various optimization problems and logic mining. Boolean algebras are used to govern the Discrete Hopfield Neural Network to produce final neuron states that possess a global minimum energy solution. Non-systematic satisfiability logic is popular due to the flexibility that it provides to the logical structure compared to systematic satisfiability. Hence, this study proposed a non-systematic majority logic named Major 3 Satisfiability logic that will be embedded in the Discrete Hopfield Neural Network. The model will be integrated with an evolutionary algorithm which is the multi-objective Election Algorithm in the training phase to increase the optimality of the learning process of the model. Higher content addressable memory is proposed rather than one to extend the measure of this work capability. The model will be compared with different order logical combinations k=3,2, k=3,2,1 and k=3,1. The performance of those logical combinations will be measured by Mean Absolute Error, Global Minimum Energy, Total Neuron Variation, Jaccard Similarity Index and Gower and Legendre Similarity Index. The results show that k=3,2 has the best overall performance due to its advantage of having the highest chances for the clauses to be satisfied and the absence of the first-order logic. Since it is also a non-systematic logical structure, it gains the highest diversity value during the learning phase.
Filippov introduced a generalized Jacobi identity for n-ary skew-symmetric operation, which acts as a replacement for the classical Jacobi identity in the context of Lie algebras [5]. He also proposed the concept of n-Lie algebra, also known as Filippov n-algebra, with the corresponding generalized Jacobi identity referred to as the Filippov identity. Nambu and Takhtajan extended the concept of Poisson manifold to an n-ary generalization called Nambu-Poisson structure in order to study Hamiltonian mechanics more comprehensively [15,17]. It is worth noting that both the Nambu-Poisson structure and the n-Lie algebra share the same generalized Jacobi identity. Grabowski and Marmo introduced the concept of Filippov n-algebroids, an n-ary generalization of Lie algebroids, in order to determine the relationship between linear Nambu-Poisson structures and Filippov algebras [7]. Consequently, it is reasonable to anticipate that many tools used to study Lie algebroids could be enhanced or upgraded to the realm of Filippov algebroids. Therefore, we aim to address the absence of the concepts of connections and curvatures of Filippov algebroids in the literature and provide a primitive analysis of these topics from a geometric point of view.
Recall that a Lie algebroid is a (real) vector bundle A→M together with a bundle map ρ:A→TM, called anchor, and a Lie bracket [⋅,⋅] on the section space Γ(A) of A, satisfying that ρ:Γ(A)→Γ(TM) is a morphism of Lie algebras and the Leibniz rule
[X,fY]=f[X,Y]+(ρ(X)f)Y,∀X,Y∈Γ(A) and f∈C∞(M). |
By an easy smooth analysis, the bracket [⋅,⋅] can always be reformulated in the form
[X,Y]=∇XY−∇YX, | (1.1) |
where ∇:Γ(A)×Γ(A)→Γ(A) satisfies the properties
∇fXY=f∇XY and ∇X(fY)=f∇XY+(ρ(X)f)Y. |
One calls ∇ a connection on the anchored bundle (A,ρ). (This is indeed a straightforward generalization of connections on vector bundles.)
When the bracket [−,−] of a Lie algebroid A is expressed in the form (1.1), one says that the connection ∇ is torsion free. See [9] for the existence of torsion free connections on Lie algebroids. The curvature form R∇∈Γ(∧2A∗⊗End(A)) of such a connection ∇ is defined in the standard manner:
R∇(X,Y)(Z)=∇X∇YZ−∇Y∇XZ−∇[X,Y]Z, |
for all X,Y,Z∈Γ(A). Now, ρ being a morphism of Lie algebras is equivalent to the condition that R∇ is a tensor in its third argument. Moreover, the Jacobi identity for [,] is transformed into the following Lie-Bianchi identity
R∇(X,Y)(Z)+R∇(Y,Z)(X)+R∇(Z,X)(Y)=0. |
Therefore, Lie algebroids can be realized as anchored bundles equipped with special connections [16]. We wish to find an analogous characterization of the n-ary bracket of any Filippov algebroid. A significant difference between Lie algebroids and Filippov n-algebroids (for n⩾3) is that the bracket and anchor of the latter are of more arguments (see Definition 2.2). So there is not an obvious way to extend Eq (1.1). We come up with a solution in Section 3. Below is a quick summary:
● First, we define (multi-input) connections compatible with a given (multi-input) n-anchor (see Definition 3.1). This is a quite straightforward extension of usual connections of Lie algebroids (when n=2).
● Second, we introduce the curvature form R∇ stemming from a connection ∇ (see Eq (3.2)). We believe that this is a highly nontrivial invention of this note.
● Third, we prove in Theorem 3.1 that certain good connections, which we call Filippov connections, fully determines Filippov algebroid structures. This includes two points: (1) The n-ary bracket of any Filippov algebroid can be realized in a torsion free manner (see Eq (3.1)); (2) The generalized Jacobi identity is transformed to a constraint, called the Bianchi-Filippov identity (see Eq (3.3)) about the associated curvature R∇.
We then illustrate a simple method via covariant differential operators to construct Filippov connections in Section 3.3.
As vector bundles are fiber bundles with linear fibers, particular cases of homogeneity structures, linear geometrical structures on vector bundles are of particular interest (see also [6] on weighted structures for various geometric objects on manifolds with general homogeneity structures). We finally show that there exists a one-to-one correspondence between Filippov n-algebroid structures on a vector bundle A of rank n⩾3 and linear Nambu-Poisson structures on its dual bundle A∗ (see Theorem 4.1). As an interesting application of our result, one is able to construct linear Nambu-Poisson structures from Filippov connections (Corollary 4.4).
In short summary, torsion-free connections subject to the Bianchi-Filippov identity are important geometric constraints for Filippov algebroids. It is well known that torsion free connections for Lie algebroids play a crucial role in various mathematical constructions, for example, in the construction of Poincaré-Birkhoff-Witt isomorphisms and Kapranov dg manifolds for Lie algebroid pairs [9]. Additionally, Bianchi identities are not only significant in Riemannian geometry, but also in Poisson geometry [3]. We believe that our approach to Filippov algebroids will be beneficial in this context.
In this section, we recall the definition of Filippov algebroids from [7]. There is an alternative characterization of Filippov algebroids in terms of certain 1-derivations [13]. It is important to note that n⩾2 is an integer, although the only interesting situation is when n⩾3. Let us start with a notion of n-anchored bundles.
Definition 2.1. An n-anchored vector bundle over a smooth manifold M is pair (A,ρ), where A is a vector bundle over M and ρ:∧n−1A→TM is a vector bundle morphism, called n-anchor of A.
Definition 2.2. A Filippov n-algebroid over a smooth manifold M is an n-anchored bundle (A,ρ) over M together with an R-multilinear and skew-symmetric n-bracket on the section space Γ(A) of A:
[⋅,⋯,⋅]:Γ(A)×⋅⋅⋅×Γ(A)⏟n−copies→Γ(A), |
satisfying the following compatibility conditions:
(1) The n-anchor ρ intertwines the n-bracket and the standard Lie bracket [⋅,⋅]TM on Γ(TM):
[ρ(X1∧⋅⋅⋅∧Xn−1),ρ(Y1∧⋅⋅⋅∧Yn−1)]TM=n−1∑i=1ρ(Y1∧⋅⋅⋅∧[X1,⋯,Xn−1,Yi]∧⋅⋅⋅∧Yn−1); | (2.1) |
(2) The n-bracket is a derivation with respect to C∞(M)-multiplications:
[X1,⋯,Xn−1,fY]=f[X1,⋯,Xn−1,Y]+ρ(X1∧⋅⋅⋅∧Xn−1)(f)Y; | (2.2) |
(3) The following equation holds, to be called the (generalized) Jacobi identity (or Filippov identity):
[X1,⋯,Xn−1,[Y1,⋯,Yn]]=n∑i=1[Y1,⋯,Yi−1,[X1,⋯,Xn−1,Yi],Yi+1,⋯,Yn], | (2.3) |
for all Xi,Yi∈Γ(A) and f∈C∞(M).
Note that any Lie algebroid is a Filippov 2-algebroid. A Filippov n-algebra is a Filippov n-algebroid over the one-point base manifold. In fact, analogous to the Lie algebroid case (i.e., n=2 case), the condition (1) in the above definition follows from the conditions (2) and (3).
The following examples (due to [7]) illustrate two Filippov n-algebroid structures on the trivial tangent bundle TRm of Rm for m⩾n⩾2.
Example 2.3. Consider the trivial n-anchored bundle (TRm,ρ=0). For each Filippov n-algebra structure on Rm with structure constants {cji1,⋯,in} and each smooth function g∈C∞(Rm), we have a Filippov n-algebroid (TRm,0) whose bracket is defined by
[f1∂∂xi1,⋯,fn∂∂xin]=gf1⋯fnm∑j=1cji1,⋯,in∂∂xj. |
Example 2.4. Equip TRm with the n-anchor map ρ defined by the tensor field
dx1∧⋅⋅⋅∧dxn−1⊗∂∂x1, |
where x1,⋯,xn−1,xn,⋯,xm are coordinates of Rm. Then, the n-anchored bundle (TRm,ρ) together with the trivial n-bracket on generators ∂∂xi produces a (nontrivial) Filippov n-algebroid over Rm.
We emphasize a crucial but often overlooked point in the literature: the presence of a Filippov n-bracket on an n-anchored bundle (A,ρ) imposes a constraint on the rank of ρ for every integer n⩾3.
Proposition 2.5. Let (A,[⋅,⋅⋅⋅,⋅],ρ) be a Filippov n-algebroid for n⩾3. Then the rank of the image of ρ as a distribution on M can not exceed 1, i.e., rank(ρ(∧n−1A))⩽1.
Proof. Suppose that the image of ρ at p∈M is not trivial. So we can find an open neighborhood U of p and some Y1∧⋅⋅⋅∧Yn−1∈Γ(∧n−1A)|U such that ρ(Y1∧⋅⋅⋅∧Yn−1) is nowhere vanishing on U. The desired statement amounts to show that, if ρ(X1∧⋅⋅⋅∧Xn−1) is also nowhere vanishing on U, then there exists some c∈C∞(U) such that
ρ(X1∧⋯∧Xn−1)=cρ(Y1∧⋯∧Yn−1). |
In fact, by the definition of Filippov n-algebroids, we obtain
[ρ(fX1∧⋯∧Xn−1),ρ(Y1∧⋯∧Yn−1)]by Eq (2.1)=n−1∑i=1ρ(Y1∧⋯∧Yi−1∧[fX1,X2,⋯,Xn−1,Yi]∧Yi+1∧⋯∧Yn−1)by Eq (2.2)=fn−1∑i=1ρ(Y1∧⋯∧Yi−1∧[X1,X2,⋯,Xn−1,Yi]∧Yi+1∧⋯∧Yn−1)+n−1∑i=1(−1)n−1ρ(X2∧⋯∧Xn−1∧Yi)(f)ρ(Y1∧⋯∧Yi−1∧X1∧Yi+1∧⋯∧Yn−1)by Eq (2.1)=f[ρ(X1∧⋯∧Xn−1),ρ(Y1∧⋯∧Yn−1)]+n−1∑i=1(−1)n−1ρ(X2∧⋯∧Xn−1∧Yi)(f)ρ(Y1∧⋯∧Yi−1∧X1∧Yi+1∧⋯∧Yn−1). |
Moreover, since ρ is a morphism of vector bundles, we have
[ρ(fX1∧⋅⋅⋅∧Xn−1),ρ(Y1∧⋅⋅⋅∧Yn−1)]=[fρ(X1∧⋅⋅⋅∧Xn−1),ρ(Y1∧⋅⋅⋅∧Yn−1)]=f[ρ(X1∧⋅⋅⋅∧Xn−1),ρ(Y1∧⋅⋅⋅∧Yn−1)]−ρ(Y1∧⋅⋅⋅∧Yn−1)(f)ρ(X1∧⋅⋅⋅∧Xn−1). |
Setting Y1=X1 in the above two equations, we obtain
ρ(X1∧⋅⋅⋅∧Xn−1)(f)ρ(X1∧Y2∧⋅⋅⋅∧Yn−1)=−ρ(X1∧Y2∧⋅⋅⋅∧Yn−1)(f)ρ(X1∧⋅⋅⋅∧Xn−1). | (2.4) |
Using Eq (2.4), we have
ρ(X1∧⋅⋅⋅∧Xn−1)=g1ρ(X1∧Y2∧⋅⋅⋅∧Yn−1)=−g1ρ(Y2∧X1∧⋯∧Yn−1)=−g1g2ρ(Y2∧Y1∧⋅⋅⋅∧Yn−1)=g1g2ρ(Y1∧⋅⋅⋅∧Yn−1), |
for some g1,g2∈C∞(U).
(1) If ρ(X1∧Y2∧⋅⋅⋅∧Yn−1) is nowhere vanishing on U, then the vector fields ρ(X1∧⋅⋅⋅∧Xn−1) and ρ(Y1∧⋅⋅⋅∧Yn−1) must be C∞(U)-linearly dependent.
(2) If ρ(X1∧Y2∧⋅⋅⋅∧Yn−1)|p=0, then we let ˜X1=X1+Y1 and consider ρ(˜X1∧Y2∧⋅⋅⋅∧Yn−1), which is nowhere vanishing on U. By arguments in (1) as above, ρ(˜X1∧X2∧⋅⋅⋅∧Xn−1) and ρ(Y1∧⋅⋅⋅∧Yn−1) are C∞(U)-linearly dependent, and we obtain the desired statement as well.
In this section, we characterize Filippov algebroids via connections on the underlying anchored bundles.
Definition 3.1. A connection on an n-anchored bundle (A,ρ) is a bilinear map ∇:Γ(∧n−1A)×Γ(A)→Γ(A) satisfying two conditions:
∇fX1∧⋯∧Xn−1Xn=f∇X1∧⋯∧Xn−1Xn, and ∇X1∧⋯∧Xn−1(fXn)=f∇X1∧⋯∧Xn−1Xn+ρ(X1∧⋯∧Xn−1)(f)Xn |
for all X1,⋯,Xn∈Γ(A) and f∈C∞(M).
To see the existence of such a connection, one takes a TM-connection on A, say ∇TM, and then define ∇ on the n-anchored bundle (A,ρ) as the pullback of ∇TM:
∇X1∧⋯∧Xn−1Xn:=∇TMρ(X1∧⋯∧Xn−1)Xn. |
The key point of this note is that any connection ∇ on (A,ρ) induces a skew-symmetric n-bracket on Γ(A) defined by
[X1,⋯,Xn]∇:=n∑i=1(−1)n+i∇X1∧⋅⋅⋅^Xi⋅⋅⋅∧XnXi=n∑i=1(−1)(n−1)i∇Xi+1∧⋅⋅⋅∧Xn∧X1∧⋅⋅⋅∧Xi−1Xi. | (3.1) |
For computational convenience, we denote the covariant derivative on Γ(A) along X1,⋯,Xn−1∈Γ(A) by
X∇1⋯n−1:=[X1,⋯,Xn−1,−]∇:Γ(A)→Γ(A). |
It extends to all sections in ∧∙A by
X∇1⋯n−1(Y1∧⋅⋅⋅∧Ym):=m∑i=1Y1∧⋅⋅⋅∧Yi−1∧X∇1⋯n−1(Yi)∧Yi+1∧⋅⋅⋅∧Ym. |
We then introduce the curvature form of ∇, an operation
R∇(−⋯−,−)(−):Γ(A)×⋯×Γ(A)⏟(n−1)−copies×Γ(∧n−1A)×Γ(A)→Γ(A), |
defined by
R∇(X1,⋯,Xn−1,Y1∧⋅⋅⋅∧Yn−1)(Z):=[X∇1⋯n−1,∇Y1∧⋅⋅⋅∧Yn−1](Z)−∇X∇1⋯n−1(Y1∧⋅⋅⋅∧Yn−1)Z:=X∇1⋯n−1∇Y1∧⋅⋅⋅∧Yn−1Z−∇Y1∧⋅⋅⋅∧Yn−1X∇1⋯n−1Z−∇X∇1⋯n−1(Y1∧⋅⋅⋅∧Yn−1)Z, | (3.2) |
for all X1,⋯,Xn−1,Y1,⋯,Yn−1,Z∈Γ(A) and n⩾3. When n=3, it reads
R∇(X1,X2,Y1∧Y2)(Z)=X∇12∇Y1∧Y2Z−∇Y1∧Y2X∇12Z−∇X∇12(Y1∧Y2)Z=[X1,X2,∇Y1∧Y2Z]∇−∇Y1∧Y2[X1,X2,Z]∇ −∇[X1,X2,Y1]∇∧Y2+Y1∧[X1,X2,Y2]∇Z. |
When n=4, the expression of R∇ consists of twenty terms. As n gets larger, more terms are involved.
It is easy to verify from the defining Eq (3.2) that the curvature R∇ is C∞(M)-linear with respect to the argument Y1∧⋯∧Yn−1. However, R∇ need not be tensorial in X1,⋯,Xn−1 although it is skew-symmetric in these arguments.
Definition 3.2. A connection ∇ on an n-anchored bundle (A,ρ) is called a Filippov connection if the following two conditions are true:
(1) The curvature R∇ is C∞(M)-linear with respect to its last argument, i.e., for all f∈C∞(M) and all X1,⋯,Xn−1,Y1,⋯,Yn∈Γ(A), we have
R∇(X1,⋯,Xn−1,Y1∧⋅⋅⋅∧Yn−1)(fYn)=fR∇(X1,⋯,Xn−1,Y1∧⋅⋅⋅∧Yn−1)(Yn); |
(2) The following equality holds, to be called the Bianchi-Filippov identity:
0=n−1∑i=0(−1)(n−1)iR∇(X1,⋯,Xn−1,Yi+1∧⋅⋅⋅∧Yn∧Y1∧⋅⋅⋅∧Yi−1)Yi, | (3.3) |
where Y0 means Yn.
We are ready to state our main theorem, which characterizes Filippov algebroids fully by Filippov connections.
Theorem 3.3. Let (A,ρ) be an n-anchored bundle. If ∇ is a Filippov connection on (A,ρ), then (A,ρ,[⋅,⋯,⋅]∇) is a Filippov n-algebroid, where [⋅,⋯,⋅]∇ is the n-bracket given by Eq (3.1). Moreover, any Filippov n-algebroid structure on (A,ρ) arises from a Filippov connection in this way.
The proof of Theorem 3.3 is divided, and will follow immediately from the three lemmas below.
Lemma 3.4. Let ∇ be a connection on an n-anchored bundle (A,ρ). The curvature R∇ satisfies the first condition of Definition 3.2 if and only if the anchor ρ intertwines the induced n-bracket [⋅,⋯,⋅]∇ and the Lie bracket [⋅,⋅]TM on Γ(TM), i.e.,
[ρ(X1∧⋅⋅⋅∧Xn−1),ρ(Y1∧⋅⋅⋅∧Yn−1)]TM=n−1∑i=1ρ(Y1∧⋅⋅⋅∧[X1,⋯,Xn−1,Yi]∇∧⋅⋅⋅∧Yn−1), |
for all X1,⋯,Xn−1,Y1,⋯,Yn−1∈Γ(A).
Proof. By the definition of curvature, we have
R∇(X1,⋯,Xn−1,Y1∧⋯∧Yn−1)(fYn)by Eq (3.2)=[X∇1⋯n−1,∇Y1∧⋯∧Yn−1](fYn)−∇X∇1⋯n−1(Y1∧⋯∧Yn−1)(fYn)=X∇1⋯n−1∇Y1∧⋯∧Yn−1(fYn)−∇Y1∧⋯∧Yn−1X∇1⋯n−1(fYn)−∇X∇1⋯n−1(Y1∧⋯∧Yn−1)(fYn)=fR∇(X1,⋯,Xn−1,Y1∧⋯∧Yn−1)(Yn)+ρ(X1∧⋯∧Xn−1)ρ(Y1∧⋯∧Yn−1)(f)Yn−ρ(Y1∧⋯∧Yn−1)ρ(X1∧⋯∧Xn−1)(f)Yn−n−1∑i=1ρ(Y1∧⋯∧X∇1⋯n−1(Yi)∧⋯∧Yn−1)(f)Yn. |
Hence, the curvature R∇ is C∞(M)-linear with respect to its last argument if and only if
ρ(X1∧⋯∧Xn−1)ρ(Y1∧⋯∧Yn−1)−ρ(Y1∧⋯∧Yn−1)ρ(X1∧⋯∧Xn−1)=n−1∑i=1ρ(Y1∧⋯∧X∇1⋯n−1(Yi)∧⋯∧Yn−1)=n−1∑i=1ρ(Y1∧⋯∧[X1,⋯,Xn−1,Yi]∇∧⋯∧Yn−1). |
Lemma 3.5. Let ∇ be a connection on an n-anchored bundle (A,ρ). The curvature R∇ satisfies the second condition of Definition 3.2, i.e., the Bianchi-Filippov identity (3.3), if and only if the induced n-bracket [⋅,⋯,⋅]∇ satisfies the (generalized) Jacobi identity (2.3).
Proof. The statement follows directly from the following lines of computation:
n−1∑i=0(−1)(n−1)iR∇(X1,⋯,Xn−1,Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1)Yiby Eq (3.2)=n−1∑i=0(−1)(n−1)i([X∇1⋯n−1,∇Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1](Yi)−∇X∇1⋯n−1(Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1)Yi)=[X1,⋯,Xn−1,n−1∑i=0(−1)(n−1)i∇Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1(Yi)]∇−n−1∑i=0(−1)(n−1)i(∇Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1X∇1⋯n−1(Yi)+∑j≠i∇Yi+1∧⋯∧X∇1⋯n−1(Yj)∧⋯∧Yi−1Yi)by Eq (3.1)=[X1,⋯,Xn−1,[Y1,⋯,Yn]∇]∇−n−1∑i=0(−1)(n−1)i∇Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1[X1,⋯,Xn−1,Yi]∇−n−1∑i=0∑j≠i(−1)(n−1)i∇Yi+1∧⋯∧[X1,⋯,Xn−1,Yj]∇∧⋯∧Yi−1Yiby Eq (3.1)=[X1,⋯,Xn−1,[Y1,⋯,Yn]∇]∇−n∑i=1[Y1,⋅,[X1,⋯,Xn−1,Yi]∇,⋯,Yn]∇. |
The next lemma shows that any Filippov algebroid can be realized by a Filippov connection.
Lemma 3.6. Let (A,[⋅,⋯,⋅],ρ) be a Filippov n-algebroid. Then there exists a Filippov connection ∇ on the underlying n-anchored bundle (A,ρ) such that [⋅,⋯,⋅]=[⋅,⋯,⋅]∇ (the torsion-free property).
Proof. Given a connection ∇∘ on (A,ρ), we are able to obtain an R-multilinear operation K(⋅,⋅⋅⋅,⋅) on Γ(A) by
K(X1,⋯,Xn):=[X1,⋯,Xn]−[X1,⋯,Xn]∇∘. |
Using axioms of Filippov algebroids, it is easy to see that K(⋅,⋯,⋅) is indeed C∞(M)-multilinear. Then we define a new connection ∇ on (A,ρ) by
∇X1∧⋯∧Xn−1Xn:=1nK(X1,⋯,Xn)+∇∘X1∧⋯∧Xn−1Xn. |
It remains to check the desired equality:
[X1,⋯,Xn]∇=∇X1∧⋯∧Xn−1Xn+n−1∑i=1(−1)(n−1)i∇Xi+1∧⋯∧Xn∧X1∧⋯∧Xi−1Xi=K(X1,⋯,Xn)+∇∘X1∧⋯∧Xn−1Xn+n−1∑i=1(−1)(n−1)i∇∘Xi+1∧⋯∧Xn∧X1∧⋯∧Xi−1Xi=[X1,⋯,Xn]. |
The following examples illustrate three Filippov connections on the trivial tangent bundle TRm of Rm for m⩾n⩾2.
Example 3.7. Consider the trivial n-anchored vector bundle (TRm,ρ=0). Suppose that the vector space Rm is endowed with a Filippov n-algebra structure whose structure constants are {cji1⋯in} with respect to the standard basis of Rm. Given a smooth function g∈C∞(Rm) and a set of constants {aji1⋯in−1;in} satisfying the equality:
aji1⋯in−1;in+n−1∑k=1(−1)(n−1)kajik+1⋯ini1⋯ik−1;ik=cji1⋯in, | (3.4) |
we are able to obtain a connection on (TRm,ρ=0) generated by the only one nontrivial relation:
∇∂∂xi1∧⋯∧∂∂xin−1∂∂xin:=gm∑j=1aji1⋯in−1;in∂∂xj. |
It follows from the recipe in Eqs (3.1) and (3.4) that
[∂∂xi1,⋯,∂∂xin]∇=gm∑i=1cji1⋯in∂∂xj. |
So, what we recover is the Filippov structure on TRm as in Example 2.3. Hence, ∇ is indeed a Filippov connection.
Example 3.8. Consider the n-anchor map ρ on the tangent bundle TRm defined by the tensor field dx1∧⋅⋅⋅∧dxn−1⊗∂∂x1, where x1,⋯,xn−1,xn,⋯,xm are coordinate functions of Rm. It is obvious that the (nontrivial) connection on (TRm,ρ) generated by the trivial relation:
∇∂∂xi1∧⋯∧∂∂xin−1∂∂xin:=0, |
produces a nontrivial n-bracket which is compatible with ρ. Indeed, what we recover is the Filippov structure on TRm as in Example 2.4, and the said connection ∇ is a Filippov connection.
Example 3.9. Continue to work with the anchored bundle (A,ρ) as in the previous example. We consider a different connection with the only nontrivial generating relations:
∇Z∂∂xk={(−1)σ∂∂xk,if Z=∂∂xσ1∧⋯∧∂∂xσn−1,0,otherwise, |
where σ is a permutation {1,⋯,n−1}, for all xk∈{x1,⋯,xm}. Then, the associated n-bracket is given by
[∂∂xσ1,⋯,∂∂xσn−1,∂∂xk]∇={(−1)σ∂∂xk,ifk>n−1,0,otherwise, |
where σ is a permutation {1,⋯,n−1}. By subtle analysis, one can find that the associated curvature R∇ is just zero. Hence ∇ is truly a Filippov connection and the above bracket defines a Filippov algebroid structure on (A,ρ).
Let A→M be a vector bundle. Consider the bundle CDO(A) of covariant differential operators (cf. [10]*Ⅲ, [11], see also [8], where the notation D(A) is used instead of CDO(A)). An element D of Γ(CDO(A)), called a covariant differential operator, is an R-linear operator Γ(A)→Γ(A) together with a vector field ˆD∈Γ(TM), called the symbol of D, satisfying
D(fX)=fD(X)+ˆD(f)⋅X,∀X∈Γ(A),f∈C∞(M). |
The operator D can be first extended by the Leibniz rule to an operator D:Γ(∧n−1A)→Γ(∧n−1A). By taking dual we obtain an operator D:Γ(∧n−1A∗)→Γ(∧n−1A∗) defined by
⟨X1∧⋅⋅⋅∧Xn−1|D(ˉη)⟩=ˆD⟨X1∧⋅⋅⋅∧Xn−1|ˉη⟩−n−1∑i=1⟨X1∧⋅⋅⋅∧D(Xi)∧⋅⋅⋅∧Xn−1|ˉη⟩, | (3.5) |
for all X1,⋯,Xn−1∈Γ(A) and ˉη∈Γ(∧n−1A∗).
Given a pair (D,ˉξ), where D∈Γ(CDO(A)) and ˉξ∈Γ(∧n−1A∗), one is able to construct a map
ρ(D,ˉξ):Γ(∧n−1A)→Γ(TM),X1∧⋅⋅⋅∧Xn−1↦⟨X1∧⋅⋅⋅∧Xn−1|ˉξ⟩ˆD. |
It is clear that ρ(D,ˉξ) makes A an n-anchored bundle, and the rank of the image of ρ(D,ˉξ) does not exceed 1.
Define a connection on the n-anchored bundle (A,ρ(D,ˉξ)) by
∇(D,ˉξ)X1∧⋅⋅⋅∧Xn−1Xn:=⟨X1∧⋯∧Xn−1|ˉξ⟩D(Xn). | (3.6) |
Proposition 3.10. If the pair (D,ˉξ) is subject to the relation
D(ˉξ)=gˉξ,for some g∈C∞(M), | (3.7) |
then ∇(D,ˉξ) defined as in (3.6) is a Filippov connection on the n-anchored bundle (A,ρ(D,ˉξ)).
Proof. We denote ∇(D,ˉξ) by ∇ for simplicity below. It suffices to check the associated curvature R∇ is C∞(M)-linear with respect to the last argument and satisfies the Bianchi-Filippov identity (3.3). In fact, we have
R∇(X1,⋯,Xn−1,Y1∧⋯∧Yn−1)(fYn)by Eq (3.2)=X∇1⋯n−1∇Y1∧⋯∧Yn−1(fYn)−∇Y1∧⋯∧Yn−1X∇1⋯n−1(fYn)−∇X∇1⋯n−1(Y1∧⋯∧Yn−1)(fYn)by Eqs (3.1), (3.5), (3.6)=fR∇(X1,⋯,Xn−1,Y1∧⋯∧∧Yn−1)(Yn)+(⟨X1∧⋯∧Xn−1|ˉξ⟩⟨Y1∧⋯∧Yn−1|D(ˉξ)⟩−⟨Y1∧⋯∧Yn−1|ˉξ⟩⟨X1∧⋯∧Xn−1|D(ˉξ)⟩)ˆD(f)Ynby Eq (3.7)=fR∇(X1,⋯,Xn−1,Y1∧⋯∧Yn−1)(Yn), |
and
n−1∑i=0(−1)(n−1)iR∇(X1,⋯,Xn−1,Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1)Yiby Eq (3.2)=n−1∑i=0(−1)(n−1)i[X∇1⋯n−1,∇Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1](Yi)−n−1∑i=0(−1)(n−1)i∇X∇1⋯n−1(Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1)Yiby Eqs (3.1) and (3.6) =n−1∑i=0(−1)(n−1)i⟨Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1|ˉξ⟩X∇1⋯n−1(D(Yi))−n−1∑i=0(−1)(n−1)i⟨Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1|ˉξ⟩D(X∇1⋯n−1(Yi))+n−1∑i=0(−1)(n−1)iX∇1⋯n−1(⟨Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1|ˉξ⟩)D(Yi)−n−1∑i=0(−1)(n−1)i∑j≠i⟨Yi+1∧⋯∧X∇1⋯n−1(Yj)∧⋯∧Yi−1|ˉξ⟩D(Yi)by Eqs (3.1), (3.5) and (3.6)=n−1∑i=0(−1)(n−1)i⟨X1∧⋯∧Xn−1|ˉξ⟩⟨Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1|D(ˉξ)⟩−n−1∑i=0(−1)(n−1)i⟨Yi+1∧⋯∧Yn∧Y1∧⋯∧Yi−1|ˉξ⟩⟨X1∧⋯∧Xn−1|D(ˉξ)⟩by Eq (3.7)=0. |
Hence, ∇(D,ˉξ) defined as in (3.6) is indeed a Filippov connection.
As a consequence of Theorem 3.3, a pair (D,ˉξ) subject to condition (3.7) produces a Filippov n-algebroid structure on A. Its n-bracket reads:
[X1,⋯,Xn]∇(D,ˉξ)=⟨X1∧⋅⋅⋅∧Xn−1|ˉξ⟩D(Xn)+(−1)n−1⟨X2∧⋅⋅⋅∧Xn|ˉξ⟩D(X1)+⋯ +⟨Xn−1∧Xn∧X1∧⋅⋅⋅∧Xn−3|ˉξ⟩D(Xn−2)+(−1)n−1⟨Xn∧X1∧⋅⋅⋅∧Xn−2|ˉξ⟩D(Xn−1). |
In this section, we unravel under certain conditions a relation between linear Nambu-Poisson structures and Filippov connections.
Definition 4.1. [14,17] A Nambu-Poisson structure of order n on a smooth manifold P is an R-multilinear and skew-symmetric n-bracket on the smooth function space C∞(P):
{⋅,⋅⋅⋅,⋅}:C∞(P)×⋅⋅⋅×C∞(P)⏟n−copies→C∞(P), |
satisfying the following two conditions:
(1) The n-bracket is a derivation with respect to C∞(P)-multiplications:
{f1,⋯,fn−1,g1g2}=g1{f1,⋯,fn−1,g2}+{f1,⋯,fn−1,g1}g2; |
(2) The (generalized) Jacobi identity (also known as the fundamental identity):
{f1,⋯,fn−1,{g1,⋯,gn}}=n∑i=1{g1,⋯,{f1,⋯,fn−1,gi},⋯,gn}, |
holds for all fi and gj∈C∞(P).
The pair (P,{⋅,⋅⋅⋅,⋅}) is called a Nambu-Poisson manifold.
Alternatively, one could express the said bracket via an n-vector field π on P such that
{f1,⋯,fn}=π(df1,⋯,dfn),∀f1,⋯,fn∈C∞(P). | (4.1) |
Given a smooth vector bundle p:A→M, the section space Γ(A) are identified as the space C∞lin(A∗) of fiberwise linear functions on A∗, the dual vector bundle of A; while elements in p∗(C∞(M)) are called basic functions on A∗. To fix the notations, for any section X∈Γ(A), let ϕX∈C∞lin(A∗) be the corresponding linear function on A∗.
Definition 4.2. [1] A Nambu-Poisson structure of order n on the vector bundle A∗→M is said to be linear, if it satisfies the following three conditions:
(1) The bracket of n linear functions is again a linear function;
(2) The bracket of (n−1) linear functions and a basic function is a basic function;
(3) The bracket of n functions is zero if there are more than one basic functions among the arguments.
In fact, the second and the third condition in the above definition can be derived from the first condition.
Note that any Poisson manifold is a Nambu-Poisson manifold of order 2. A well-known fact is the following: A Lie algebroid A over M gives rise to a linear Poisson manifold A∗, and vice versa. It is pointed out in [1]*Theorem 4.4 that a linear Nambu-Poisson structure of order n on A∗ corresponds to a Filippov n-algebroid structure on A (see also [2]). However, the reverse process is generally not valid for the cases of n⩾3, mainly because the condition of a Nambu-Poisson structure is very strong (cf. [12]). Nevertheless, in this paper, we will require that A be a rank n vector bundle and establish the one-to-one correspondence between Filippov n-algebroid structures on A and linear Nambu-Poisson structures on A∗. In specific, under the said condition, our main theorem below serves as a complement to [1]*Theorem 4.4.
Theorem 4.3. Let (A,ρ,[⋅,⋯,⋅]) be a Filippov n-algebroid over a smooth manifold M, where A→M is a vector bundle of rank n⩾3. Then there exists a unique linear Nambu-Poisson structure on the dual bundle A∗→M such that for all sections X1,⋯,Xn∈Γ(A),
{ϕX1,⋯,ϕXn}=ϕ[X1,⋯,Xn]. | (4.2) |
Note that, if Eq (4.2) holds, then it is easy to deduce that the linear Nambu-Poisson structure on A∗ and the anchor map ρ are also related:
{ϕX1,⋯,ϕXn−1,p∗f}=p∗(ρ(X1∧⋅⋅⋅∧Xn−1)(f)), | (4.3) |
for all f∈C∞(M) and X1,⋯,Xn−1∈Γ(A).
As a direct application of Theorems 3.3 and 4.3, one can construct linear Nambu-Poisson structures out of Filippov connections:
Corollary 4.4. If ∇ is a Filippov connection on an n-anchored bundle (A,ρ), where A→M is a vector bundle of rank n⩾3, then the dual bundle A∗ admits a unique linear Nambu-Poisson structure of order n defined by
{ϕX1,⋯,ϕXn}=ϕ[X1,⋯,Xn]∇, |
for all X1,⋯,Xn∈Γ(A).
The proof is divided into three steps.
Step 1. Since functions of type ϕX (for X∈Γ(A)) and p∗f (for f∈C∞(M)) generate C∞(A∗), there exists a unique R-multilinear n-bracket {⋅,⋯,⋅} on C∞(A∗) satisfying Eqs (4.2) and (4.3). We wish to write the corresponding n-vector field π on A∗ explicitly.
To this end, we work locally and consider the trivialization A|U≅U×Rn over an open subset U⊂M with coordinates x1,⋯,xm; let {X1,⋯,Xn} be a local basis of Γ(A|U). Then
{y1=ϕX1,⋯,yn=ϕXn,p∗x1,⋯,p∗xm} |
forms a chart on A∗|U. For convenience, p∗xi is denoted by xi.
Suppose further that the Filippov algebroid A|U is described by the structure functions ck and f1⋯ˆl⋯n∈C∞(U) such that
[X1,⋯,Xn]=n∑k=1ckXk, |
and ρ(X1∧⋯^Xl⋯∧Xn)=f1⋯ˆl⋯n∂∂x1. |
Here we have utilized Proposition 2.5. Then one is able to find the expression of the n-vector field π on A∗|U:
π=n∑k=1ckyk∂∂y1∧⋯∧∂∂yn+n∑l=1f1⋯ˆl⋯n∂∂y1∧⋯∧∂∂^yl∧⋯∧∂∂yn∧∂∂x1, | (4.4) |
which corresponds to the n-bracket {⋯} on A∗|U.
Step 2. We need to set up a preparatory lemma.
Lemma 4.5. There exists a local basis {X1,⋯,Xn} of Γ(A|U) such that the corresponding structure functions ck and f1⋯ˆl⋯n satisfy the following relations: for all i≠j (in {1,⋯,n}),
f1⋯ˆi⋯n∂f1⋯ˆj⋯n∂x1=f1⋯ˆj⋯n∂f1⋯ˆi⋯n∂x1; | (4.5) |
(−1)if1⋯ˆi⋯ncj=(−1)jf1⋯ˆj⋯nci. | (4.6) |
Proof. Consider the map ρ:∧n−1A|U→TU. By Proposition 2.5, for any point p∈U, we have rank(ρ(∧n−1A)p)⩽1, and thus dim(ker(ρp))⩾(n−1). Note that the subset V⊂U where dim(ker(ρp)) is locally constant is open and dense. By a continuity argument if necessary, we may assume that dim(ker(ρp)) is locally constant on U. Thus, we are able to find a local basis {Z1,⋯,Zn} of Γ(∧n−1A|U) such that ρ(Z2), ⋯, ρ(Zn) are trivial.
Take an arbitrary Ω∈Γ(∧nA|U) which is nowhere vanishing on U. Consider
Ω♯:A∗|U→∧n−1A|U, Ω♯(α):=iαΩ, |
which is an isomorphism of vector bundles. Then we obtain a basis {α1, ⋯, αn} of Γ(A∗|U) by setting αi:=(Ω♯)−1(Zi). Let {X1,⋯,Xn} be the dual basis of Γ(A|U) corresponding to {α1,⋯,αn}. There exists a nowhere vanishing smooth function g∈C∞(U) such that Ω=gX1∧⋯∧Xn, and hence Zi=iαiΩ=gX1∧⋯^Xi∧⋯∧Xn.
Since we have ρ(Zi)=0 (∀i∈{2,⋯,n}), we also have
ρ(X1∧⋯^Xi∧⋯∧Xn)=0,∀i∈{2,⋯,n}. | (4.7) |
Using the axiom of a Filippov algebroid, we have a relation
f1⋯ˆi⋯n∂f1⋯ˆj⋯n∂x1∂∂x1−f1⋯ˆj⋯n∂f1⋯ˆi⋯n∂x1∂∂x1=[f1⋯ˆi⋯n∂∂x1,f1⋯ˆj⋯n∂∂x1]TM=[ρ(X1∧⋯∧^Xi∧⋯∧Xn),ρ(X1∧⋯∧^Xj∧⋯∧Xn)]TMby Eq. (2.1)=n∑k=1,k<jρ(X1∧⋯∧[X1,⋯,^Xi,⋯,Xn,Xk]∧⋯∧^Xj∧⋯Xn)+n∑k=1,k>jρ(X1∧⋯∧^Xj∧⋯∧[X1,⋯,^Xi,⋯,Xn,Xk]∧⋯Xn)=(−1)(n−i)cif1⋯ˆj⋯n∂∂x1−(−1)(n−j)cjf1⋯ˆi⋯n∂∂x1. |
According to the previous fact (4.7), all the lines above must be trivial, and thus the desired two equalities (4.5) and (4.6) are proved.
Step 3. We wish to show that the n-bracket {⋅,⋯,⋅} given in Step 1, or the n-vector field π locally given in Eq (4.4), is a linear Nambu-Poisson structure on A∗.
We need the following proposition due to Dufour and Zung [4].
Proposition 4.6. [4] Let Ω be a volume form on an l-dimensional manifold P, and π an n-vector filed on P, where l>n⩾3. Consider the (l−n)-form ω:=ιπΩ on P. Then π defines a Nambu-Poisson structure (via Eq (4.1)) if and only if ω satisfies the following two conditions:
(ιKω)∧ω=0, | (4.8) |
(ιKω)∧dω=0, | (4.9) |
for any (l−n−1)-vector field K on P.
Consider the volume form Ω=dy1∧⋯dyn∧dx1∧⋯∧dxm on A∗|U, where U, yi, and xj are as earlier, and we suppose that such a coordinate system stems from {X1,⋯,Xn} fulfills Lemma 4.5. According to Proposition 4.6, we need to examine the m-form defined by:
ω:=ιπΩ=n∑k=1ckykdx1∧⋯∧dxm+n∑j=1(−1)n−j+1f1⋯ˆj⋯ndyj∧dx2∧⋯∧dxm. |
We can easily check that ω satisfies Eq (4.8) and hence it remains to check Eq (4.9). One first finds that
dω=n∑k=1ykdck∧dx1∧⋯∧dxm+n∑k=1ckdyk∧dx1∧⋯∧dxm +n∑j=1(−1)n−j+1df1⋯ˆj⋯n∧dyj∧dx2∧⋯∧dxm=n∑k=1ckdyk∧dx1∧⋯∧dxm+n∑j=1(−1)n−j+1∂f1⋯ˆj⋯n∂x1dx1∧dyj∧dx2∧⋯∧dxm. |
Consider the following special type of (m−1)-vector field on A∗|U: K=∂∂x2∧⋯∧∂∂xm. Then one computes:
(ιKω)∧dω=(−1)m−1(n∑k=1ckykdx1+n∑j=1(−1)n−j+1f1⋯ˆj⋯ndyj)∧dω=n∑j=1(−1)m+n−jf1⋯ˆj⋯ndyj∧n∑i=1cidyi∧dx1∧⋯∧dxm+n∑j=1(−1)m+n−jf1⋯ˆj⋯ndyj∧n∑i=1(−1)n−i+1∂f1⋯ˆi⋯n∂x1dx1∧dyi∧dx2∧⋯∧dxm=(−1)mn∑j=1n∑i=1,i≠j((−1)(n−i)cif1⋯ˆj⋯n−(−1)(n−j)cjf1⋯ˆi⋯n)dyj∧dyi+n∑j=1n∑i=1,i≠j(−1)m+i+j(f1⋯ˆj⋯n∂f1⋯ˆi⋯n∂x1−f1⋯ˆi⋯n∂f1⋯ˆj⋯n∂x1)dyj∧dyiby Eqs. (4.5) and (4.6)=0. |
This justifies Eq (4.9) for this particular K. For other types of K, it is easy to verify Eq (4.9) as well. This completes the proof of Theorem 4.3.
In order to understand the geometry of Filippov n-algebroids, we introduced a kind of multi-input connections on n-anchored vector bundles. Filippov n-brackets could be reconstructed from such connections. Moreover, all compatibility conditions in the definition of Filippov n-algebroids correspond to some natural conditions on connections. These connections are called Filippov connections. We also provided with concrete constructions on Filippov connections, which led to many examples of Filippov n-algebroids. As an application, we obtain a one-to-one correspondence between Filippov n-algebroid structures on a vector bundle A of rank n and linear Nambu-Poisson structures on its dual bundle A∗.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
We are grateful to the anonymous referees for constructive suggestions to improve the presentation of the manuscript. This work is supported by the National Natural Science Foundation of China (NSFC) grants 11961049, 11901221 and 12071241, and by the Key Project of Jiangxi Natural Science Foundation grant 20232ACB201004.
The authors declare no conflicts of interest in this paper.
[1] |
M. Abdallah, M. A. Talib, S. Feroz, Q. Nasir, H. Abdalla, B. Mahfood, Artificial intelligence applications in solid waste management: A systematic research review, Waste Manage., 109 (2020), 231–246. https://doi.org/10.1016/j.wasman.2020.04.057 doi: 10.1016/j.wasman.2020.04.057
![]() |
[2] |
S. Agatonovic-Kustrin, R. Beresford, Basic concepts of artificial neural network (ANN) modeling and its application in pharmaceutical research, J Pharm. Biomed. Anal., 22 (2000), 717–727. https://doi.org/10.1016/s0731-7085(99)00272-1 doi: 10.1016/s0731-7085(99)00272-1
![]() |
[3] |
J. J. Hopfield, D. W. Tank, "Neural" computation of decisions in optimization problems, Biol. Cybern., 52 (1985), 141–152. https://doi.org/10.1007/bf00339943 doi: 10.1007/bf00339943
![]() |
[4] |
W. A. T. W. Abdullah, Logic programming on a neural network, Int. J. Intell. Syst., 7 (1992), 513–519. https://doi.org/10.1002/int.4550070604 doi: 10.1002/int.4550070604
![]() |
[5] |
A. Alway, N. E. Zamri, S. A. Karim, M. A. Mansor, M. S. M. Kasihmuddin, M. M, Bazuhair, Major 2 satisfiability logic in discrete Hopfield neural network, Int. J. Comput. Math. 99 (2022), 924–948. https://doi.org/10.1080/00207160.2021.1939870 doi: 10.1080/00207160.2021.1939870
![]() |
[6] |
S. A. Karim, M. S. M. Kasihmuddin, S. Sathasivam, M. A. Mansor, S. Z. M. Jamaludin, M. R. Amin, A Novel Multi-Objective Hybrid Election Algorithm for Higher-Order Random Satisfiability in Discrete Hopfield Neural Network, Mathematics, 10 (2022), 1963. https://doi.org/10.3390/math10121963 doi: 10.3390/math10121963
![]() |
[7] |
M. M. Bazuhair, S. Z. M. Jamaludin, N. E. Zamri, M. S. M. Kasihmuddin, M. A. Mansor, A. Alway, S. A. Karim, Novel Hopfield Neural Network Model with Election Algorithm for Random 3 Satisfiability, Processes, 9 (2021), 1292. https://doi.org/10.3390/pr9081292 doi: 10.3390/pr9081292
![]() |
[8] |
M. S. M. Kasihmuddin, M. A. Mansor, S. Sathasivam, Hybrid Genetic Algorithm in the Hopfield Network for Logic Satisfiability Problem, Pertanika J. Sci. Technol., 25 (2017), 139–152. https://doi.org/10.1063/1.4995911 doi: 10.1063/1.4995911
![]() |
[9] | M. A. Mansor, M. S. M. Kasihmuddin, S. Sathasivam, Artificial Immune System Paradigm in the Hopfield Network for 3-Satisfiability Problem, Pertanika J. Sci. Technol., 25 (2017), 1173–1188. |
[10] |
N. E. Zamri, M. A. Mansor, M. S. M. Kasihmuddin, A. Alway, S. Z. M. Jamaludin, S. A. Alzaeemi, Amazon employees resources access data extraction via clonal selection algorithm and logic mining approach, Entropy, 22 (2020), 596. https://doi.org/10.3390/e22060596 doi: 10.3390/e22060596
![]() |
[11] |
S. A. Karim, N. E. Zamri, A. Alway, M. S. M. Kasihmuddin, A. I. M. Ismail, M. A. Mansor, et al., Random satisfiability: A higher-order logical approach in discrete Hopfield Neural Network, IEEE Access, 9 (2021), 50831–50845. https://doi.org/10.1109/access.2021.3068998 doi: 10.1109/access.2021.3068998
![]() |
[12] | E. Pacuit, S. Salame, Majority Logic, KR, 4 (2004), 598–605. |
[13] |
Z. Zheng, S. Yang, Y. Guo, X. Jin, R. Wang, Meta-heuristic Techniques in Microgrid Management: A Survey, Swarm Evol. Comput., 78 (2023), 101256. https://doi.org/10.1016/j.swevo.2023.101256 doi: 10.1016/j.swevo.2023.101256
![]() |
[14] |
H. Emami, F. Derakhshan, Election algorithm: A new socio-politically inspired strategy, AI Commun., 28 (2015), 591–603. https://doi.org/10.3233/aic-140652 doi: 10.3233/aic-140652
![]() |
[15] |
H. Emami, Chaotic election algorithm, Comput. Inform. 38 (2019), 1444–1478. https://doi.org/10.31577/cai_2019_6_1444 doi: 10.31577/cai_2019_6_1444
![]() |
[16] |
S. Sathasivam, M. A. Mansor, M. S. M. Kasihmuddin, H. Abubakar, Election algorithm for random k satisfiability in the Hopfield neural network, Processes, 8 (2020), 568. https://doi.org/10.3390/pr8050568 doi: 10.3390/pr8050568
![]() |
[17] |
B. F. B. A. Boya, B. Ramakrishnan, J. Y. Effa, J. Kengne, K. Rajagopal, Effects of bias current and control of multistability in 3D hopfield neural network, Heliyon, 9 (2023), 13034. https://doi.org/10.1016/j.heliyon.2023.e13034. doi: 10.1016/j.heliyon.2023.e13034
![]() |
[18] | S. Z. M. Jamaludin, N. A. Romli, M. S. M. Kasihmuddin, A. Baharum, M. A. Mansor, M.F. Marsani, Novel logic mining incorporating log linear approach, J. King Saud Univ. Comput. Inform. Sci., 34 (2022), 9011–9027. |
[19] | M. S. M. Kasihmuddin, S. Z. M. Jamaludin, M. A. Mansor, H. A. Wahab, S. M. S. Ghadzi, Supervised learning perspective in logic mining, Mathematics, 10 (2022), 915. |
[20] |
Y. Guo, M. S. M. Kasihmuddin, Y. Gao, M. A. Mansor, H. A. Wahab, N. E. Zamri, et al., YRAN2SAT: A novel flexible random satisfiability logical rule in discrete hopfield neural network, Adv. Eng. Software, 171 (2022), 103169. https://doi.org/10.1016/j.advengsoft.2022.103169 doi: 10.1016/j.advengsoft.2022.103169
![]() |
[21] |
N. Bacanin, C. Stoean, M. Zivkovic, M. Rakic, R. Strulak-Wójcikiewicz, R. Stoean, On the Benefits of Using Metaheuristics in the Hyperparameter Tuning of Deep Learning Models for Energy Load Forecasting, Energies, 16 (2023), 1434. https://doi.org/10.3390/en16031434 doi: 10.3390/en16031434
![]() |
[22] |
S. Z. M. Jamaludin, M. S. M. Kasihmuddin, A. I. M. Ismail, M. A. Mansor, M.F.M. Basir, Energy based logic mining analysis with hopfield neural network for recruitment evaluation. Entropy, 23 (2020), 40. https://doi.org/10.3390/e23010040 doi: 10.3390/e23010040
![]() |
[23] |
J. Chen, M. S. M. Kasihmuddin, Y. Gao, Y. Guo, M. A. Mansor, N.A. Romli, et al., PRO2SAT: Systematic Probabilistic Satisfiability logic in Discrete Hopfield Neural Network, Adv. Eng. Software, 175 (2023), 103355. https://doi.org/10.1016/j.advengsoft.2022.103355 doi: 10.1016/j.advengsoft.2022.103355
![]() |
[24] | L. C. Kho, M. S. M. Kasihmuddin, M. A. Mansor, S. Sathasivam, Logic Mining in League of Legends, Pertanika J. Sci. Technol., 28 (2020), 211–225. |
[25] |
N. Khentout, G. Magrotti, Fault supervision of nuclear research reactor systems using artificial neural networks: A review with results, Ann. Nucl. Energy, 185 (2023), 109684. https://doi.org/10.1016/j.anucene.2023.109684 doi: 10.1016/j.anucene.2023.109684
![]() |
[26] |
N. Kanwisher, M. Khosla, K. Dobs, Using artificial neural networks to ask 'why'questions of minds and brains, Trends Neurosci., 46 (2023), 240–254. https://doi.org/10.1016/j.tins.2022.12.008 doi: 10.1016/j.tins.2022.12.008
![]() |
[27] |
S. S. M. Sidik, N. E. Zamri, M. S. M. Kasihmuddin, H. A. Wahab, Y. Guo, M. A. Mansor, Non-Systematic Weighted Satisfiability in Discrete Hopfield Neural Network Using Binary Artificial Bee Colony Optimization, Mathematics, 10 (2022), 1129. https://doi.org/10.3390/math10071129 doi: 10.3390/math10071129
![]() |
[28] | S. Subiyanto, A. Mohamed, M. A. Hannan, Intelligent maximum power point tracking for PV system using Hopfield neural network optimized fuzzy logic controller, Energ. Buildings, 51 (2012), 29–38. |
[29] |
L. Abualigah, A. Diabat, S. Mirjalili, M. Abd Elaziz, A. H. Gandomi, The arithmetic optimization algorithm, Comput. Method. Appl. M., 376 (2021), 113609. https://doi.org/10.1016/j.cma.2020.113609 doi: 10.1016/j.cma.2020.113609
![]() |
[30] |
Z. Wang, L. Shen, X. Li, L. Gao, An improved multi-objective firefly algorithm for energy-efficient hybrid flowshop rescheduling problem, J. Clean. Produc., 385 (2023), 135738. https://doi.org/10.1016/j.jclepro.2022.135738 doi: 10.1016/j.jclepro.2022.135738
![]() |
[31] | W. H. Bangyal, A. Hameed, J. Ahmad, K. Nisar, M. R. Haque, A. A. A. Ibrahim, et al., New modified controlled bat algorithm for numerical optimization problem, Comput., Mater. Con., 70 (2022), 2241–2259. |
[32] | M. Kobayashi, Quaternion projection rule for rotor hopfield neural networks, IEEE T. Neur. Net. Lear., 32 (2020), 900–908. |
[33] |
M. Safavi, A. K. Siuki, S. R. Hashemi, New optimization methods for designing rain stations network using new neural network, election, and whale optimization algorithms by combining the Kriging method, Environ. Monit. Assess., 193 (2021), 4. https://doi.org/10.1007/s10661-020-08726-z doi: 10.1007/s10661-020-08726-z
![]() |
[34] | X. Dang, X. Tang, Z. Hao, J. Ren, Discrete Hopfield neural network based indoor Wi-Fi localization using CSI, EURASIP J. Wirel. Commun., 2020 (2020), 76. |
[35] | G. J. Sawale, S. R. Gupta, Use of artificial neural network in data mining for weather forecasting, Int. J. Comput. Sci. Appl., 6 (2013), 383–387. |
[36] | Z. Zhang, L. Zheng, Y. Zhou, Q. Guo, A Novel Finite-Time-Gain-Adjustment Controller Design Method for UAVs Tracking Time-Varying Targets, IEEE T. Intell. Transport. Syst., 23 (2021), 12531–12543. |