独立与NA列部分和的精致渐近性

令{X,Xi:i≥1)为属于非退化稳定分布一般吸引场的独立同分布随机变量列,Sn=∑i=1nXi.本文对十分广泛的拟权函数和边界函数得到了Sn的精致渐近的结果和正态吸引场强平稳NA列部分和的精致渐近的结果,改进并推广了Wang等的结果,从而使此前关于独立列和NA列部分和精致渐近性方面的许多经典的和最新的结果都可以包括在本文的框架之内.     

Comparison principles for viscosity solutions of elliptic equations via fuzzy sum rule

A comparison principle for viscosity sub- and super-solutions of second order elliptic partial differential equations is derived using the “fuzzy sum rule” of non-smooth calculus. This method allows us to weaken the assumptions made on the function F when the equation F(x,u,Du,D²u)=0 is under consideration.     

On Polynomials of Special Form over a Finite Field of Odd Characteristic Attaining the Weil Bound

An explicit construction of polynomials over a finite field of odd characteristic, for which the absolute value of trigonometric sums attains the Weil bound, is based on the construction of cyclic matrices of given rank. Dickson polynomials of the second kind play an essential role in the study of such matrices.__________Translated from Matematicheskie Zametki, vol. 78, no. 1, 2005, pp. 16–25.Original Russian Text Copyright © 2005 by L. A. Bassalygo, V. A. Zinov’ev.     

单A直和子空间

引入单直和子空间的概念,证明了线性空间可唯一分解为单直和子空间的直和,并且给出了计算方法.     

Laguerre expansion on the Heisenberg group and Fourier-Bessel transform on ?n

Given a principal value convolution on the Heisenberg group H _n = ℂ ⁿ × ℝ, we study the relation between its Laguerre expansion and the Fourier-Bessel expansion of its limit on ℂ ⁿ . We also calculate the Dirichlet kernel for the Laguerre expansion on the group H _n . Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

图的邻点全和可区别全染色

设f:V(G)∪E(G)→{1,2,…,k}是图G的一个正常k-全染色。令■其中N(x)={y∈V(G)|xy∈E(G)}。对任意的边uv∈E(C),若有Φ(u)≠Φ(v)成立,则称f是图G的一个邻点全和可区别k-全染色。图G的邻点全和可区别全染色中最小的颜色数k叫做G的邻点全和可区别全色数,记为f tndi∑(G)。本文确定了路、圈、星、轮、完全二部图、完全图以及树的邻点全和可区别全色数,同时猜想:简单图G(≠K2)的邻点全和可区别全色数不超过△(G)+2。     

MOLSIM: A modular molecular simulation software

The modular software MOLSIM for all‐atom molecular and coarse‐grained simulations is presented with focus on the underlying concepts used. The software possesses four unique features: (1) it is an integrated software for molecular dynamic, Monte Carlo, and Brownian dynamics simulations; (2) simulated objects are constructed in a hierarchical fashion representing atoms, rigid molecules and colloids, flexible chains, hierarchical polymers, and cross‐linked networks; (3) long‐range interactions involving charges, dipoles and/or anisotropic dipole polarizabilities are handled either with the standard Ewald sum, the smooth particle mesh Ewald sum, or the reaction‐field technique; (4) statistical uncertainties are provided for all calculated observables. In addition, MOLSIM supports various statistical ensembles, and several types of simulation cells and boundary conditions are available. Intermolecular interactions comprise tabulated pairwise potentials for speed and uniformity and many‐body interactions involve anisotropic polarizabilities. Intramolecular interactions include bond, angle, and crosslink potentials. A very large set of analyses of static and dynamic properties is provided. The capability of MOLSIM can be extended by user‐providing routines controlling, for example, start conditions, intermolecular potentials, and analyses. An extensive set of case studies in the field of soft matter is presented covering colloids, polymers, and crosslinked networks. © 2015 The Authors. Journal of Computational Chemistry Published by Wiley Periodicals, Inc.     

三项指数和四次均值的精确计算公式(2)

本文进一步深入研究了三项指数和四次均值的计算问题.运用指数和的相关性质并结合求解同余方程组的方法与技巧,利用两种不同的方法获得了两个精确的均值计算公式,揭示了三项指数和的计算与同余方程组解的个数之间的本质联系,推广了已有的结果.     

大族长度为pq的伪随机k元序列

Mauduit与Sárkzy在一系列论文中研究了κ元序列的伪随机性.本文通过对模pq剩余类环Z_(pq)进行分割,进而结合离散对数的方法,构造了一大族长度为pq的伪随机κ元序列,并证明其具有很好的伪随机性.     

Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Consider a simple graph and its proper edge coloring c with the elements of the set . We say that c is neighbor set distinguishing (or adjacent strong) if for every edge , the set of colors incident with u is distinct from the set of colors incident with v. Let us then consider a stronger requirement and suppose we wish to distinguishing adjacent vertices by sums of their incident colors. In both problems the challenging conjectures presume that such colorings exist for any graph G containing no isolated edges if only . We prove that in both problems is sufficient. The proof is based on the Combinatorial Nullstellensatz, applied in the “sum environment.” In fact the identical bound also holds if we use any set of k real numbers instead of as edge colors, and the same is true in list versions of the both concepts. In particular, we therefore obtain that lists of length ( in fact) are sufficient for planar graphs.