项链李代数的结构

研究项链李代数的结构,定义了箭图Q的重箭图Q循环上的映射σ,证明了这是一个李运算.引入左右指标数组概念,利用它们把项链李代数N_Q的基分成了5类,并构造了项链李代数的一些有趣的子代数.     

由特殊箭图诱导的项链李子代数

无限维项链李代数是新的一类无限维李代数,本文重点讨论了由特殊箭图诱导的项链李子代数,并证明了其中一些李子代数是半单李代数.     

项链李代数的性质

研究项链李代数的性质,给出了其中心元的表示形式,证明了项链李代数非半单、非可解,通过构造项链李代数的可解非幂零子代数,证明了当箭图中有长度大于1的循环时,项链李代数非幂零.还给出了没有圈的箭图上项链李代数的分解.     

McKay箭图与覆盖空间

本文研究在自然扩张和嵌入下特殊线性群和一般线性群的有限子群的McKay 箭图间的关系. 我们证明在特定条件下, 一般线性群GL(m;C) 的有限子群G的McKay 箭图是其正规子群G∩SL(m;C)的McKay 箭图的正则覆盖, 而当把G 嵌入SL(m+1;C) 时, 新的McKay 箭图由在原来的McKay 箭图的每一顶点加上一个由其Nakayama 平移到其自身的箭向得到. 作为例子, 我们指出如何用这些方法得到一些有趣的McKay 箭图.     

关于项链李代数的结构

Le Bruyn和V．Ginzbrug最近引入了项链李代数。它是定义在箭图上的一种无限堆李代数，在非交换几何研究中起了重要作用。本研究项链李代数结构，证明了当箭图中有长度大于1的循环时，其项链李代数不是幂零李代数，我们还给出了没有圈的箭图上项链李代数的分解。     

由六个顶点的箭图诱导的项链李子代数

无限维项链李代数是新的一类无限维李代数,本文重点讨论了由六个顶点的箭图诱导的项链李子代数,研究了这类李子代数的子代数,同构和同态,这类李代数是Virasoro-like李代数的推广,并讨论了它的其他一些性质.     

McKay箭图与m-Cartan矩阵谨将本文献给刘绍学教授80华诞

引入m-Cartan矩阵,并指出与Euclid图的Cartan矩阵的二次型的某些性质可以推广到McKay箭图的m-Cartan矩阵.还刻画了特殊线性群有限Abel子群的McKay箭图.     

浅谈同构在解析几何中的应用

本文从同构方式、同构原理、同构过程及对特殊情况的转化来探讨同构法在解析几何中的应用,同构作为优化运算的一种重要方式,对于数学运算的核心素养的提升有着重要意义.     

B型量子群的Kashiwara算子

利用一个带特殊自同构的A_2n-1型Dynkin箭图上的F-稳定表示,刻画了B型量子群的Kashiwara算子.同时指出邓、杜和张文章中的主要结果对于B₂型赋值箭图并不成立.     

斜群代数的截断代数和平凡扩张

主要讨论有限群G=N×MSL(3,C)的McKay箭图,及其对应的斜群代数∧V*G的截断箭图和截断代数的性质,证明了当3|(n+1),3|r时,其特殊截断代数的平凡扩张与斜群代数∧V*G同构.     

Practical algorithms to rank necklaces,Lyndon words,and de Bruijn sequences

We present practical algorithms for ranking k-ary necklaces and Lyndon words of length n. The algorithms are based on simple counting techniques. By repeatedly applying the ranking algorithms, both necklaces and Lyndon words can be efficiently unranked. Then, explicit details are given to rank and unrank the length n substrings of the lexicographically smallest de Bruijn sequence of order n.     

The lexicographically smallest universal cycle for binary strings with minimum specified weight

H. Fredricksen, I.J. Kessler and J. Maiorana discovered a simple but elegant construction of a universal cycle for binary strings of length n: Concatenate the aperiodic prefixes of length n binary necklaces in lexicographic order. We generalize their construction to binary strings of length n whose weights are in the range $c,c+1,\dots ,n$ by simply omitting the necklaces with weight less than c. We also provide an efficient algorithm that generates the universal cycles in constant amortized time per bit using $O(n)$ space. Our universal cycles have the property of being the lexicographically smallest universal cycle for the set of binary strings of length n with weight ≥c.     

Slowly oscillating functions in semigroup compactifications and convolution algebras

The paper proposes a unified approach to many key theorems proved in the last twenty years in different areas of abstract harmonic analysis. This approach is based on the so-called slowly oscillating functions which were introduced in coarse geometry. In addition to this method being the most natural and simple, it also leads to the generalisation of some of the results and to the achievement of some new results. Several of these results concern the topological centres of convolution algebras and semigroup compactifications.     

在Newton-PCG方法中的一个一维整数最优化问题

本文研究在Newton-PCG方法中出现的一个一维整数最优化问题．通过引入和研究几个连续变量的辅助问题，我们建立了一个简单而有效的算法．这一算法的主要计算量是求解两次非线形方程zlnz—c=0，因此是非常小的．另外，我们还对这一问题的最优值进行了估计．     

A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints

In this paper, we present a new self-adaptive alternating direction method for solving a class of variational inequality problems with both linear equality and inequality constraints without the need to add any extra slack variables. The method is simple because it needs only to perform some projections and function evaluations. In addition, to further enhance its efficiency, we adopt a self-adaptive strategy to adjust parameter μ at each iteration. Convergence of the proposed method is proved under certain conditions. Numerical experience illustrates the efficiency of the new method.     

On the symplectic structure of instanton moduli spaces

We study the complex symplectic structure of the quiver varieties corresponding to the moduli spaces of SU(2) instantons on both commutative and non-commutative R⁴. We identify global Darboux coordinates and quadratic Hamiltonians on classical phase spaces for which these quiver varieties are natural completions. We also show that the group of non-commutative symplectomorphisms of the corresponding path algebra acts transitively on the moduli spaces of non-commutative instantons. This paper should be viewed as a step towards extending known results for Calogero–Moser spaces to the instanton moduli spaces.     

关于图的最大亏格的下界

主要考虑2-边和3-边连通图的最大亏格下界情形,推广了J.Chen等(1996)的主要结果,证明了     

Evolutionary structural optimization for problems with stiffness constraints

This paper presents a simple evolutionary procedure based on finite element analysis to minimize the weight of structures while satisfying stiffness requirements. At the end of each finite element analysis, a sensitivity number, indicating the change in the stiffness due to removal of each element, is calculated and elements which make the least change in the stiffness; of a structure are subsequently removed from the structure. The final design of a structure may have its weight significantly reduced while the displacements at prescribed locations are kept within the given limits. The proposed method is capable of performing simultaneous shape and topology optimization. A wide range of problems including those with multiple displacement constraints, multiple load cases and moving loads are considered. It is shown that existing solutions of structural optimization with stiffness constraints can easily be reproduced by this proposed simple method. In addition some original shape and layout optimization results are presented.