An Interactive Multiple Criteria Approach to Ranking Alternatives

In this paper we are concerned with ranking various orderings of a set of alternatives to a composite order as a multiple criteria problem. The orderings (called preference orderings) can be real preference orderings or any natural orderings. The objective is to find the most preferred order of the decision maker using the preference orderings as criteria.In principle, the problem can be formulated as a multiple objective linear programming problem using the model of Bowman and Colantoni and then solved with the interactive method proposed by Zionts and Wallenius. However, the fact that we are dealing with integer variables prohibits us from applying this approach as such. We discuss the problem formulation and propose a modified approach to that of Zionts and Wallenius for solving the problem.     

Carleson measures for weighted holomorphic Besov spaces

We obtain characterizations of positive Borel measures μ on B ⁿ so that some weighted holomorphic Besov spaces B _s ^p (ω,B ⁿ ) are embedded in L ^p (d μ).     

Harmonic maps between annuli on Riemann surfaces

Let ρ _Σ = h(|z|²) be a metric in a Riemann surface Σ, where h is a positive real function. Let H _{r 1} = {w = f(z)} be the family of a univalent ρ _Σ harmonic mapping of the Euclidean annulus A(r ₁, 1):= {z: r ₁ < |z| < 1} onto a proper annulus A _Σ of the Riemann surface Σ, which is subject to some geometric restrictions. It is shown that if A _Σ is fixed, then sup{r ₁: ℋ _{r 1} ≠ ∅} < 1. This generalizes similar results from the Euclidean case. The cases of Riemann and of hyperbolic harmonic mappings are treated in detail. Using the fact that the Gauss map of a surface with constant mean curvature (CMC) is a Riemann harmonic mapping, an application to the CMC surfaces is given (see Corollary 3.2). In addition, some new examples of hyperbolic and Riemann radial harmonic diffeomorphisms are given, which have inspired some new J. C. C. Nitsche-type conjectures for the class of these mappings.     

A polynomial oracle-time algorithm for convex integer minimization

In this paper we consider the solution of certain convex integer minimization problems via greedy augmentation procedures. We show that a greedy augmentation procedure that employs only directions from certain Graver bases needs only polynomially many augmentation steps to solve the given problem. We extend these results to convex N-fold integer minimization problems and to convex 2-stage stochastic integer minimization problems. Finally, we present some applications of convex N-fold integer minimization problems for which our approach provides polynomial time solution algorithms.     

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}\).