A greedy algorithm for multicut and integral multiflow in rooted trees

We present an O(min(Kn,n²)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality.     

A monotone iterative scheme for a nonlinear second order equation based on a generalized anti–maximum principle

In this paper, a generalized anti–maximum principle for the second order differential operator with potentials is proved. As an application, we will give a monotone iterative scheme for periodic solutions of nonlinear second order equations. Such a scheme involves the L^p norms of the growth, 1 ≤ p ≤ ∞, while the usual one is just the case p = ∞.     

Some notes on the big trip

The big trip is a cosmological process thought to occur in the future by which the entire universe would be engulfed inside a gigantic wormhole and might travel through it along space and time. In this Letter we discuss different arguments that have been raised against the viability of that process, reaching the conclusions that the process can actually occur by accretion of phantom energy onto the wormholes and that it is stable and might occur in the global context of a multiverse model. We finally argue that the big trip does not contradict any holographic bounds on entropy and information.     

Some Remarks on the Geodesic Completeness of Compact Nonpositively Curved Spaces

We study the following question: does a compact nonpositively curved space have a totally geodesic core?     

Homogeneous quaternionic Kähler structures of linear type

A classification of homogeneous quaternionic Kähler structures by real tensors is given and related to Fino's representation theoretic decomposition. A relationship between the modules whose dimension grows linearly and quaternionic hyperbolic space is found. To cite this article: M. Castrillón López et al., C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

Dihalodimethyltin(IV) complexes of 2‐(pyrazol‐1‐ylmethyl)pyridine

Reaction of dichloro‐ and dibromodimethyltin(IV) with 2‐(pyrazol‐1‐ylmethyl)pyridine (PMP) afforded [SnMe₂Cl₂(PMP)] and [SnMe₂Br₂(PMP)] respectively. The new complexes were characterized by elemental analysis and mass spectrometry and by IR, Raman and NMR (¹H, ¹³C) spectroscopies. Structural studies by X‐ray diffraction techniques show that the compounds consist of discrete units with the tin atom octahedrally coordinated to the carbon atoms of the two methyl groups in a trans disposition (Sn? C = 2.097(5), 2.120(5) Å and 2.110(6), 2.121(6) Å in the chloro and in the bromo compounds respectively), two cis halogen atoms (Sn? Cl = 2.4908(16), 2.5447(17) Å; Sn? Br = 2.6875(11), 2.7464(9) Å) and the two donor atoms of the ligand (Sn? N = 2.407(4), 2.471(4) Å and 2.360(5), 2.455(5) Å). In both cases, the Sn? N(pyridine) bond length is markedly longer than the Sn? N(pyrazole) distance. Copyright © 2003 John Wiley & Sons, Ltd.     

Synthetic routes for naturally-occurring arsenic-containing ribosides

The synthesis of (R)-2′,3′-dihydroxypropyl 5-deoxy-5-dimethylarsinoyl-β-d-riboside, (S)-2′-hydroxy-3′-sulfonylpropyl 5-deoxy-5-dimethylarsinoyl-β-d-riboside and (S)-2′-hydroxy-3′-sulfooxypropyl 5-deoxy-5-dimethylarsinoyl-β-d-riboside, common naturally-occurring arsenicals in algae and molluscs, is reported.     

Using graphs for some discrete tomography problems

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.