NA序列下经验分布函数的渐近正态性及其应用

本文在NA负相协序列下利用熟知的相依情形的大小块分割的方法,建立了经验分布函数的渐近正态性．作为在可靠性中的应用,得到了生存函数■(x)=P(X＞x)估计的渐近正态性．     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

OPTIMAL HARVESTING POLICY FOR INSHORE-OFFSHORE FISHERY MODEL WITH IMPULSIVE DIFFUSION

This article studies the inshore-offshore fishery model with impulsive diffusion. The existence and global asymptotic stability of both the trivial periodic solution and the positive periodic solution are obtained. The complexity of this system is also analyzed. Moreover, the optimal harvesting policy are given for the inshore subpopulation, which includes the maximum sustainable yield and the corresponding harvesting effort.     

一类二元相关威布尔分布的可靠性问题

本文考虑生存函数为${\ol{F}(x_{1},x_{2})}=\exp\{-[(x_{1}^{1/\alpha}/\theta_{1})^{1/\delta}+(x_{2}^{1/\alpha}/\theta_{2})^{1/\delta}]^{\delta}\},\;x_{i}>0,\;\alpha>0$, $1\geq\delta>0,\;\theta_{i}>0\;(i=1,2)$的二元威布尔分布的两种可靠性问题, 提出可靠度$\pr$的估计并讨论了它们的渐近性, 最后还作了模拟计算.     

A graphical approach to computing Selmer groups of congruent number curves

Let E _n:y ²=x ³−n ² x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups associated with E _n to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E _n. 2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90     

Algebra with Quadratic Commutation Relations for an Axially Perturbed Coulomb–Dirac Field

The motion of a particle in the field of an electromagnetic monopole (in the Coulomb–Dirac field) perturbed by an axially symmetric potential after quantum averaging is described by an integrable system. Its Hamiltonian can be written in terms of the generators of an algebra with quadratic commutation relations. We construct the irreducible representations of this algebra in terms of second-order differential operators; we also construct its hypergeometric coherent states. We use these states in the first-order approximation with respect to the perturbing field to obtain the integral representation of the eigenfunctions of the original problem in terms of solutions of the model Heun-type second-order ordinary differential equation and present the asymptotic approximation of the corresponding eigenvalues.     

Optimally Stable Multivariate Bases

We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.     

Multi-point Taylor expansions of analytic functions

Taylor expansions of analytic functions are considered with respect to several points, allowing confluence of any of them. Cauchy-type formulas are given for coefficients and remainders in the expansions, and the regions of convergence are indicated. It is explained how these expansions can be used in deriving uniform asymptotic expansions of integrals. The method is also used for obtaining Laurent expansions in several points as well as Taylor-Laurent expansions.

     

Stark's conjecture over complex cubic number fields

Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.