The Herglotz Representation Theorems and the Easy Direction of Loewner’s Theorem

Author(s):  
Barry Simon
1982 ◽  
Vol 5 (1) ◽  
pp. 1-14
Author(s):  
Bernd Reusch ◽  
Gerd Szwillus

We study a term-language, which is used by the “Warsaw-School” in an abstract model for information systems. Various normal forms as well as standard expansions with respect to product terms are formulated and proved correct. It is shown that the shortest sums of so-called maximal sub-products are the shortest representations of terms and algorithms for their generation are given.


2011 ◽  
Vol 48 (03) ◽  
pp. 856-867 ◽  
Author(s):  
Jorge Navarro ◽  
Francisco J. Samaniego ◽  
N. Balakrishnan

Signature-based representations of the reliability functions of coherent systems with independent and identically distributed component lifetimes have proven very useful in studying the ageing characteristics of such systems and in comparing the performance of different systems under varied criteria. In this paper we consider extensions of these results to systems with heterogeneous components. New representation theorems are established for both the case of components with independent lifetimes and the case of component lifetimes under specific forms of dependence. These representations may be used to compare the performance of systems with homogeneous and heterogeneous components.


1967 ◽  
Vol 7 (1) ◽  
pp. 1-6 ◽  
Author(s):  
Alessandro Figà-Talamanca ◽  
G. I. Gaudry

Let G be a locally compact Abelian Hausdorff group (abbreviated LCA group); let X be its character group and dx, dx be the elements of the normalised Haar measures on G and X respectively. If 1 < p, q < ∞, and Lp(G) and Lq(G) are the usual Lebesgue spaces, of index p and q respectively, with respect to dx, a multiplier of type (p, q) is defined as a bounded linear operator T from Lp(G) to Lq(G) which commutes with translations, i.e. τxT = Tτx for all x ∈ G, where τxf(y) = f(x+y). The space of multipliers of type (p, q) will be denoted by Lqp. Already, much attention has been devoted to this important class of operators (see, for example, [3], [4], [7]).


1989 ◽  
Vol 105 (3) ◽  
pp. 523-536 ◽  
Author(s):  
G. Buskes ◽  
A. van Rooij

Many facts in the theory of general Riesz spaces are easily verified by thinking in terms of spaces of functions. A proof via this insight is said to use representation theory. In recent years a growing number of authors has successfully been trying to bypass representation theorems, judging them to be extraneous. (See, for instance, [9,10].) In spite of the positive aspects of these efforts the following can be said. Firstly, avoiding representation theory does not always make the facts transparent. Reading the more cumbersome constructions and procedures inside the Riesz space itself one feels the need for a pictorial representation with functions, and one suspects the author himself of secret heretical thoughts. Secondly, the direct method leads to repeating constructions of the same nature over and over again.


1971 ◽  
pp. 231-277
Author(s):  
Paul L. Butzer ◽  
Rolf J. Nessel

Sign in / Sign up

Export Citation Format

Share Document