Uniqueness of Solution to Systems of Elliptic Operators and Application to Asymptotic Synchronization of Linear Dissipative Systems II: Case of Multiple Feedback Dampings

In this paper, the authors consider the asymptotic synchronization of a linear dissipative system with multiple feedback dampings. They ?rst show that under the observability of a scalar equation, Kalman’s rank condition is su?cient for the uniqueness of solution to a complex system of elliptic equations with mixedobservations. The authors then establish a general theory on the asymptotic stability and the asymptotic synchronization for the corresponding evolutional system subjected to mixed dampings of various natures. Some classic models are presented to illustrate the ?eld of applications of the abstract theory.     

非线性玻尔兹曼方程的傅里叶谱方法

玻尔兹曼方程作为空气动理学中最基本的方程之一,是连接微观牛顿力学和宏观连续介质力学的重要桥梁.该方程描述了一个由大量粒子组成的复杂系统的非平衡态时间演化:除了基本的输运项,其最重要的特性是粒子间的相互碰撞由一个高维,非局部且非线性的积分算子来描述,从而给玻尔兹曼方程的数值求解带来非常大的挑战.在过去的二十年间,基于傅里叶级数的谱方法成为了数值求解玻尔兹曼方程的一种很受欢迎且有效的确定性算法.这主要归功于谱方法的高精度及它可以被快速傅里叶变换加速的特质.本文将回顾玻尔兹曼方程的傅里叶谱方法,具体包括方法的导出,稳定性和收敛性分析,快速算法,以及在一大类基于碰撞的空气动理学方程中的推广.     

Euler Characteristics on virtually free products

We define Euler characteristics on classes of residually finite and virtually torsion free groups and we show that they satisfy certain formulas in the case of amalgamated free products and HNN extensions over finite subgroups. These formulas are obtained from a general result which applies to the rank gradient and the first L²?Betti number of a finitely generated group.     

Groups with many subgroups having polycyclic-by-finite layers or derived subgroup

A group is called (PF)L if the subgroups generated by its elements having same order (finite or infinite) are polycyclic-by-finite. In the present paper we prove that a group is locally graded minimal non-((PF)L∪(𝔓𝔉)𝔄) if, and only if, it is non-perfect minimal non-FC, where (𝔓𝔉)𝔄 denotes the class of (polycyclic-by-finite)-by-abelian groups. We prove also that a group of infinite rank whose proper subgroups of infinite rank are in ((PF)L∪(𝔓𝔉)𝔄) is itself in ((PF)L∪(𝔓𝔉)𝔄) provided that it is locally (soluble-by-finite) without simple homomorphic images of infinite rank. Our last result concerns groups that satisfy the minimal condition on non-((PF)L∪(𝔓𝔉)𝔄)-subgroups.     

排名聚合算法在少量长列表聚合中的性能比较分析

排名聚合将多个排名列表聚合成一个综合排名列表,可应用于推荐系统、链路预测、元搜索、提案评选等.当前已有工作从不同角度对不同排名聚合算法进行了综述、比较,但存在算法种类较少、数据统计特性不清晰、评价指标不够合理等局限性.不同排名聚合算法在提出时均声称优于已有算法,但是用于比较的方法不同,测试的数据不同,应用的场景不同,因此何种算法最能适应某一任务在很多情况下仍不甚清楚.本文基于Mallows模型,提出一套生成统计特性可控的不同类型的排名列表的算法,使用一个可应用于不同类型排名列表的通用评价指标,介绍9种排名聚合算法以及它们在聚合少量长列表时的表现.结果发现启发式方法虽然简单,但是在排名列表相似度较高、列表相对简单的情况下,能够接近甚至超过一些优化类方法的结果;列表中平局数量的增长会降低聚合排名的一致性并增加波动;列表数量的增加对聚合效果的影响呈现非单调性.整体而言,基于距离优化的分支定界方法 (FAST)优于其他各类算法,在不同类型的排名列表中表现非常稳定,能够很好地完成少量长列表的排名聚合.     

关于求解随机用户均衡问题的截断拟牛顿型信赖域法研究

信赖域法是一种保证全局收敛性的优化算法,为避免Hessian矩阵的计算,基于拟牛顿校正公式构造了求解带线性等式约束的非线性规划问题的截断拟牛顿型信赖域法.首先给出了截断拟牛顿型信赖域法的构造过程及具体步骤;然后针对随机用户均衡模型中变量和约束的特点对算法进行了修正,并将多种拟牛顿校正公式下所得结果与牛顿型信赖域法的结果进行了比较,结果发现基于对称秩1校正公式的信赖域法更为合适.最后基于数值算例结果得到了一些在算法编程过程中的重要结论,对其它形式信赖域法的编程实现具有一定的参考意义.     

一类核具有连续横截面变换半群的秩

设X_n={1,2,…,n}并赋予自然数序,MCK_n是X_n上核具有连续横截面保序或反序变换所构成的半群.K_n是MCK_n的最大正则子半群.本文将考虑K_n的理想K(n,r)={α∈K_n:|im(α)|≤r}(3≤r≤n-1).证明了K(n,r)的秩为(n-r+1)(n-r+2)(n-r+3)/6.     

Subspace arrangements as generalized star configurations

In this note, we show that any projective subspace arrangement can be realized as a generalized star configuration variety. This type of interpolation result may be useful in designing linear codes with prescribed codewords of minimum weight, as well as in answering a couple of questions about the number of equations needed to define a generalized star configuration variety.     

Diameter of a direct power of a finite group

We present two conjectures concerning the diameter of a direct power of a finite group. The first conjecture states that the diameter of Gⁿ with respect to each generating set is at most n(|G|?rank(G)); and the second one states that there exists a generating set 𝒜, of minimum size, for Gⁿ such that the diameter of Gⁿ with respect to 𝒜 is at most n(|G|?rank(G)). We will establish evidence for each of the above mentioned conjectures.