期刊文献+
共找到5篇文章
< 1 >
每页显示 20 50 100
ON SOME EXTREMAL PROPERTIES OF ALGEBRAIC POLYNOMIALS
1
作者 谢四清 《Acta Mathematica Scientia》 SCIE CSCD 1995年第4期474-476,共3页
Let P-n be an algebraic polynomial of degree n with real coefficients. We study the extremal properties of the integral integral(-1)(1)(P ''(n) (x))(2)dx and integral(-1)(1) (1-x(2))1/2(P ''(n)(x))(2)d... Let P-n be an algebraic polynomial of degree n with real coefficients. We study the extremal properties of the integral integral(-1)(1)(P ''(n) (x))(2)dx and integral(-1)(1) (1-x(2))1/2(P ''(n)(x))(2)dx subject to the constraint max \P-n(x)\less than or equal to 1. 展开更多
关键词 algebraic polynomial INTERPOLATION
下载PDF
FILTERED-GRADED TRANSFER OF SAGBI BASES IN SOLVABLE POLYNOMIAL ALGEBRAS
2
作者 张江峰 《Journal of Shanghai Jiaotong university(Science)》 EI 2001年第2期134-137,141,共5页
The filtered-graded transfer of SAGBI bases computation in solvable polynomial algebras was considered. The relations among the SAGBI bases of a subalgebra B, its associated graded algebra G(B) and Rees algebra B were... The filtered-graded transfer of SAGBI bases computation in solvable polynomial algebras was considered. The relations among the SAGBI bases of a subalgebra B, its associated graded algebra G(B) and Rees algebra B were got. These relations solve a natural question: how to determine the generating set of G(B) and B from any given generating set of B. Based on these some equivalent conditions for the existence of finite SAGBI bases can be got. 展开更多
关键词 SAGBI basis solvable polynomial algebra FILTRATION
下载PDF
Enhanced NTRU cryptosystem eliminating decryption failures 被引量:3
3
作者 Yao Jun Zeng Guihua 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2006年第4期890-895,共6页
An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to latt... An enhaned NTRU cryptosystem eliminating decryption failures is proposed without using padding schemes and can resist the oracle model andchosen-ciphertext attacks. Because lattice reduction is the main threat to lattice-based cryptosystems, lattice reductionalgorithms are analyzed to evaluate the security of this scheme. Furthermore, the new scheme remains the advantage of high efficiency of original NTRU. 展开更多
关键词 NTRU cryptosystem polynomial algebra decryption failure lattice reduction.
下载PDF
Construction of Simple Modules over the Quantum Affine Space
4
作者 Snehashis Mukherjee Sanu Bera 《Algebra Colloquium》 SCIE CSCD 2024年第1期1-10,共10页
The coordinate ring O_(q)(K^(n))of quantum affine space is the K-algebra presented by generators x_(1),...,x_(n) and relations x_(i)x_(j)=q_(ij)a_(j)a_(i) for all i,j.We construct simple O_(q)(K^(n))-modules in a more... The coordinate ring O_(q)(K^(n))of quantum affine space is the K-algebra presented by generators x_(1),...,x_(n) and relations x_(i)x_(j)=q_(ij)a_(j)a_(i) for all i,j.We construct simple O_(q)(K^(n))-modules in a more general setting where the parameters qij lie in a torsion subgroup of K^(*)and show that analogous results hold as in the uniparameter case. 展开更多
关键词 simple module quantum affine space quantum torus polynomial identity algebra
原文传递
Singular Conformal Oscillator Representations of Orthosymplectic Lie Superalgebras
5
作者 Xiao Ping XU 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2022年第12期2131-2149,共19页
In our earlier paper,we generalize the one-parameter(c)family of inhomogeneous firstorder differential operator representations of the orthogonal Lie algebras arising from conformal transformations to those of orthosy... In our earlier paper,we generalize the one-parameter(c)family of inhomogeneous firstorder differential operator representations of the orthogonal Lie algebras arising from conformal transformations to those of orthosymplectic Lie super algebras,and determine the irreducible condition.This paper deals with the cases when the irreducible condition fails.We prove that if n-m-1>0 and c is an integer satisfying 1≤c≤n-m-1,the representation of osp(2n+2|2m)has a composition series of length 2,and when n-m-1≥0 and c∈-N,the representation of osp(2n+2|2m)has a composition series of length 3,where N is the set of nonnegative integers.Moreover,we show that if c∈(max{n-m,0}-1/2-N)∪(-N),the representation of osp(2n+3|2m)has a composition series of length 2.In particular,we obtain an explicit presentation of the irreducible module with highest weight lλ2-λ1,where l is any positive integer and it is not a generalized Verma module. 展开更多
关键词 Orthosymplectic Lie superalgebra supersymmetric differential operator oscillator representation irreducible module polynomial algebra SINGULAR
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部