Diagram rigidity for geometric amalgamations of free groups

In this paper, we show that a class of 2-dimensional locally CAT(-1) spaces is topologically rigid: isomorphism of the fundamental groups is equivalent to the spaces being homeomorphic. An immediate application of this result is a diagram rigidity theorem for certain amalgamations of free groups. The direct limits of two such amalgamations are isomorphic if and only if there is an isomorphism between the respective diagrams.     

Measurement of X-ray production cross-sections of Ti,V, Cr,Mn, Fe,Co, Ni and Cu molecules

K shell X-ray production cross-sections in the Ti, V, Cr, Mn, Fe, Co, Ni, and Cu in the molecules were studied at 59.5 keV excitation energy by using a Si(Li) detector ( FWHM = 155 eV at 5.96 keV). The present results are compared with other theoretical values.     

Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree

We consider the question whether an infinite eulerian graph has a decomposition into circuits and rays if the graph has only finitely many, say n, vertices of infinite degree, and only finitely many finite components after the removal of the vertices of infinite degree. It is known that the answer is affirmative for n2 and negative for n4. We settle the remaining case n=3, showing that a decomposition into circuits and rays also exists in this case.     

Engouffrement symplectique et intersections lagrangiennes

Let }L _t{,t ∈ [0, 1], be a path of exact Lagrangian submanifolds in an exact symplectic manifold that is convex at infinity and of dimension ≥6. Under some homotopy conditions, an engulfing problem is solved: the given path }L _t{ is conjugate to a path of exact submanifolds inT ^*L_o. This impliesL _t must intersectL _o at as many points as known by the generating function theory. Our Engulfing theorem depends deeply on a new flexibility property of symplectic structures which is stated in the first part of this work.

     

Axioms for Sequential Convergence

It is of general knowledge that those (ultra)filter convergence relations coming from a topology can be characterized by two natural axioms. However, the situation changes considerable when moving to sequential spaces. In case of unique limit points Kisyński (Colloq Math 7:205–211, 1959/1960) obtained a result for sequential convergence similar to the one for ultrafilters, but the general case seems more difficult to deal with. Finally, the problem was solved by Koutnik (Closure and topological sequential convergence. In: Convergence Structures 1984 (Bechyně, 1984). Math. Res., vol. 24, pp. 199–204. Akademie-Verlag, Berlin, 1985). In this paper we present an alternative approach to this problem. Our goal is to find a characterization more closely related to the case of ultrafilter convergence. We extend then the result to characterize sequential convergence relations corresponding to Fréchet topologies, as well to those corresponding to pretopological spaces.      

Synthesis and metallation of 2-(pyridyl)benzoic acids and ethyl 2-(pyridyl)benzoates: a new route to azafluorenones

The ring deprotonation of 2-(2- and 4-pyridyl)benzoic acids using lithium dialkylamides in THF at rt, and the in situ cyclization afforded 4- and 2-azafluorenones, respectively. 1-Azafluorenone was obtained from ethyl 2-(3-pyridyl)benzoate using a similar protocol.     

Une remarque sur les Gδ-denses

Sans résuméThe first author is supported by the Scientific and Technical Research Council of Turkey, T.B.A.G-Ç2     

Emergency Logistics Planning in Natural Disasters

Logistics planning in emergency situations involves dispatching commodities (e.g., medical materials and personnel, specialised rescue equipment and rescue teams, food, etc.) to distribution centres in affected areas as soon as possible so that relief operations are accelerated. In this study, a planning model that is to be integrated into a natural disaster logistics Decision Support System is developed. The model addresses the dynamic time-dependent transportation problem that needs to be solved repetitively at given time intervals during ongoing aid delivery. The model regenerates plans incorporating new requests for aid materials, new supplies and transportation means that become available during the current planning time horizon. The plan indicates the optimal mixed pick up and delivery schedules for vehicles within the considered planning time horizon as well as the optimal quantities and types of loads picked up and delivered on these routes. In emergency logistics context, supply is available in limited quantities at the current time period and on specified future dates. Commodity demand is known with certainty at the current date, but can be forecasted for future dates. Unlike commercial environments, vehicles do not have to return to depots, because the next time the plan is re-generated, a node receiving commodities may become a depot or a former depot may have no supplies at all. As a result, there are no closed loop tours, and vehicles wait at their last stop until they receive the next order from the logistics coordination centre. Hence, dispatch orders for vehicles consist of sets of “broken” routes that are generated in response to time-dependent supply/demand. The mathematical model describes a setting that is considerably different than the conventional vehicle routing problem. In fact, the problem is a hybrid that integrates the multi-commodity network flow problem and the vehicle routing problem. In this setting, vehicles are also treated as commodities. The model is readily decomposed into two multi-commodity network flow problems, the first one being linear (for conventional commodities) and the second integer (for vehicle flows). In the solution approach, these sub-models are coupled with relaxed arc capacity constraints using Lagrangean relaxation. The convergence of the proposed algorithm is tested on small test instances as well as on an earthquake scenario of realistic size.