A new general algebraic method is presented to uniformly construct a series of exact solutions for nonlinear evolution equations （NLEEs）. For illustration, we apply the new method to shallow long wave approximate eq...A new general algebraic method is presented to uniformly construct a series of exact solutions for nonlinear evolution equations （NLEEs）. For illustration, we apply the new method to shallow long wave approximate equations and successfully obtain abundant new exact solutions, which include rational solitary wave solutions and rational triangular periodic wave solutions. The method is straightforward and concise, and it can also be applied to other nonlinear evolution equations in mathematical physics.展开更多
In this paper, we categorify the algebra Uq（sl2） with the same approach as in [A. Lauda, Adv. Math. （2010）, arXiv：math.QA/0803.3662; M. Khovanov, Comm. Algebra 11 （2001） 5033]. The algebra U =Uq（sl2） is obtai...In this paper, we categorify the algebra Uq（sl2） with the same approach as in [A. Lauda, Adv. Math. （2010）, arXiv：math.QA/0803.3662; M. Khovanov, Comm. Algebra 11 （2001） 5033]. The algebra U =Uq（sl2） is obtained from Uq（sl2） by adjoining a collection of orthogonal idempotents 1λ,λ ∈ P, in which P is the weight lattice of Uq（sl2）. Under such construction the algebra U is decomposed into a direct sum λ∈p 1λ,U1λ. We set the collection of λ∈ P as the objects of the category U, 1-morphisms from λ to λ′ are given by 1λ,U1λ, and 2-morphisms are constructed by some semilinear form defined on U. Hence we get a 2-category u from the algebra Uq（sl2）.展开更多
Some techniques using linear algebra was introduced by Faugore in F4 to speed up the reduction process during Grobner basis computations. These techniques can also be used in fast implementations of F5 and some other ...Some techniques using linear algebra was introduced by Faugore in F4 to speed up the reduction process during Grobner basis computations. These techniques can also be used in fast implementations of F5 and some other signature-based Grobner basis algorithms. When these techniques are applied, a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function （given in F4）. Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function, this step can be very costly when the number of involved polynomials/monomials is huge. In this paper, multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported. Many examples have been tested by using this method, and the experimental data shows that the new method is very efficient.展开更多
It is shown that an n × n matrix of continuous linear maps from a pro-C^＊-algebra A to L（H）, which verifies the condition of complete positivity, is of the form [V^＊TijФ（·）V]^n i,where Ф is a represe...It is shown that an n × n matrix of continuous linear maps from a pro-C^＊-algebra A to L（H）, which verifies the condition of complete positivity, is of the form [V^＊TijФ（·）V]^n i,where Ф is a representation of A on a Hilbert space K, V is a bounded linear operator from H to K, and j=1,[Tij]^n i,j=1 is a positive element in the C^＊-algebra of all n×n matrices over the commutant of Ф（A） in L（K）. This generalizes a result of C. Y.Suen in Proc. Amer. Math. Soc., 112（3）, 1991, 709-712. Also, a covariant version of this construction is given.展开更多
An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its CrSbner basis, no extra Grbbner ...An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its CrSbner basis, no extra Grbbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.展开更多
A class of non-semisimple matrix loop algebras consisting of triangular block matrices is introduced and used to generate bi-integrable couplings of soliton equations from zero curvature equations.The variational iden...A class of non-semisimple matrix loop algebras consisting of triangular block matrices is introduced and used to generate bi-integrable couplings of soliton equations from zero curvature equations.The variational identities under non-degenerate,symmetric and ad-invariant bilinear forms are used to furnish Hamiltonian structures of the resulting bi-integrable couplings.A special case of the suggested loop algebras yields nonlinear bi-integrable Hamiltonian couplings for the AKNS soliton hierarchy.展开更多
文摘A new general algebraic method is presented to uniformly construct a series of exact solutions for nonlinear evolution equations （NLEEs）. For illustration, we apply the new method to shallow long wave approximate equations and successfully obtain abundant new exact solutions, which include rational solitary wave solutions and rational triangular periodic wave solutions. The method is straightforward and concise, and it can also be applied to other nonlinear evolution equations in mathematical physics.
基金Supported by National Natural Science Foundation of China under Grant Nos. 10975102, 10871135, 11031005, and 10871227
文摘In this paper, we categorify the algebra Uq（sl2） with the same approach as in [A. Lauda, Adv. Math. （2010）, arXiv：math.QA/0803.3662; M. Khovanov, Comm. Algebra 11 （2001） 5033]. The algebra U =Uq（sl2） is obtained from Uq（sl2） by adjoining a collection of orthogonal idempotents 1λ,λ ∈ P, in which P is the weight lattice of Uq（sl2）. Under such construction the algebra U is decomposed into a direct sum λ∈p 1λ,U1λ. We set the collection of λ∈ P as the objects of the category U, 1-morphisms from λ to λ′ are given by 1λ,U1λ, and 2-morphisms are constructed by some semilinear form defined on U. Hence we get a 2-category u from the algebra Uq（sl2）.
基金supported by the National Key Basic Research Program of China under Grant Nos.2013CB834203 and 2011CB302400the National Nature Science Foundation of China under Grant Nos.11301523,11371356,61121062+1 种基金the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No.XDA06010701IEE’s Research Project on Cryptography under Grant Nos.Y3Z0013102,Y3Z0018102,and Y4Z0061A02
文摘Some techniques using linear algebra was introduced by Faugore in F4 to speed up the reduction process during Grobner basis computations. These techniques can also be used in fast implementations of F5 and some other signature-based Grobner basis algorithms. When these techniques are applied, a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function （given in F4）. Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function, this step can be very costly when the number of involved polynomials/monomials is huge. In this paper, multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported. Many examples have been tested by using this method, and the experimental data shows that the new method is very efficient.
基金Project supported by the grant CNCSIS (Romanian National Council for Research in High Education)-code A 1065/2006.
文摘It is shown that an n × n matrix of continuous linear maps from a pro-C^＊-algebra A to L（H）, which verifies the condition of complete positivity, is of the form [V^＊TijФ（·）V]^n i,where Ф is a representation of A on a Hilbert space K, V is a bounded linear operator from H to K, and j=1,[Tij]^n i,j=1 is a positive element in the C^＊-algebra of all n×n matrices over the commutant of Ф（A） in L（K）. This generalizes a result of C. Y.Suen in Proc. Amer. Math. Soc., 112（3）, 1991, 709-712. Also, a covariant version of this construction is given.
基金supported by National Key Basic Research Project of China (Grant No.2011CB302400)National Natural Science Foundation of China (Grant Nos. 10971217, 60970152 and 61121062)IIE'S Research Project on Cryptography (Grant No. Y3Z0013102)
文摘An efficient algorithm is proposed for factoring polynomials over an algebraic extension field defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its CrSbner basis, no extra Grbbner basis computation is needed for factoring a polynomial over this extension field. Nothing more than linear algebraic technique is used to get a characteristic polynomial of a generic linear map. Then this polynomial is factorized over the ground field. From its factors, the factorization of the polynomial over the extension field is obtained. The algorithm has been implemented in Magma and computer experiments indicate that it is very efficient, particularly for complicated examples.
基金Project supported by the State Administration of Foreign Experts Affairs of Chinathe National Natural Science Foundation of China (Nos.10971136,10831003,61072147,11071159)+3 种基金the Chunhui Plan of the Ministry of Education of Chinathe Innovation Project of Zhejiang Province (No.T200905)the Natural Science Foundation of Shanghai (No.09ZR1410800)the Shanghai Leading Academic Discipline Project (No.J50101)
文摘A class of non-semisimple matrix loop algebras consisting of triangular block matrices is introduced and used to generate bi-integrable couplings of soliton equations from zero curvature equations.The variational identities under non-degenerate,symmetric and ad-invariant bilinear forms are used to furnish Hamiltonian structures of the resulting bi-integrable couplings.A special case of the suggested loop algebras yields nonlinear bi-integrable Hamiltonian couplings for the AKNS soliton hierarchy.
