Finiteness of Ricci flat supersymmetric non-linear σ-models

Combining the constraints of Kähler differential geometry with the universality of the normal coordinate expansion in the background field method, we study the ultraviolet behavior of 2-dimensional supersymmetric non-linear -models with target space an arbitrary riemannian manifoldM. We show that the constraint ofN=2 supersymmetry requires that all counterterms to the metric beyond one-loop order be cohomologically trivial. It follows that such supersymmetric non-linear -models defined on locally symmetric spaces are super-renormalizable and thatN=4 models are on-shell ultraviolet finite to all orders of perturbation theory.     

Relations between subclasses of greedoids

In previous papers many different classes and constructions of greedoids have been defined and studied. This paper documents inclusion relations among all subclasses of greedoids which are known so far. It will be shown that all inclusion relations are proper and that all but one subclasses of interval greedoids are distinct.

---

Zusammenfassung In früheren Arbeiten wurden viele verschiedene Klassen und Konstruktionen für Greedoide eingeführt und studiert. In dieser Arbeit werden alle bekannten Inklusionsbeziehungen zwischen Unterklassen von Greedoiden dokumentiert. Es wird gezeigt, daß alle Inklusionsbeziehungen echt und alle Unterklassen mit einer Ausnahme tatsächlich verschieden sind.

---

---

Supported by the joint research project Algorithmic Aspects of Combinatorial Optimization of the Hungarian Academy of Sciences (Magyar Tudományos Akadémia) and the German Research Association (Deutsche Forschungsgemeinschaft, SFB 21). Part of this research was done while the first author was visiting the Department of Combinatorics and Optimization, University of Waterloo.     

Nonlinear one-parametric bottleneck linear programming

We consider the one-parametric linear bottleneck problem min {c (x, t) ¦ x P (t)} where the bottleneck objectivec (x, t):=max {c_j (t) ¦ x_j>0} is minimized subject to linear constraints, i.e. P(t):={x ¦A (t) ·x=b (t), x0}. All coefficients are assumed to be continuous functions of one real parametert which varies in a real intervalS. A method is developed for constructing a partition ofS into subintervals on which either a basis stays optimal or the problem stays infeasible. Finiteness of the partition is due to certain finiteness assumptions on the zeroes of particular combinations of the coefficient functions. Using a lexicographic refinement of the objective function a characterization of the optimality interval of a fixed basis is derived which is independent on explicit information about other bases.

---

Zusammenfassung Es werden einparametrische lineare Engpaßprobleme min {c (x, t) ¦x P (t)} betrachtet, wobei die Engpaßzielfunktionc (x, t):=max {c_j (t) ¦ x_j >0} unter linearen Nebenbedingungen, die durch P(t):={x ¦A (t) ·x=b (t), x0} gegeben sind, minimiert wird. Dabei wird angenommen, daß alle Koeffizienten stetige Funktionen eines reellen Parameterst aus einem IntervallS R sind. Es wird eine Methode entwickelt,S derart in Teilintervalle zu zerlegen, daß entweder eine Basis in solch einem Teilintervall optimal oder das Problem unzulässig bleibt. Die Endlichkeit dieser Partition vonS ergibt sich aus Endlichkeitsvoraussetzungen für die Nullstellen von Funktionen, die sich als gewisse Kombinationen der Koeffizientenfunktionen schreiben lassen. Durch eine lexikographische Verfeinerung der Zielfunktion gelingt es, das Intervall zu charakterisieren, in dem eine feste Basis optimal ist. Diese Charakterisierung ist unabhängig von expliziten Informationen über andere Basen.

     

Posets isomorphic to their extensions

A standard extension for a poset P is a system Q of lower ends (descending subsets) of P containing all principal ideals of P. An isomorphism between P and Q is called recycling if [Y]Q for all YQ. The existence of such an isomorphism has rather restrictive consequences for the system Q in question. For example, if Q contains all lower ends generated by chains then a recycling isomorphism between P and Q forces Q to be precisely the system of all principal ideals. For certain standard extensions Q, it turns out that every isomorphism between P and Q (if there is any) must be recycling. Our results include the well-known fact that a poset cannot be isomorphic to the system of all lower ends, as well as the fact that a poset is isomorphic to the system of all ideals (i.e., directed lower ends) only if every ideal is principal.     

Nondynamical calculation of polarization observables in d+d reactions at low energies

The parametrization of polarization observables in terms of (l, s, J) matrix elements is given for²H(d, p)³H and²H(d, n)³He reactions at low energies. It is shown that transverse polarizations of outgoing nucleons are to be measured in order to obtain a complete set of cross-section, analysing powers, spin-correlation and polarization transfer experiments.     

Beam-foil mean lifetimes in Kr II obtained from ANDC analysis

Detailed measurements on the 5p ⁴ S ₃ ^2/0 and 5p～' ² D ₅ ^2/0 levels in Kr II are reported. Cascade effects were taken into account with the aid of the arbitrarily normalized decay curve (ANDC) technique. Experimental values are compared to values obtained by other investigators as well as to theoretical values.