On the limiting behavior of the maximum partial sums for arrays of rowwise NA random variables

Let {Xni, 1 ≤ n,i ＜∞} be an array of rowwise NA random variables and {an, n ≥ 1} a sequence of constants with 0 ＜ an ↑∞. The limiting behavior of maximum partial sums 1/an max 1≤k≤n| kΣi=1 Xni| is investigated and some new results are obtained. The results extend and improve the corresponding theorems of rowwise independent random variable arrays by Hu and Taylor [1] and Hu and Chang [2].     

COMPLETENESS OF THE PARABOLIC SUBGROUPS OF PROJECTIVE ORTHOGONAL GROUPS

All parabolic subgroups and Borel subgroups of PΩ(2m 1, F) over a linear-able field F of characteristic 0 are shown to be complete groups, provided m > 3.     

Distributive lattices of numberings

We study into a semilattice of numberings generated by a given fixed numbering via operations of completion and taking least upper bounds. It is proved that, except for the trivial cases, this semilattice is an infinite distributive lattice every principal ideal in which is finite. The least upper and the greatest lower bounds in the semilattice are invariant under extensions in the semilattice of all numberings. Isomorphism types for the semilattices in question are in one-to-one correspondence with pairs of cardinals the first component of which is equal to the cardinality of a set of non-special elements, and the second — to the cardinality of a set of special elements, of the initial numbering. Supported by INTAS grant No. 00-429. __________ Translated from Algebra i Logika, Vol. 46, No. 1, pp. 83–102, January–February, 2007.     

Complete and phase synchronization in a heterogeneous small-world neuronal network

Synchronous firing of neurons is thought to be important for information communication in neuronal networks. This paper investigates the complete and phase synchronization in a heterogeneous small-world chaotic Hindmarsh--Rose neuronal network. The effects of various network parameters on synchronization behaviour are discussed with some biological explanations. Complete synchronization of small-world neuronal networks is studied theoretically by the master stability function method. It is shown that the coupling strength necessary for complete or phase synchronization decreases with the neuron number, the node degree and the connection density are increased. The effect of heterogeneity of neuronal networks is also considered and it is found that the network heterogeneity has an adverse effect on synchrony.     

关于完全三部图K(m,n,r)的色唯一性

本文研究完全三部图K(m,n,r)的色唯一性问题，通过比较两个色等价图的色划分数的方法，得出两个关于K(m,n,r)为色唯一图的一般形式数值条件，基本上解决了K(m,n,r)为色唯一图的判定问题．     

几类凝聚图的轮廓

设Ｇ是个图，｜Ｖ（Ｇ）＝ｎ｜对Ｇ上的任一个标号ｆ：Ｖ（Ｇ）→｛１，…，ｎ｝记，且当ｊ≠ｉ时，Ｇ中有边以ｆ（－１）（ｊ）及ｆ（－１）（ｉ）为两端点｝）．称Ｐ（Ｇ）＝ｍｉｎ｛Ｐ（ｆ）：ｆ是Ｇ上的标号｝为图Ｇ的轮廓．对以Ｗ表示Ｇ中Ｗ的边界．本文证明：ｉ）若Ｇ是凝聚图，ｆ及ｆ是Ｇ上一对互逆标号，则Ｐ（Ｇ）＝Ｐ（ｆ）的充要条件是ｆ为凝聚标号，且此时若Ｇ，Ｈ均是凝聚图，则存在阶梯标号。使得路、回、完全留之间的下列乘积图也是凝聚图，且其轮廓为     

Kp,q-factorization of complete bipartite graphs

Let K_(m,n) be a complete bipartite graph with two partite sets having m and nvertices, respectively. A K_(p,q)-factorization of K_(m,n) is a set of edge-disjoint K_(p,q)-factorsof K_(m,n) which partition the set of edges of K_(m,n). When p=i and q is a prime number,Wang, in his paper "On K_(1,k)-factorizations of a complete bipartite graph" (Discrete Math,1994, 126; 359-364), investigated the K_(1,q)-factorization of K_(m,n) and gave a sufficientcondition for such a factorization to exist. In the paper "K_(1,k)-factorizations of completebipartite graphs" (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang'sresult to the case that q is any positive integer In this paper, we give a sufficient conditionfor K_(m,n) to have a K_(p,q)-factorization. As a special case, it is shown that the Martin's BACconjecture is true when p: q=k: (k+1) for any positive integer k.     

素理想(p)在Q(μ~1~(l/m))中的分解

设Q为有理数域,令φ为由奇素数p生成的有理数域Q的p-adic赋值,R为与其相对应的赋值环,(p)为R的极大理想(素理想).本文用扩张平移的方法讨论了lm)(μ∈R)中的分解问题,并完全解决了该问题.素理想(p)在Q的lm次根扩张Q(μ1     

基于利率市场化的银行贷款竞争导向定价策略研究

本文着重对两个银行之间竞争导向定价策略博弈行为进行了分析，认为在利率管制条件下，银行难以运用利率杠杆在信贷市场进行有效竞争；利率市场化之后，监管者不再对利率进行约束，银行信贷竞争的广度和深度都会随之加大。因此价格竞争将是银行信贷市场竞争的常态。     

Kp,q-factorization of complete bipartite graphs

Let K _m,nbe a complete bipartite graph with two partite sets having m and n vertices, respectively. A K _p,q-factorization of K _m,n is a set of edge-disjoint K _p,q-factors of K _m,n which partition the set of edges of K _m,n. When p = 1 and q is a prime number, Wang, in his paper “On K _1,k -factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359—364), investigated the K _1,q -factorization of K _m,nand gave a sufficient condition for such a factorization to exist. In the paper “K _1,k -factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301—306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for K _m,n to have a K _p,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p : q = k : (k+ 1) for any positive integer k.