Löwner expansions

A fundamental problem is to estimate the logarithmic coefficients of a power series with constant coefficient zero which represents a function which has distinct values at distinct points of the unit disk. A source of estimates is an expansion theorem for the Löwner equations which is obtained from a study of contractive substitutions in Hilbert spaces of analytic functions. The methods are an outgrowth of the theory of square summable power series [1]. Assume that σ_n is a given function of nonnegative integers n, with nonnegative values, such that σ₀ = 0 and such that σ_{n ? 1} ? σ_n when n is positive. Infinite values are allowed. The underlying Hilbert space is the set $\text{G}$_σ(0) of equivalence classes of power series f(z) = ∑ a_nzⁿ with constant coefficient zero such that f(z)²_{$\text{G}$σ⁽⁰⁾} = ∑(n/σ_n)|a_n|² is finite. Equivalence of power series f(z) and g(z) means that the coefficient of zⁿ in f(z) is equal to the coefficient of zⁿ in g(z) when σ_n is finite.     

Dislocation glide through non-randomly distributed point obstacles

Abstract

Classical meso-scale models for dislocation–obstacle interactions have, by and large, assumed a random distribution of obstacles on the glide plane. While a good approximation in many situations, this does not represent materials where obstacles are clustered on the glide plane. In this work, we have investigated the statistical problem of a dislocation sampling a set of clustered point obstacles in the glide plane using a modified areal-glide model. The results of these simulations show two clear regimes. For weak obstacles, the spatial distribution does not matter and the critically resolved shear stress is found to be independent of the degree of clustering. In contrast, above a critical obstacle strength determined by the degree of clustering, the critical resolved shear strength becomes constant. It is shown that this behaviour can be explained semi-analytically by considering the probability of interaction between the dislocation line and obstacles at a given level of stress. The consequences for alloys exhibiting solute clustering are discussed.     

Approximations in the l∞ norm and the generalized inverse

We introduce the concept of a strict l_∞-metric projector, based in the definition of strict approximation, to prove that for each matrix A of order m×n with coefficients in the field R of real numbers there exists a set of operators G: R^m → Rⁿ homogeneous and continuous, but not necessarily linear (strict generalized inverse) such that AGA = A and 6AGy?y6 is minimized for all y, when the norm is the l_∞ norm. We investigate the properties of these operators and prove that there are two distinguished operators A^-1_{∞, β} and A^-1_∞ which are extensions of the generalized inverse introduced by Newman and Odell in the case of a strictly convex norm.     

Pythagoras’s oxen revisited

it is said that when Pythagoras discovered his famous theorem, in a right-angled triangle the squares of the smaller sides sum up to the square of the hypoteneuse, he sacrificed a hundred oxen to thank the gods.     

The dynamics of magnetic flows for energies above Mañé’s critical value

We show that, for energies above Mañé’s critical value, minimal magnetic geodesics are Riemannian (A, 0)-quasi-geodesics whereA→1 as the energy tends to infinity. As a consequence, on negatively curved manifolds, minimal magnetic geodesics lie in tubes around Riemannian geodesics.Finally, we investigate a natural metric introduced by Mañé via the so-called action potential. Although this magnetic metric does depend on the magnetic field, the associated magnetic length turns out to be just the Riemannian length.     

Self-dual codes over the Kleinian four group

We introduce self-dual codes over the Kleinian four group K=Z ₂×Z ₂ for a natural quadratic form on K ⁿ and develop the theory. Topics studied are: weight enumerators, mass formulas, classification up to length 8, neighbourhood graphs, extremal codes, shadows, generalized t-designs, lexicographic codes, the Hexacode and its odd and shorter cousin, automorphism groups, marked codes. Kleinian codes form a new and natural fourth step in a series of analogies between binary codes, lattices and vertex operator algebras. This analogy will be emphasized and explained in detail.     

Two Tree-Width-Like Graph Invariants

In this paper we introduce two tree-width-like graph invariants. The first graph invariant, which we denote by ⁼(G), is defined in terms of positive semi-definite matrices and is similar to the graph invariant (G), introduced by Colin de Verdière in [J. Comb. Theory, Ser. B., 74:121–146, 1998]. The second graph invariant, which we denote by (G), is defined in terms of a certain connected subgraph property and is similar to (G), introduced by van der Holst, Laurent, and Schrijver in [J. Comb. Theory, Ser. B., 65:291–304, 1995]. We give some theorems on the behaviour of these invariants under certain transformations. We show that ⁼(G)=(G) for any graph G with ⁼(G)4, and we give minimal forbidden minor characterizations for the graphs satisfying ⁼(G)k for k=1,2,3,4.This paper is extracted from two chapters of [7]. This work was done while the author was at the Centrum voor Wiskunde en Informatica, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.     

For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?

Denote by the class of all triangle-free graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical triangle-free graph is bipartite. Fix > 0 and let . If n/2 m (1 – ) t ₃, then almost all graphs in are not bipartite, whereas if m (1 + )t ₃, then almost all of them are bipartite. For m (1 + )t ₃, this allows us to determine asymptotically the number of graphs in . We also obtain corresponding results for C -free graphs, for any cycle C of fixed odd length. Forschergruppe Algorithmen, Struktur, Zufall supported by Deutsche Forschungsgemeinschaft grant FOR 413/1-1     

Quantum–classical correspondence and the role of the dipole function in molecular dissociation

We consider the quantum and classical dissociation dynamics of heteronuclear diatomic molecules induced by infrared laser pulses. The field–molecule interaction is given by the product of the time-dependent electric field and the molecule permanent dipole. We investigate the influence of the dipole function in molecular dissociation. We show that the dissociation can be suppressed at certain external field frequencies for a nonlinear and finite-range dipole function. The correspondence between quantum and classical results is established by relating classical Fourier amplitudes to discrete–continuum quantum matrix elements.