Sober Approach Spaces are Firmly Reflective for the Class of Epimorphic Embeddings

In [2] the subconstruct of sober approach spaces was introduced and it was shown to be a reflective subconstruct of the category of approach spaces. The main result of this paper states that moreover is firmly -reflective in for the class of epimorphic embeddings. ‘Firm -reflective’ is a notion introduced in [3] by G.C.L. Brümmer and E. Giuli and is inspired by the exemplary behaviour of the usual completion in the category of Hausdorff uniform spaces with uniformly continuous maps. It means that is -reflective in and that the reflector is such that belongs to if and only if is an isomorphism. Firm -reflectiveness implies uniqueness of completion in the sense that whenever is a map with and sober, the associated is an isomorphism. Our result generalizes the fact that in the category the subconstruct of sober topological spaces is firmly reflective for the class of b-dense embeddings in . Also firmness in some other subconstructs of will be easily obtained.A. Gerlo and C. Van Olmen are research assistants at the Fund of Scientific Research Vlaanderen (FWO). E. Vandersmissen is a research assistant supported by the FWO-grant G.0244.05.     

Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

Recently, several authors [8, 10] have argued for the use of extended formulations to tighten production planning models. In this work we present two linear-programming extended formulations of the constant-capacity lot-sizing problem with backlogging. The first one applies to the problem with a general cost function and has O(n³) variables and constraints. This improves on the more straightforward O(n⁴) Florian and Klein [2] type formulation. The second one applies when the costs satisfy the Wagner-Whitin property but it has O(n²) variables and O(n³) constraints. As a by-product, we positively answer an open question of Miller and Wolsey [4] about the tightness of an extended formulation for the continuous mixing set. This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister's Office, Science Policy Programming. The research was carried out with financial support of the Growth Project G1RD-1999-00034 (LISCOS) of the European Community. The scientific responsibility is assumed by the author.     

On the role of arbitrary order Bessel functions in higher dimensional Dirac type equations

This paper exhibits an interesting relationship between arbitrary order Bessel functions and Dirac type equations. Let be the Euclidean Dirac operator in the n-dimensional flat space the radial symmetric Euler operator and α and λ be arbitrary non-zero complex parameters. The goal of this paper is to describe explicitly the structure of the solutions to the PDE system in terms of arbitrary complex order Bessel functions and homogeneous monogenic polynomials. Received: 27 October 2005     

On computing rational Gauss-Chebyshev quadrature formulas

We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside . Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of order . This method is based on the derivation of explicit expressions for Chebyshev orthogonal rational functions, which are (thus far) the only examples of explicitly known orthogonal rational functions on with arbitrary real poles outside this interval.

     

Tangential extremal principles for finite and infinite systems of sets II: applications to semi-infinite and multiobjective optimization

This paper contains selected applications of the new tangential extremal principles and related results developed in Mordukhovich and Phan (Math Program 2011) to calculus rules for infinite intersections of sets and optimality conditions for problems of semi-infinite programming and multiobjective optimization with countable constraints.     

When is the Uvarov transformation positive definite?

Let L\cal{L} be a positive definite bilinear functional, then the Uvarov transformation of L\cal{L} is given by  U(p,q) = L(p,q) + m p(a)[`(q)](a<sup>-1</sup>) +[`(m)] p([`(a)]<sup>-1</sup>)\,\mathcal{U}(p,q) = \mathcal{L}(p,q) + m\,p(\alpha)\overline{q}(\alpha^{-1}) + \overline{m}\,p(\overline{\alpha}^{-1}) [`(q)]([`(a)])\overline{q}(\overline{\alpha}) where $|\alpha| > 1, m \in \mathbb{C}$|\alpha| > 1, m \in \mathbb{C}. In this paper we analyze conditions on m for U\cal{U} to be positive definite in the linear space of polynomials of degree less than or equal to n. In particular, we show that m has to lie inside a circle in the complex plane defined by α, n and the moments associated with L\cal{L}. We also give an upper bound for the radius of this circle that depends only on α and n. This and other conditions on m are visualized for some examples.     

Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices

Three fast and stable divide and conquer algorithms to compute the eigendecomposition of symmetric diagonal-plus-semiseparable matrices are considered. AMS subject classification 15A18, 15A23, 65F15The research of the second and the third author was supported by the Research Council K.U. Leuven, to13.25cmproject OT/00/16 (SLAP: Structured Linear Algebra Package), by the Fund for Scientific Research –