We give a survey on generalized Krein algebras \(K_{p,q}^{\alpha,\beta}\) and their applications to Toeplitz determinants. Our methods originated in a paper by Mark Krein of 1966, where he showed that \(K_{2,2}^{1/2,1/2}\) is a Banach algebra. Subsequently, Widom proved the strong Szeg\H{o} limit theorem for block Toeplitz determinants with symbols in \((K_{2,2}^{1/2,1/2})_{N\times N}\) and later two of the authors studied symbols in the generalized Krein algebras \((K_{p,q}^{\alpha,\beta})_{N\times N}\), where \(\lambda:=1/p+1/q=\alpha+\beta\) and \(\lambda=1\). We here extend these results to \(0<\lambda<1\). The entire paper is based on fundamental work by Mark Krein, ranging from operator ideals through Toeplitz operators up to Wiener-Hopf factorization.

n/a

n/a

n/a

Given graphs G and H, an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H. Let φH(n) be the smallest number φ such that every graph G of order n admits an H-decomposition with at most φ parts. In the paper it is proved that φH(n)=tr−1(n)+o(n2) for every graph H of chromatic number r≥3, where tr(n) is the maximum size of an r-partite graph of order n. Moreover, when H is bipartite, the authors determine φH(n) with a constant additive error.

n/a

The aim of this paper is to develop the calculus of trivializers for subsemigroups. Given a finite presentation defining a semigroup S and a trivializer of the Squier complex of , we obtain an infinite trivializer of the Squier complex of a finite presentation defining a subsemigroup of S. Also, we give a method to find finite trivializers for special subsemigroups and hence to show that those subsemigroups have finite derivation type (FDT). An application of this method is given: we prove that if is a band of monoids having FDT, then so does Sα, for any α ∈Y.

In this work the design of a reverse distribution network is studied. Most of the proposed models on the subject are case based and, for that reason, they lack generality. In this paper we try to overcome this limitation and a generalized model is proposed. It contemplates the design of a generic reverse logistics network where capacity limits, multi-product management and uncertainty on product demands and returns are considered. A mixed integer formulation is developed which is solved using standard B&B techniques. The model is applied to an illustrative case.

Objective: To present an overview on the current state of the art concerning metrics-based
quality evaluation of software components and component assemblies.
Method: Comparison of several approaches available in the literature, using a framework
comprising several aspects, such as scope, intent, definition technique, and maturity.
Results: The identification of common shortcomings of current approaches, such as
ambiguity in definition, lack of adequacy of the specifying formalisms and insufficient
validation of current quality models and metrics for software components.
Conclusions: Quality evaluation of components and component-based infrastructures
presents new challenges to the Experimental Software Engineering community.