Über die abstandsverträglichen Abbildungen auf dem Kreis und auf der reellen Geraden

Zusammenfassung. Eine Abbildung zwischen metrischen R?umen hei?t abstandsvertr?glich, wenn der Abstand der Bilder zweier Punkte nur vom Abstand der Punkte selbst abh?ngt. Wir zeigen, dass eine Abbildung genau dann abstandsvertr?glich ist, wenn der Cauchyschen Funktionalgleichung genügt, also ein Endomorphismus der Gruppe ist. Ein entsprechendes Resultat gilt auch für die abstandsvertr?glichen Abbildungen des Kreises (mit der Multiplikation komplexer Zahlen als Gruppenverknüpfung). Damit kann man sowohl alle messbaren abstandsvertr?glichen Abbildungen von bzw. in sich angeben, als auch einen Nachweis für die Existenz nichtmessbarer abstandsvertr?glicher Abbildungen auf und erbringen. Eingegangen am 20. Juni 2001 / Angenommen am 13. September 2001     

Optimality problem for infinite dimensional bilinear systems

For any finite dimensional control system with arbitrary cost, Pontryagin's Maximum Principle (PMP) [N. Bensalem, Localisation des courbes anormales et problème d'accessibilité sur un groupe de Lie hilbertien nilpotent de degré 2, Thèse de doctorat, Université de Savoie, 1998. [6]] gives necessary conditions for optimality of trajectories. In the infinite dimensional case, it is well known that these conditions are no more true in general. The purpose of this paper is to establish an “approached” version of PMP for infinite dimensional bilinear systems, with fixed final time and without constraints on the final state. Moreover, if the set of control is contained in a closed bounded convex subset with operators defining its dynamics are compact, or if it is contained in a finite dimensional space, we get an “exact” version of PMP. We also give two applications of these results. The first one deals with sub-Riemannian geometry on nilpotent Hilbertian Lie groups for which we can define a sub-Riemannian distance. The second one deals with heat equation for which we analyse the necessary conditions to give the optimal controls.     

On the structure of finite coverings of compact connected groups

Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.     

Almost sure estimates for the concentration neighborhood of Sinai’s walk

We consider Sinai’s random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is bounded almost surely. We also get that i.o. the maximal distance between two favorite sites is bounded almost surely.     

Metric spaces with discrete topological fundamental group

With a certain natural topology, the fundamental group of a locally path connected metric space X becomes discrete if and only if X is semilocally simply connected. We include some related material and offer a counterexample to a similar result.     

Random Walks And The Colored Jones Function

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords. Electronic supplementary material to this article is available at and is accessible to authorized users. * S. G. was partially supported by an NSF and by an Israel-US BSF grant. † M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education.     

A preconditioned domain decomposition algorithm for the solution of the elliptic Neumann problem

A new preconditioned conjugate gradient (PCG)-based domain decomposition method is given for the solution of linear equations arising in the finite element method applied to the elliptic Neumann problem. The novelty of the proposed method is in the recommended preconditioner which is constructed by using cyclic matrix. The resulting preconditioned algorithms are well suited to parallel computation.     

Amine‐blocked polyisocyanates. I. Synthesis of novel N‐methylaniline‐blocked polyisocyanates and deblocking studies using hot‐stage fourier transform infrared spectroscopy

A series of substituted N‐methylaniline‐blocked polyisocyanates based on 4,4′‐methylenebis(phenyl isocyanate) and poly(tetrahydrofuran) were prepared and characterized thoroughly with FTIR, ¹H NMR, and ¹³C NMR spectroscopy methods. Compared with unsubstituted N‐methylaniline, a blocking agent with an electron‐releasing substituent at the para position took a shorter time, whereas those with an electron‐releasing substituent at the ortho position or an electron‐withdrawing substituent at the ortho and para positions took longer times for the blocking reaction. The thermal dissociation reactions of blocked polyisocyanates were carried out with an FTIR spectrophotometer attached to hot‐stage accessories under dynamic and isothermal conditions. The dynamic method was used to determine the deblocking temperature, and the isothermal method was used to calculate the deblocking kinetics and activation parameters. The cure times of blocked polyisocyanates with hydroxyl‐terminated polybutadiene were also determined. The deblocking temperatures, the results of cure‐time studies, and the kinetic parameters revealed that the thermal dissociation of the N‐methylaniline‐blocked polyisocyanates was retarded by electron‐donating substituents and facilitated by electron‐withdrawing substituents. The action of N‐methylanilines as blocking agents for isocyanate was explained by the formation of a four‐center, intramolecularly hydrogen‐bonded ring structure during the thermal dissociation of the blocked polyisocyanates. The formation of such a hydrogen‐bonded ring structure was confirmed and supported by variable‐temperature ¹H NMR studies and entropy parameters, respectively. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 1557–1570, 2007     

Primes in quadratic progressions on average

In this paper, we establish a theorem on the distribution of primes in quadratic progressions on average.