Kähler–Einstein submanifolds of the infinite dimensional projective space

This paper consists of two main results. In the first one we describe all Kähler immersions of a bounded symmetric domain into the infinite dimensional complex projective space in terms of the Wallach set of the domain. In the second one we exhibit an example of complete and non-homogeneous Kähler–Einstein metric with negative scalar curvature which admits a Kähler immersion into the infinite dimensional complex projective space.     

Stability of Parametric Quasivariational Inequality of the Minty Type

In this paper, stability of a parametric quasivariational inequality of the Minty type is studied via various sufficient conditions characterizing upper and lower semicontinuity of the solution sets as well as the approximate solution sets. Sufficient conditions ensuring upper semicontinuity of the approximate solution sets of an optimization problem with quasivariational inequality constraints are also presented.     

A multigrid preconditioner for an adaptive Black-Scholes solver

This paper is concerned with the efficient solution of the linear systems of equations that arise from an adaptive space-implicit time discretisation of the Black-Scholes equation. These nonsymmetric systems are very large and sparse, so an iterative method will usually be the method of choice. However, such a method may require a large number of iterations to converge, particularly when the timestep used is large (which is often the case towards the end of a simulation which uses adaptive timestepping). An appropriate preconditioner is therefore desirable. In this paper we show that a very simple multigrid algorithm with standard components works well as a preconditioner for these problems. We analyse the eigenvalue spectrum of the multigrid iteration matrix for uniform grid problems and illustrate the method’s efficiency in practice by considering the results of numerical experiments on both uniform grids and those which use adaptivity in space.     

Homomorphisms of infinitely generated analytic sheaves

We prove that every homomorphism \(\mathcal{O}^{E}_{\zeta}\rightarrow\mathcal{O}^{F}_{\zeta}\), with E and F Banach spaces and ζ∈? ^m , is induced by a \(\mathop{\mathrm{Hom}}(E,F)\)-valued holomorphic germ, provided that 1≤m<∞. A similar structure theorem is obtained for the homomorphisms of type \(\mathcal{O}^{E}_{\zeta}\rightarrow\mathcal{S}_{\zeta}\), where \(\mathcal{S}_{\zeta}\) is a stalk of a coherent sheaf of positive depth. We later extend these results to sheaf homomorphisms, obtaining a condition on coherent sheaves which guarantees the sheaf to be equipped with a unique analytic structure in the sense of Lempert–Patyi.     

Linear maps that strongly preserve regular matrices over the Boolean algebra

The set of all m × n Boolean matrices is denoted by $ \mathbb{M} $ \mathbb{M} _m,n . We call a matrix A ∈ $ \mathbb{M} $ \mathbb{M} _m,n regular if there is a matrix G ∈ $ \mathbb{M} $ \mathbb{M} _n,m such that AGA = A. In this paper, we study the problem of characterizing linear operators on $ \mathbb{M} $ \mathbb{M} _m,n that strongly preserve regular matrices. Consequently, we obtain that if min{m, n} ⩽ 2, then all operators on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserve regular matrices, and if min{m, n} ⩾ 3, then an operator T on $ \mathbb{M} $ \mathbb{M} _m,n strongly preserves regular matrices if and only if there are invertible matrices U and V such that T(X) = UXV for all X ε $ \mathbb{M} $ \mathbb{M} _m,n , or m = n and T(X) = UX ^T V for all X ∈ $ \mathbb{M} $ \mathbb{M} _n .     

An algorithm to compute <Emphasis Type="Italic">ω</Emphasis>-primality in a numerical monoid

Let M be a commutative, cancellative, atomic monoid and x a nonunit in M. We define ω(x)=n if n is the smallest positive integer with the property that whenever x∣a ₁???a _t , where each a _i is an atom, there is a T?{1,2,…,t} with |T|≤n such that x∣∏_k∈T a _k . The ω-function measures how far x is from being prime in M. In this paper, we give an algorithm for computing ω(x) in any numerical monoid. Simple formulas for ω(x) are given for numerical monoids of the form 〈n,n+1,…,2n?1〉, where n≥3, and 〈n,n+1,…,2n?2〉, where n≥4. The paper then focuses on the special case of 2-generator numerical monoids. We give a formula for computing ω(x) in this case and also necessary and sufficient conditions for determining when x is an atom. Finally, we analyze the asymptotic behavior of ω(x) by computing \(\lim_{x\rightarrow \infty}\frac{\omega(x)}{x}\).     

Pathwise Estimation of Stochastic Differential Equations with Unbounded Delay and Its Application to Stochastic Pantograph Equations

The existence and uniqueness of the global solution of stochastic differential equations with discrete variable delay is investigated in this paper, and the pathwise estimation is also done by using Lyapunov function method and exponential martingale inequality. The results can be used not only in the case of bounded delay but also in the case of unbounded delay. As the applications, this paper considers the pathwise estimation of solutions of stochastic pantograph equations.     

A new method of moving asymptotes for large-scale linearly equality-constrained minimization

A new method of moving asymptotes for large-scale minimization subject to linear equality constraints is discussed.In this method,linear equality constraints are deleted with null space technique and the descending direction is obtained by solving a convex separable subproblem of moving asymptotes in each iteration. New rules for controlling the asymptotes parameters are designed and the global convergence of the method under some reasonable conditions is established and proved.The numerical results show that the new method may be capable of processing some large scale problems.     

Fluid approximation and its convergence Rate for GI/G/1 queue with vacations

A GI/G/1 queue with vacations is considered in this paper.We develop an approximating technique on max function of independent and identically distributed(i.i.d.) random variables,that is max{ηi,1 ≤ i ≤ n}.The approximating technique is used to obtain the fluid approximation for the queue length,workload and busy time processes.Furthermore,under uniform topology,if the scaled arrival process and the scaled service process converge to the corresponding fluid processes with an exponential rate,we prove by the...     

Positive-Part Moments via the Fourier–Laplace Transform

Integral expressions for positive-part moments E X₊^pmathsf{E},X_{+}^{p} (p>0) of random variables X are presented, in terms of the Fourier–Laplace or Fourier transforms of the distribution of X. A necessary and sufficient condition for the validity of such an expression is given. This study was motivated by extremal problems in probability and statistics, where one needs to evaluate such positive-part moments.