NA序列广义Jamison型加权和的几乎处收敛性

本文从随机变量序列广义Jamison型加权和的一个系数指标函数自身性质出发，讨论了广义Jamison型加权和的强稳定性，避免了控制函数的引入，进一步还得到了更一般的NA序列广义Jamison型加权和的几乎处处收敛的条件，并将前人的若干结论包含为特例。     

关于两两PQD列的Jamison型加权乘积和的强稳定性及乘积和的Marcinkiewicz型强大数律

本文讨论了不同分布两两PQD列的Jamison型加权部分和加权乘积和的强稳定性，讨论了它们的部分和与乘积和的Marcinkiewicz型强大数律，改进、推广了Jamison等（1965），Etemadi(1983），Birkel(1989）的相应结果。     

Almost Sure Convergence of the General Jamison Weighted Sum of $$ {\user1{B}} $$-Valued Random Variables

In this paper．two new functions are introduced to depict the Jamison weighted sum of random variables instead using the common methods．their properties and relationships are systematically discussed．We also analysed the implication of the conditions in previous papers．Then we apply these consequences to B-valued random variables．and greatly improve the original results of the strong convergence of the general Janfison weighted sum．Furthermore,our discussions are useful to the corresponding questions of real-valued random variables．     

一类两两NQD列乘积和的Jamison型强稳定性

研究了一类不同分布两两NQD列的Jamison型加权乘积和的强稳定性,推广了不同分布独立列部分和与同分布NQD列部分和情形相类似的结论.     

NA序列线性形式的强稳定性

本文研究了NA变量线性形式的强稳定性.利用随机变量的截尾术及强大数定律,得到了一般情况下不同分布NA变量具有强稳定性的充分条件,推广了NA列的Jamison型加权和具有强稳定性的充分条件.     

关于不同分布两两NQD列的Jamison型加权乘积和的强稳定性

本文讨论了不同分布两两NQD列的Jamison型加权乘积和的强稳定性及乘积和的Marcinkiewicz型强大数律,推广并改进了Etemadi[1]关于不同分布两两独立列部分和的工作及Matula[2],王岳宝等[3]关于同分布两两NQD列部分和的工作.     

两两NQD序列与随机Dirichlet级数

本文研究了一类两两NQD序列加权乘积和的Jamison型强稳定性.利用两两NQD序列的一些极限理论,获得了系数的模为两两NQD列的一类随机Difichlet级数的增长性和值分布的一些新的结果,推广和改进了两两独立序列的相关结论.     

离散随机序列加权和的若干极限定理

设{Xn,n≥0}是任意离散随机变量序列,{ank,0≤k≤n,n≥0)是一常数阵列,我们引入随机序列渐近对数似然比的概念,作为表征随机序列的真实概率测度P与参考测度Q之间的差异的度量,用分析方法,得到了随机序列Jamison型加权和的若干随机偏差定理.     

同分布NA列Jamison型加权和强稳定的充要条件

本文将Ｊａｍｉｓｏｎ等（１９６５）关于ｉｉｄ列加权和强稳定的充分性结果推广到ＮＡ列的场合并且得到了ＮＡ列Ｊａｍｉｓｏｎ型加权和强稳定的必要性结果。     

独立随机序列加权和的强收敛性

本文研究独立随机变量序列加权和的强收敛性,利用截尾法和Borel-Cantelli引理,证明了加权系数ank为列阵情形的强收敛性,在一般双下标加权系数的加权部分和的强收敛性,并对Jamison型加权部分和情形证明了其强收敛的充要条件,推广了Chow与Teicher(1971)[3]的相应结果.     

Realization of abstract convex geometries by point configurations

The Edelman–Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman–Jamison problem is equivalent to the well known NP-hard order type problem. The relation to the realizability of oriented matroids is clarified.     

关于NA列乘积和强收敛性的注记

讨论了NA随机变量序列乘积和的强收敛性,将王定成等(2002)关于NA列的广义Jam ison型加权和的几乎处处收敛性的结论推广到加权乘积和的强收敛性.     

A note on isometries of Lipschitz spaces

The main purpose of this article is to generalize a recent result about isometries of Lipschitz spaces. Botelho, Fleming and Jamison [2] described surjective linear isometries between vector-valued Lipschitz spaces under certain conditions. In this article, we extend the main result of [2] by removing the quasi-sub-reflexivity condition from Banach spaces.     

The Jamison method in galois geometries

In a fundamental paper R.E. Jamison showed, among other things, that any subset of the points of AG(n, q) that intersects all hyperplanes contains at least n(q – 1) + 1 points. Here we show that the method of proof used by Jamison can be applied to several other basic problems in finite geometries of a varied nature. These problems include the celebrated flock theorem and also the characterization of the elements of GF(q) as a set of squares in GF(q ²) with certain properties. This last result, due to A. Blokhuis, settled a well-known conjecture due to J.H. van Lint and the late J. MacWilliams.     

A discrete dynamical system as a model of a neural network with generalized Hebbian synapses

We study the dynamical behavior of a discrete time dynamical system which can serve as a model of a learning process. We determine fixed points of this system and basins of attraction of attracting points. This system was studied by Fernanda Botelho and James J. Jamison in [A learning rule with generalized Hebbian synapses, J. Math. Anal. Appl. 273 (2002) 529-547] but authors used its continuous counterpart to describe basins of attraction.     

Proof of a conjecture of Metsch

In this paper we prove a conjecture of Metsch about the maximum number of lines intersecting a pointset in PG(2,q), presented at the conference “Combinatorics 2002”. As a consequence, we give a short proof of the famous Jamison, Brouwer and Schrijver bound on the size of the smallest affine blocking set in AG(2,q).