Optimality and duality in multiobjective fractional programming involving ρ-semilocally type I-preinvex and related functions

Optimality conditions are obtained for a nonlinear fractional multiobjective programming problem involving η-semidifferentiable functions. Also, a general dual is formulated and a duality result is proved using concepts of generalized ρ-semilocally type I-preinvex functions.     

弱混强平稳序列随机容量、随即秩次序统计量的极限分布律

设W(1n)W2(n)…W(nn)是严平稳随即序列{Xn,n 1}的前几个变量的顺序统计量,Nn Mn是两正整值r.v,n 1.在较弱一些的混合条件下,本文给出了W(NMn)n标准化后的极限分布,从而使一些提法更趋一般化,主要结果推进了Rao(1984)和张国胜(1993)的工作.由于混合条件的减弱,使得对m-相关和正态平稳过程的具体应用讨论更加充分.     

Generalized 3G theorem and application to relativistic stable process on non-smooth open sets

Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes.     

线性递归序列模q

设{u_k}_k≥0为一个线性递归序列．序列{u_k(mod q)}_(k≥0)是周期的,很多人都对其周期有过研究．本文应用二次数域中理想的理论,较完全地刻面了二次线性递归序列模q的周期长度,所获结果加强并推广了Engstrom及Wall的结论．     

Determination of generalized quadrangles with distinct elation points

In this paper, we classify the finite generalized quadrangles of order (s,t), s,t > 1, which have a line L of elation points, with the additional property that there is a line M not meeting L for which {L, M} is regular. This is a first fundamental step towards the classification of those generalized quadrangles having a line of elation points. Mathematics Subject Classification (2000): 51E12, 51E20, 20B25, 20E42     

Continuous spectral decompositions of Abelian group actions on -algebras

Let G be a locally compact Abelian group. Following Ruy Exel, we view Fell bundles over the Pontrjagin dual group of G as continuous spectral decompositions of G-actions on C^*-algebras. We classify such spectral decompositions using certain dense subspaces related to Marc Rieffel's theory of square-integrability. There is a unique continuous spectral decomposition if the group acts properly on the primitive ideal space of the C^*-algebra. But there are also examples of group actions without or with several inequivalent spectral decompositions.     

An improved algorithm for computing topological entropy

A new algorithm is presented for computing the topological entropy of a unimodal map of the interval. The accuracy of the algorithm is discussed and some graphs of the topological entropy which are obtained using the algorithm are displayed.     

The automorphism group of Payne derived generalized quadrangles

We solve a long-standing open problem by proving that the automorphism group of any thick Payne derived generalized quadrangle with ambient quadrangle S a thick generalized quadrangle of order s, s?5 and odd, with a center of symmetry, is induced by the automorphism group of S.     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).