A Relaxation Scheme for Solving the Boltzmann Equation Based on the Chapman-Enskog Expansion

Abstract In [16] a visco-elastic relaxation system, called the relaxed Burnett system, was proposed by Jinand Slemrod as a moment approximation to the Boltzmann equation. The relaxed Burnett system is weaklyparabolic, has a linearly hyperbolic convection part, and is endowed with a generalized eotropy inequality. Itagrees with the solution of the Boltzmann equation up to the Burnett order via the Chapman-Enskog expansion. We develop a one-dimensional non-oscillatory numerical scheme based on the relaxed Burnett system forthe Boltzmann equation. We compare numerical results for stationary shocks based on this relaxation scheme,and those obtained by the DSMC (Direct Simulation Monte Carlo), by the Navier-Stokes equations and bythe extended thermodynamics with thirteen moments (the Grad equations). Our numerical experiments showthat the relaxed Burnett gives more accurate approximations to the shock profiles of the Boltzmann equationobtained by the DSMC, for a range of Mach numbers for hypersonic flows, th     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.     

Supersymmetric invariance and universal central extensions of lie supertriple systems

In this article, we discuss some properties of a supersymmetric invariant bilinear form on Lie supertriple systems. In particular, a supersymmetric invariant bilinear form on Lie supertriple systems can be extended to its standard imbedding Lie superalgebras. Furthermore, we generalize Garland's theory of universal central extensions for Lie supertriple systems following the classical one for Lie superalgebras. We solve the problems of lifting automorphisms and lifting derivations.     

广义导子幂中心化子条件(英文)

设R是素环,U是R的极大右商环,C是R的扩展型心,I是R的非零理想,δ是R上的广义导子,a,b,q∈U.本文给出了恒等式(aδ(qx)-bx)~n=0(∈C在I上成立的充分必要条件,得到的结果推广了Herstein,Lanski,Lee的结论.     

An Improved Result in Almost Sure Central Limit Theory for Products of Partial Sums with Stable Distribution

Consider a sequence of i.i.d. positive random variables with the underlying distribution in the domain of attraction of a stable distribution with an exponent in (1, 2]. A universal result in the almost sure limit theorem for products of partial sums is established. Our results significantly generalize and improve those on the almost sure central limit theory previously obtained by Gonchigdanzan and Rempale and by Gonchigdanzan. In a sense, our results reach the optimal form.     

关于循环阵列码

本文用代数观点来研究循环阵列码,证明了一般的阵列码是一些极小循环阵列码的直和,并且对极小循环阵列码给出了明确的刻画．当有限域的特征不整除群的阶时,给出了直接写出相应的多项式环的本原幂等元的方法,从而可以直接写出所有的极小循环码．     

多目标半定规划的加权中心路径法

对于线性型多目标半定规划问题，引进加权中心路径的概念，并利用单目标半定规划的中心路径法，提出了求解多目标半定规划问题的加权中心路径法，先得型对一个叔向量的有效解，然后在此基础上，提出了通过一次迭代得到对应一定范围内其他任意权向量的有效解的一步修正方法．     

NSD序列加权和的中心极限定理及其在EV回归模型中的应用

基于负超可加相依(简称为NSD)随机序列的性质及其一些不等式,利用随机变量的截断方法建立了NSD随机序列加权和的中心极限定理,从而推广了负相协NA随机序列的相应结论.并将其应用到变系数EV回归模型,得到了未知参数LS估计的渐近正态性.     

一类Block型李代数的分类和中心扩张

本文我们决定了一类Block型李代数$\BB$在同构意义下的分类和中心扩张, 其中$q$是一个非零复数. 我们的结果推广了以前的一些结果.     

初等交换$p$群被内交换$p$群的中心扩张

Assume that N, F and G are groups. If there exsits a normal subgroup of G such that≌ G and G/≌ F, then G is called a central extension of N by F. In this paper, the central extension of N by a minimal non-abelian p-group is determined, where N is an elementary abelian p-group of order p~3. Together with our previous work, all central extensions of N by a minimal non-abelian p-group is determined, where N is an elementary abelian p-group.