Synthesis and Reactivity of the First Isolated Hydrogen‐Bridged Silanol–Silanolate Anions

We report on the first examples of isolated silanol–silanolate anions, obtained by utilizing weakly coordinating phosphazenium counterions. The silanolate anions were synthesized from the recently published phosphazenium hydroxide hydrate salt with siloxanes. The silanol–silanolate anions are postulated intermediates in the hydroxide‐mediated polymerization of aryl and alkyl siloxanes. The silanolate anions are strong nucleophiles because of the weakly coordinating character of the phosphazenium cation, which is perceptible in their activity in polysiloxane depolymerization.     

NA列加权乘积和的完全收敛性

本文讨论了NA和几类加权部分和及加权乘积和的完全收敛性，其中部分结果要优于iid列的已知结论。     

关于NA情况下重对数律收敛速度的一般形式

研究了NA序列重对数律收敛速度的一般形式，把Davis和Gut的结果推广到了NA的情形，并使梁汉营等人关于对数律一个结果成为特例；作为推论，得到了关于NA序列重对数律收敛速度的充分条件．     

左消半群M与幂单半群B的Schǔzenberger积

本文讨论了每个元都有幂等元作为右单位元的左消半群与幂单半群N的Schuzenberger积M◇N的ρ类，证明了这种半群M与N的Schuzenberger积M◇N的ρ类是右E一半适合半群和弱E-headged半群．     

On the counting function of the lattice profile of periodic sequences

The lattice profile analyzes the intrinsic structure of pseudorandom number sequences with applications in Monte Carlo methods and cryptology. In this paper, using the discrete Fourier transform for periodic sequences and the relation between the lattice profile and the linear complexity, we give general formulas for the expected value, variance, and counting function of the lattice profile of periodic sequences with fixed period. Moreover, we determine in a more explicit form the expected value, variance, and counting function of the lattice profile of periodic sequences for special values of the period.     

Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration

Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C² function [respectively, a lower C¹ function].     

Two Convergence Problems for Monotone Sequences

Eight measures of rate of convergence of monotone sequences of real numbers have been proposed and discussed in a paper by Beyer, Ebanks, and Qualls (Acta Appl. Math. 20 (1990), 267–284). These rates arose in discussions of dynamical systems. In the comparisons of these rates, two problems remained. A complete answer is given to one of the problems and a partial answer is given to the other problem.     

The universal nilpotent group compactification of a semigroup

The purpose of this paper is to introduce an algebra of functions on a semitopological semigroup and to study these functions from the point of view of universal semigroup compactification. We show that the corresponding semigroup compactification of this algebra is universal with respect to the property of being a nilpotent group.

     

Searching for extensible Korobov rules

Extensible lattice sequences have been proposed and studied in [F.J. Hickernell, H.S. Hong, Computing multivariate normal probabilities using rank-1 lattice sequences, in: G.H. Golub, S.H. Lui, F.T. Luk, R.J. Plemmons (Eds.), Proceedings of the Workshop on Scientific Computing (Hong Kong), Singapore, Springer, Berlin, 1997, pp. 209–215; F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138; F.J. Hickernell, H.Niederreiter, The existence of good extensible rank-1 lattices, J. Complexity 19 (2003) 286–300]. For the special case of extensible Korobov sequences, parameters can be found in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C.Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138]. The searches made to obtain these parameters were based on quality measures that look at several projections of the lattice. Because it is often the case in practice that low-dimensional projections are very important, it is of interest to find parameters for these sequences based on measures that look more closely at these projections. In this paper, we prove the existence of “good” extensible Korobov rules with respect to a quality measure that considers two-dimensional projections. We also report results of experiments made on different problems where the newly obtained parameters compare favorably with those given in [F.J. Hickernell, H.S. Hong, P. L’Ecuyer, C. Lemieux, Extensible lattice sequences for quasi-Monte Carlo quadrature, SIAM J. Sci. Comput. 22 (2001) 1117–1138].