Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

随机变量序列的大数定律及常返性定理

对一类有界独立或相依的随机变量序列|ξn|,获得了它的伯努利大数定律、波雷尔强大数定律及常返性定理.作为应用,得出了Loève专著[1]中的推广的伯努利大数定律、常返性定理,改进了[1]中的推广的波雷尔强大数定律.     

Ergodic theory and the Strong Law of Large Numbers on Riesz spaces

In [W.-C. Kuo, C.C.A. Labuschagne, B.A. Watson, Discrete-time stochastic processes on Riesz spaces, Indag. Math. (N.S.) 15 (3) (2004) 435-451], we introduced the concepts of conditional expectations, martingales and stopping times on Riesz spaces. Here we formulate and prove order theoretic analogues of the Birkhoff, Hopf and Wiener ergodic theorems and the Strong Law of Large Numbers on Riesz spaces (vector lattices).     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

用三个关系式与Mathematica软件求第二类自然数幂和公式

首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法.     

Preparation and electrical characterization of (PVC + KBrO3) polymer electrolytes for solid state battery applications

This paper presents results of studies on dc electrical conductivity and transference number measurements on potassium bromate (KBrO₃) complexed polyvinyl chloride (PVC) films prepared by solution cast technique. Temperature dependence of dc electrical conductivity and transference number data indicated the dominance of ion type charge transport in these specimens. The magnitude of conductivity increased with increase in concentration of the salt and temperature. Using this (PVC + KBrO₃) electrolyte, solid-state electrochemical cells were fabricated, and their discharge profiles were studied under a constant load of 100 kΩ. Several cell profiles such as open circuit voltage, short circuit current, power density, and energy density associated with these cells were evaluated and were reported. The features of complexation of the electrolytes were studied by X-ray diffraction and Fourier transform infrared spectroscopy. Paper presented at the Third International Conference on Ionic Devices (ICID 2006), Chennai, Tamilnadu, India, Dec. 7–9, 2006     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

可交换随机变量序列的随机极限定理

本文讨论了可交换随机变量序列{X_n:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果.     

高阶Bernoulli多项式和高阶Euler多项式的关系

利用发生函数的方法，讨论了高阶Bernoulli数和高阶Euler数，高阶Bernoulli多项式和高阶Euler多项式之间的关系，得到了经典Bernoulli数和Euler数，经典Bernoulli多项式和Euler多项式之间的新型关系。     

On the multidimensional distribution of the subset sum generator of pseudorandom numbers

We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.