The Lascoux, Leclerc and Thibon algorithm and Soergel's tilting algorithm

We generalize Soergel's tilting algorithm to singular weights and deduce from this the validity of the Lascoux-Leclerc-Thibon conjecture on the connection between the canonical basis of the basic submodule of the Fock module and the representation theory of the Hecke-algebras at root of unity. Supported in part by Programa Reticulados y Ecuaciones and by FONDECYT grant 1051024.     

ITERʵ�����ƻ�����

简要介绍了ITER计划的发展历程;综述了ITER实验包层模块计划(ITER-TBM)的历史、主要技术路线和最新的设计与研发进展;概述了与实验包层计划相关的DEMO聚变堆的定义与发展策略。最后,介绍了国内开展的基于固体增殖剂概念的ITER实验包层的初步设计概况,对TBM的研发计划提出了建议。     

具有消息恢复的数字签名方案的一个注记

对具有消息恢复的数字签名方案提出了两种攻击方法.此外,对原方案进行了改进,通过对改进方案的安全性分析得出结论:改进方案比原方案更安全,并且消息恢复过程只需要计算一次大数模幂乘和两次单向函数.     

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

良序套张量积的代数中的强不可约算子

设Ｈ为复的可分无限维Ｈｉｌｂｅｒｔ空间，称有界线性算子Ｔ为强不可约的，如果与Ｔ可交换的幂等算子只有０和Ｉ．王宗尧、蒋春澜、纪有清等人证明了在任何一个套的套代数中都存在大量的强不可约算子，并且找到了它们的酉轨道闭包．本文考虑有限个套的张量积的代数中强不可约算子的存在性问题。证明了：对复平面上任何一个连通完备集σ、总存在一个对角算子Ｎ和它的一个范数可以任意小的紧摄动Ｔ＝Ｘ＋Ｋ，使得Ｔ是一个强不可约算子、Ｔ在有限个良序套的张量积的代数中，并且σ（Ｔ）＝σｌｒｅ（Ｔ）＝σ（Ｎ）＝σｌｒｅ（Ｎ）＝σ进一步，文章还对具有单点谱的算子和良序套与正交补为良序套的张量积的代数进行了讨论，得到了一些结果．     

非因子化方法研究D~+→ ■~0K~+衰变(英文)

在领头阶和αs 修正阶 ,用QCD因子化方法 ,并对它的软胶子效应用光锥QCD求和规则分析D+ → K0 K+ 衰变过程 ,我们分析发现朴素因子化方法的结果远离实验结果 ,QCD因子化方法结果靠近实验结果 ,但是 ,在QCD因子化方法中 ,若考虑软胶子效应 ,其结果与实验结果相一致 .另外 ,计算发现 ,软胶子效应在该衰变道中有相当大的贡献 ,因此不能被忽略     

Factorisation in the ring of exponential polynomials

We study factorisation in the ring of exponential polynomials and provide a proof of Ritt's factorisation theorem in modern notation and so generalised as to deal with polynomial coefficients as well as with several variables. We do this in the more general context of a group ring of a divisible torsion-free ordered abelian group over a unique factorisation domain.

     

Simultaneous approximation for the Bézier variant of Baskakov-Beta operators

In the present paper, we study the rate of convergence in simultaneous approximation for the Bézier variant of the Baskakov-Beta operators by using the decomposition technique of functions of bounded variation.     

Estimating tail probabilities of heavy tailed distributions with asymptotically zero relative error

Efficient estimation of tail probabilities involving heavy tailed random variables is amongst the most challenging problems in Monte-Carlo simulation. In the last few years, applied probabilists have achieved considerable success in developing efficient algorithms for some such simple but fundamental tail probabilities. Usually, unbiased importance sampling estimators of such tail probabilities are developed and it is proved that these estimators are asymptotically efficient or even possess the desirable bounded relative error property. In this paper, as an illustration, we consider a simple tail probability involving geometric sums of heavy tailed random variables. This is useful in estimating the probability of large delays in M/G/1 queues. In this setting we develop an unbiased estimator whose relative error decreases to zero asymptotically. The key idea is to decompose the probability of interest into a known dominant component and an unknown small component. Simulation then focuses on estimating the latter ‘residual’ probability. Here we show that the existing conditioning methods or importance sampling methods are not effective in estimating the residual probability while an appropriate combination of the two estimates it with bounded relative error. As a further illustration of the proposed ideas, we apply them to develop an estimator for the probability of large delays in stochastic activity networks that has an asymptotically zero relative error.      

Sharp precision in Hensel lifting for bivariate polynomial factorization

Popularized by Zassenhaus in the seventies, several algorithms for factoring polynomials use a so-called lifting and recombination scheme. Concerning bivariate polynomials, we present a new algorithm for the recombination stage that requires a lifting up to precision twice the total degree of the polynomial to be factored. Its cost is dominated by the computation of reduced echelon solution bases of linear systems. We show that our bound on precision is asymptotically optimal.