Banach spaces of distributions having two module structures

After a discussion of a space of test functions and the corresponding space of distributions, a family of Banach spaces (B, ∥ ∥_B) in standard situation is described. These are spaces of distributions having a pointwise module structure and also a module structure with respect to convolution. The main results concern relations between the different spaces associated to B established by means of well-known methods from the theory of Banach modules, among them B₀ and $\text{B}\text{?}$, the closure of the test functions in B and the weak relative completion of B, respectively. The latter is shown to be always a dual Banach space. The main diagram, given in Theorem 4.7, gives full information concerning inclusions between these spaces, showing also a complete symmetry. A great number of corresponding formulas is established. How they can be applied is indicated by selected examples, in particular by certain Segal algebras and the A_p-algebras of Herz. Various further applications are to be given elsewhere.     

Jetmetriken und hyperbolische Geometrie

Ohne ZusammenfassungHerrn E. Heinz zum 65. Geburtstag gewidmet     

Isotrope Unterräume rationaler quadratischer Formen

Ohne ZusammenfassungDiese Arbeit wurde während eines Aufenthaltes von Schmidt in der Bundesrepublik Deutschland als Preisträger der Alexander von Humboldt-Stiftung geschrieben.     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

On Lattices of Uniformities

We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.     

Bias of the structural quasi-score estimator of a measurement error model under misspecification of the regressor distribution

In a structural measurement error model the structural quasi-score (SQS) estimator is based on the distribution of the latent regressor variable. If this distribution is misspecified, the SQS estimator is (asymptotically) biased. Two types of misspecification are considered. Both assume that the statistician erroneously adopts a normal distribution as his model for the regressor distribution. In the first type of misspecification, the true model consists of a mixture of normal distributions which cluster around a single normal distribution, in the second type, the true distribution is a normal distribution admixed with a second normal distribution of low weight. In both cases of misspecification, the bias, of course, tends to zero when the size of misspecification tends to zero. However, in the first case the bias goes to zero in a flat way so that small deviations from the true model lead to a negligible bias, whereas in the second case the bias is noticeable even for small deviations from the true model.     

Characteristics of Nd：GdVO4 Laser with Different Nd-Doping Concentrations

We report the properties of a compact diode-pumped continuous-wave Nd：GdV04 laser with a linear cavity and different Nd-doped laser crystals. In a 0.2at.% Nd-doped Nd：GdVO4 laser, 1.54 W output laser power is achieved at 912nm wavelength with a slope efficiency of 24.8% at an absorbed pump power of 9.4W. With 0.3at.% Nd-doping concentration, we can obtain the either single-wavelength emission at 1064nm or 912nm or the dual-wavelength emission at 1064nm and 912nm by controlling the incident pump power. From an incident pump power of 11.6 W, the 1064nm emission between ^4Fa/2 and ^4I11/2 is suppressed completely by the 912nm emission between ^4Fa/2 and ^4I9/2. We obtain 670 mW output of the 912nm single-wavelength laser emission with a slope efficiency of 5.5% by taking an incident pump power of 18.4 W. Using a Nd：GdV04 laser with 0.4at.% Nd-doping concentration, we obtain either the single-wavelength emission at 1064nm or the dual-wavelength emission at both 1064nm and 912nm by increasing the incident pump power. We observe a strong competition process in the dualavelength laser.