On the realization of Riemannian symmetric spaces in Lie groups

In this paper we give a realization of some symmetric space G/K as a closed submanifold P of G. We also give several equivalent representations of the submanifold P. Some properties of the set gK∩P are also discussed, where gK is a coset space in G.     

Asymptotique de la norme $L^2$ d'un cycle géodésique dans les revêtements de congruence d'une variété hyperbolique arithmétique

Let M be an arithmetic hyperbolic manifold and be a codimension 1 geodesic cycle. In this paper, we study the asymptotic growth of the -norm of the lifts of F in the congruence tower above M. We obtain an explicit value for the growth rate of this norm. In particular, we provide a new proof of a celebrated result of Millson [Mi] on the homology of the arithmetic hyperbolic manifolds. The method is quite general and gives a new way of getting non zero homology classes in certain locally symmetric spaces. Received: 20 April 2001; in final form: 26 September 2001 / Published online: 28 February 2002     

Intertwining differential operators and reducibility of generalized Verma modules

Supported in part by NSF Grant DMS-8610730     

Optimal convex hull algorithms on enhanced meshes

In this paper we propose time-optimal convex hull algorithms for two classes of enhanced meshes. Our first algorithm computes the convex hull of an arbitrary set ofn points in the plane inO (logn) time on a mesh with multiple broadcasting of sizen×n. The second algorithm shows that the same problem can be solved inO (1) time on a reconfigurable mesh of sizen×n. Both algorithms achieve time lower bounds for their respective model of computation.This work was supported by NASA under grant NCCI-99.Additional support by the National Science Foundation under grant CCR-8909996 is gratefully acknowledged.     

Packing Non-Zero A-Paths In Group-Labelled Graphs

Let G=(V,E) be an oriented graph whose edges are labelled by the elements of a group Γ and let A⊂V. An A-path is a path whose ends are both in A. The weight of a path P in G is the sum of the group values on forward oriented arcs minus the sum of the backward oriented arcs in P. (If Γ is not abelian, we sum the labels in their order along the path.) We are interested in the maximum number of vertex-disjoint A-paths each of non-zero weight. When A = V this problem is equivalent to the maximum matching problem. The general case also includes Mader's S-paths problem. We prove that for any positive integer k, either there are k vertex-disjoint A-paths each of non-zero weight, or there is a set of at most 2k −2 vertices that meets each of the non-zero A-paths. This result is obtained as a consequence of an exact min-max theorem. These results were obtained at a workshop on Structural Graph Theory at the PIMS Institute in Vancouver, Canada. This research was partially conducted during the period the first author served as a Clay Mathematics Institute Long-Term Prize Fellow.     

Ü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.     

Optimization of lantadenes isolation and preparation of 22 β-hydroxyoleanonic acid

The lantadenes fraction from Lantana camara was isolated and transformed to the medicinally important intermediate 22β-hydroxyoleanonic acid. The compound was studied for hepatotoxicity using lantadene A as standard and found to be nontoxic. Published in Khimiya Prirodnykh Soedinenii, No. 4, pp. 357–358, July–August, 2006.