研究K4-同胚图K4(α,1,1,δ,ε,η)色性的一个引理

主要介绍了一个引理，这个引理奠定了K4－同胚图K4（α，1，1，δ，ε，η）色性研究的基础。     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.

     

Polynomial Reproduction in Subdivision

We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in terms of a recurrence formula for the vectors which determine the structure of polynomial input with this property. From this recurrence, we obtain an algorithm to determine polynomial input of maximal degree. The algorithm can be used in the design of masks to achieve a high order of polynomial reproduction.     

Bounds for the Least Laplacian Eigenvalue of a Signed Graph

A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated.     

一类新的插值结点

有界单连通区域Ｇ，其边界θＧ＝Г∈（１，α），α〉０。本计算节以广义Ｆａｂｅｒ多项式φｎ（ｚ）的零点为插值结点的Ｌａｇｒａｎｇｅ插值多项式的逼近性质，得到了它对Ａ（Ｇ↑－）中的函数的一致逼近阶和平均逼近阶的估计，并且得到了它对Ｅ＾ｐ（Ｇ）中函数的平均逼近阶的估计，还指出关于平均逼近阶的估计是不可改进的。     

Harmonic Calculus on Fractals - A Measure Geometric Approach I

Differentiation of functions w.r.t. finite atomless measures with compact support on the real line is introduced. The related harmonic calculus is similar to that of the classical Lebesgue case. As an application we obtain the Weyl exponent for the spectral asymptotics of the Laplacians w.r.t. linear Cantor-type measures with arbitrary weights.     

Hyers–Ulam–Rassias stability of Cauchy equation in the space of Schwartz distributions

We reformulate and prove the Hyers–Ulam–Rassias stability of Cauchy equation in the space of Schwartz tempered distributions and Fourier hyperfunctions.