Parametric multiple sequence alignment and phylogeny construction

Bounds are given on the size of the parameter-space decomposition induced by multiple sequence alignment problems where phylogenetic information may be given or inferred. It is shown that many of the usual formulations of these problems fall within the same integer parametric framework, implying that the number of distinct optima obtained as the parameters are varied across their ranges is polynomially bounded in the length and number of sequences.     

Stark's conjecture over complex cubic number fields

Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.

     

Investigating and ordering Quadrilaterals and their analogies in space—problem fields with various aspects

Problem fields with one or two generating problems and possibilities of varying existing problems give a good chance for self-activities of students and can be used for reaching different general aims. In this paper some topics concerning quadrilaterals will be presented. I hope they will animate teachers for more problem orientation in mathematics education. First we will reflect about different types of convex and non-convex quadrilaterals and possibilities of ordering them. Then we focus on middle-quadrilaterals and types of quadrilaterals with special middle-quadrilaterals as well as their logical ordering. Finally we investigate the analogies in space to the parallelogram and its sub-types and order them in the “house of parallelepipeds”.     

2‐connected 7‐coverings of 3‐connected graphs on surfaces

An m‐covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus k ≥ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most 6k ? 12 vertices of degree 7. We also construct, for every surface F² with Euler genus k ≥ 2, a 3‐connected graph G on F² with arbitrarily large representativity each of whose 2‐connected 7‐coverings contains at least 6k ? 12 vertices of degree 7. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 26–36, 2003     

Optimized Pump Power Ratio on 2nd Order Pumping Discrete Raman Amplifier

By optimizing pump power ratio between 1st order backward pump and 2nd order forward pump on discrete Raman amplifier, we demonstrated over 2dB noise figure improvement without excessive non-linearity degradation.     

A cusp singularity with no Galois cover by a complete intersection

With an explicit example, we confirm a conjecture by Neumann and Wahl that there exist cusps with no Galois cover by a complete intersection. Some computational techniques are reviewed, and a method for deciding whether a given cusp has a complete intersection Galois cover is developed.

     

Block transitive Steiner systems with more than one point orbit

For all ‘reasonable’ finite t, k, and s, we construct a t‐(?₀, k, 1) design and a group of automorphisms which is transitive on blocks and has s orbits on points. In particular, there is a 2‐(?0, 4, 1) design with a block‐transitive group of automorphisms having two point orbits. This answers a question of P. J. Cameron and C. E. Praeger. The construction is presented in a purely combinatorial way, but is a by‐product of a new way of looking at a model‐theoretic construction of E. Hrushovski. © 2004 Wiley Periodicals, Inc.     

Letter: Causality Violating Geodesics in Bonnor's Rotating Dust Metric

We exhibit timelike geodesic paths for a metric, introduced by Bonnor [11] and considered also by Steadman [13], and show that coordinate time runs backward along a portion of these geodesics.     

Transition‐metal‐catalyzed reactions of 5‐methylene‐2‐oxazolidinone and 5‐methylene‐1,3‐thiazolidine‐2‐thione with isocyanates

5‐Methylene‐2‐oxazolidinone (1) and 5‐methylene‐1,3‐thiazolidine‐2‐thione (4) react with various isocyanates to give the corresponding urethanes 3 and 5 in high yields in the presence of palladium(0) or palladium(II) catalyst under mild reaction conditions. A mechanism is proposed. Copyright © 2003 John Wiley & Sons, Ltd.     

π1-classification of real arrangements with up to eight lines

One of the open questions in the geometry of line arrangements is to what extent does the incidence lattice of an arrangement determine its fundamental group. Line arrangements of up to 6 lines were recently classified by K.M. Fan (Michigan Math. J. 44(2) (1997) 283), and it turns out that the incidence lattice of such arrangements determines the projective fundamental group. We use actions on the set of wiring diagrams, introduced in (Garber et al. (J. Knot Theory Ramf.), to classify real arrangements of up to 8 lines. In particular, we show that the incidence lattice of such arrangements determines both the affine and the projective fundamental groups.