Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.     

Semi-empirical likelihood ratio confidence intervals for the difference of two sample means

We all know that we can use the likelihood ratio statistic to test hypotheses and construct confidence intervals in full parametric models. Recently, Owen (1988,Biometrika,75, 237–249; 1990,Ann. Statist.,18, 90–120) has introduced the empirical likelihood method in nonparametric models. In this paper, we combine these two likelihoods together and use the likelihood ratio to construct confidence intervals in a semiparametric problem, in which one model is parametric, and the other is nonparametric. A version of Wilks's theorem is developed.     

Hypersurface with Constant Main Curvature Symmetric Functions

ＨｙｐｅｒｓｕｒｆａｃｅｗｉｔｈＣｏｎｓｔａｎｔＭａｉｎＣｕｒｖａｔｕｒｅＳｙｍｍｅｔｒｉｃＦｕｎｃｔｉｏｎｓ￥ＷｕＢａｏｑｉａｎｇ；ＳｏｎｇＨｏｎｇｚａｏ（ＸｕｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，２２１００９）（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，...     

转移开、闭集值映象和H－KKM定理的推广及应用

本文中，我们引入转移开、闭集值映象的概念，推广了Ｈ－空间中的ＫＫＭ定理￣［４］．然后用所得的结果证明了几个重合定理、匹配定理和向量值极大极小不等式。这些结论推广了近期文献［１，２，４，５，６，７］中的相应结果。     

模糊集单调型分解定理

模糊集的分解集定理有两种形式，第一种形式与模糊集的λ—截集有关：Ａ＝其中Ａ＿λ是的λ—截集￣［１］．第二种形式与集合套有关：其中Ｈ（λ）为集合套￣［２］或者Ａ＝其中Ｈ（λ）为集合套，Ｑ为（０，１）的可列稠密子集＿［３］，．其实，这两种形式在本文提出的基本模糊集的概念下，可以统一起来成为任何模糊集可以分解为一些（可数或不可数）基本模糊集的和。不仅如此，本文还提出简单模糊集的概念，并证明了任何模糊集都可以表示成为可数个单调上升的简单模糊集的和，或等价地，可以表示成可数个单调上升的简单模糊集的极限，所用的证明方法是构造性的，所以对模糊集的结构也得出了一个清晰的认识．     

A PICARD TYPE THEOREM AND BLOCH LAW

Ａ ＰＩＣＡＲＤ ＴＹＰＥ ＴＨＥＯＲＥＭ ＡＮＤ ＢＬＯＣＨ ＬＡＷ ￥ＹＥＹＡＳＨＥＮＧＡｂｓｔｒａｃｔ：Ａｐｉｃａｒｄｔｙｐｅｔｈｅｏｒｅｍｉｓｐｒｏｖｅｄ，ａｎｄａｃｏｕｎｔｅｒｅｘａｍｐｌｅｉｓｇｉｖｅｎｔｏｓｈｏｗｔｈａｔｔｈｅＢｏｌｃｈ...     

Distinguishability and Disturbance in the Quantum Key Distribution Protocol Using the Mean Multi-Kings’ Problem

We introduce a quantum key distribution protocol using mean multi-kings’ problem. Using this protocol, a sender can share a bit sequence as a secret key with receivers. We consider a relation between information gain by an eavesdropper and disturbance contained in legitimate users’ information. In BB84 protocol, such relation is known as the so-called information disturbance theorem. We focus on a setting that the sender and two receivers try to share bit sequences and the eavesdropper tries to extract information by interacting legitimate users’ systems and an ancilla system. We derive trade-off inequalities between distinguishability of quantum states corresponding to the bit sequence for the eavesdropper and error probability of the bit sequence shared with the legitimate users. Our inequalities show that eavesdropper’s extracting information regarding the secret keys inevitably induces disturbing the states and increasing the error probability.     

Central limit theorem for quadratic forms for sparse tables

Sufficient conditions for asymptotic normality for quadratic forms in {n_t − np_t} are given, where {n_t} are the observed counts with expected cell means {np_t}. The main result is used to derive asymptotic distributions of many statistics including the Pearson's chi-square.     

Further generalization of the Dubovicki-Milutin theorem

Combining the results of Walczak (Ref. 1) and Lasiecka (Refs. 2 and 3), we extend the well-known Dubovicki-Milutin theorem in two directions: (i) We allow for treatment of several equality constraints in optimization problems; and (ii) We assume less regularity of optimization problems by requiring the existence of external cones instead of tangent cones. An example of an optimization problem is also considered.     

On Cesari's property (Q)

In the present paper, we generalize, within the family of convex-valued multifunctions, a selection theorem of Cole (Ref. 1). This then leads us to prove some new results concerning Cesari's property (Q) and to the introduction of the Cesari limit of sets, which is then compared to the Kuratowski-Mosco limit.This work was done while the author was a visiting professor at the University of Pavia, Pavia, Italy. Financial support was provided by CNR and by NSF Grant No. 84-03135.