On the structure of weight modules

Given any simple Lie superalgebra , we investigate the structure of an arbitrary simple weight -module. We introduce two invariants of simple weight modules: the shadow and the small Weyl group. Generalizing results of Fernando and Futorny we show that any simple module is obtained by parabolic induction from a cuspidal module of a Levi subsuperalgebra. Then we classify the cuspidal Levi subsuperalgebras of all simple classical Lie superalgebras and of the Lie superalgebra W. Most of them are simply Levi subalgebras of , in which case the classification of all finite cuspidal representations has recently been carried out by one of us (Mathieu). Our results reduce the classification of the finite simple weight modules over all classical simple Lie superalgebras to classifying the finite cuspidal modules over certain Lie superalgebras which we list explicitly.

     

Radical Cation States of 2,3,5,6,7,8-Hexamethylidenebicyclo [2.2.2]octane

The photoelectron spectrum of the title compound is reported and assigned by correlation with the photoelectron spectra of related molecules.     

Another complete invariant for Steiner triple systems of order 15

In this note, the 80 non‐isomorphic triple systems on 15 points are revisited from the viewpoint of the convex hull of the characteristic vectors of their blocks. The main observation is that the numbers, of facets of these 80 polyhedra are all different, thus producing a new proof of the non‐isomorphism of these triple systems. The space dimension of these polyhedra is also discussed. Finally, we observe the large number of facets of some of these polyhedra with few vertices, in relation with the upper bound problem for combinatorial polyhedra. © 2005 Wiley Periodicals, Inc. J Combin Designs.     

Singular continuous Floquet operator for periodic quantum systems

Consider the Floquet operator of a time independent quantum system, acting on a separable Hilbert space, periodically perturbed by a rank one kick: e−iH₀Te−iκT|?〉〈?| where T is the period, κ the coupling constant, and H₀ is a pure point self-adjoint operator, bounded from below. Under some hypotheses on the vector ?, cyclic w.r.t. H₀ we prove the following:

•

If the gaps between the eigenvalues (λn) are such that λn+1−λn?Cn−γ for some γ∈]0,1[ and C>0, then the Floquet operator of the perturbed system is purely singular continuous T-a.e.

•

If H₀ is the Hamiltonian of the one-dimensional rotator on L²(R/T₀Z) and the ratio is irrational, then the Floquet operator is purely singular continuous as soon as κT≠0(2π).

We also establish an integral formula for the family .     

Detonation formation in H $_2$-O $_2$/He/Ar mixtures at elevated initial pressures

In this paper the formation of detonation in H-O/He/Ar mixtures at elevated initial pressures was investigated in an initiation tube for a detonation driver with an exploding wire as the ignition source. In most experiments the detonation wave was formed by a DDT process in which a reactive shock wave accelerates behind the leading shock wave and eventually leads to the onset of detonation. The onset position was found to be at the leading shock wave or behind it. Only in very sensitive mixtures at high initial pressure the direct initiation of detonation was observed. The influence of ignition energy, initial pressure and composition on the detonation induction distance was determined. The results show that the detonation induction distance increases with the decrease of ignition energy and initial pressure and with the increase of the mole fraction of helium or argon. With the same mole fraction, argon increases the induction distance more than helium. In the facility utilized the DDT upper and lower limits of hydrogen in H-O mixtures are in the ranges from 36 to 40 % and from 78 to 82 %, respectively, and the upper limits for helium and argon in stoichiometric H-O mixtures are 40 % and 36 %, respectively. High pressure peaks generated by the DDT process were measured, especially in mixtures near the DDT limits. Statistical results show that such peak pressures can be up to 6 times of the CJ-pressures. Received 1 March 2000 / Accepted 25 May 2000     

An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees

The problem of reconstructing the duplication tree of a set of tandemly repeated sequences which are supposed to have arisen by unequal recombination, was first introduced by Fitch (1977), and has recently received a lot of attention. In this paper, we place ourselves in a distance framework and deal with the restricted problem of reconstructing single copy duplication trees. We describe an exact and polynomial distance based algorithm for solving this problem, the parsimony version of which has previously been shown to be NP-hard (like most evolutionary tree reconstruction problems). This algorithm is based on the minimum evolution principle, and thus involves selecting the shortest tree as being the correct duplication tree. After presenting the underlying mathematical concepts behind the minimum evolution principle, and some of its benefits (such as statistical consistency), we provide a new recurrence formula to estimate the tree length using ordinary least-squares, given a matrix of pairwise distances between the copies. We then show how this formula naturally forms the dynamic programming framework on which our algorithm is based, and provide an implementation in O(n³) time and O(n²) space, where n is the number of copies.     

Non-classical preference models in combinatorial problems: Models and algorithms for graphs

This is a summary of the most important results presented in the authors PhD thesis (Spanjaard 2003). This thesis, written in French, was defended on 16 December 2003 and supervised by Patrice Perny. A copy is available from the author upon request. This thesis deals with the search for preferred solutions in combinatorial optimization problems (and more particularly graph problems). It aims at conciliating preference modelling and algorithmic concerns for decision aiding.Received: March 2004, MSC classification: 91B06, 90C27, 90B40, 16Y60     

NoteA 16-vertex tournament for which Banks set and Slater set are disjoint

Given a tournament T, a Banks winner of T is the first vertex of any maximal (with respect to inclusion) transitive subtournament of T; a Slater winner of T is the first vertex of any transitive tournament at minimum distance of T (the distance being the number of arcs to reverse in T to make T transitive). In this note, we show that there exists a tournament with 16 vertices for which no Slater winner is a Banks winner. This counterexample improves the previous one, due to G. Laffond and J.-F. Laslier, which has 75 vertices.     

Gaussian Version of a Theorem of Milman and Schechtman

Using Gordon's inequalities, we give a short proof of the existence of an embedding T:l2k to ln such that ||T||||T-1|| c k/ln(1+n/k). In the same way, we give a new proof of a theorem of Milman and Schechtman (1995).