Normal Bundles to Laufer Rational Curves in Local Calabi–Yau Threefolds

We prove a conjecture by F. Ferrari. Let X be the total space of a nonlinear deformation of a rank two holomorphic vector bundle on a smooth rational curve, such that X has trivial canonical bundle and has sections. Then the normal bundle to such sections is computed in terms of the rank of the Hessian of a suitably defined superpotential at its critical points.     

Impact of photodepletion to amplified spontaneous emission of proton-transfer dyes in polymeric matrices

A six level rate equation system was used to investigate the impact of photodepletion to amplified spontaneous emission (ASE) of intramolecular proton-transfer (IPT) dyes incorporated into polymeric hosts. The model includes the most important transitions for the normal and tautomer form of the molecule as well as intersystem crossing and triplet–triplet transitions. The experimentally observed pulse shape as well as photodepletion phenomena, i.e. a first order exponential decay of the ASE intensity and a shortening in ASE pulse width, have been simulated successfully. Additionally, the model was used to propose an explanation of the unexpected high photodepletion of proton-transfer dyes in solids. The results show that the emission cross section and reabsorption cross section of the tautomer form of the molecule are the most important parameter not only for efficiency but also for photodepletion. The model was tested by comparison with experimental results of 2-(2’-hydroxyphenyl)benzimidazole in polymethylmethacrylate (PMMA), polystyrene (PS) and a 1:1 alternating copolymer matrix PS-co-PMMA. PACS 78.45.th; 42.55.Mv; 42.70.Jk     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Nonvanishing cohomology and classes of Gorenstein rings

We give counterexamples to the following conjecture of Auslander: given a finitely generated module M over an Artin algebra Λ, there exists a positive integer n_M such that for all finitely generated Λ-modules N, if Ext_Λⁱ(M,N)=0 for all i?0, then Ext_Λⁱ(M,N)=0 for all i?n_M. Some of our examples moreover yield homologically defined classes of commutative local rings strictly between the class of local complete intersections and the class of local Gorenstein rings.     

Eine neue volumetrische Methode zur Bestimmung der salpetrigen S?ure

Ohne Zusammenfassung     

Stability of Crystalline Ion Beams

Hyperfine Interactions - In this paper, the conditions for which three-dimensional crystalline ion beams were attained in the rf quadrupole storage ring PALLAS at a velocity of around 2800 m/s are...     

Stratifiable Families of Extremals and Sufficient Conditions for Optimality in Optimal Control Problems

It is shown that, if a parametrized fämily of extremals F can be stratified in a way compatible with the flow map generated by F, then those trajectories of the family which realize the minimal values of the cost in F are indeed optimal in comparison with all trajectories which lie in the region R covered by the trajectories of F. It is not assumed that F is a field covering the state space injectively. As illustration, an optimal synthesis is constructed for a system where the flow of extremals exhibits a simple cusp singularity.     

Random Walks And The Colored Jones Function

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords. Electronic supplementary material to this article is available at and is accessible to authorized users. * S. G. was partially supported by an NSF and by an Israel-US BSF grant. † M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education.     

Shape Optimization for Semi-Linear Elliptic Equations Based on an Embedding Domain Method

We study a class of shape optimization problems for semi-linear elliptic equations with Dirichlet boundary conditions in smooth domains in ℝ². A part of the boundary of the domain is variable as the graph of a smooth function. The problem is equivalently reformulated on a fixed domain. Continuity of the solution to the state equation with respect to domain variations is shown. This is used to obtain differentiability in the general case, and moreover a useful formula for the gradient of the cost functional in the case where the principal part of the differential operator is the Laplacian. Online publication 23 January 2004.     

Allocating energy in a first-to-n match

This paper models a decision where a player must allocate limitedenergy over a contest of uncertain length. The motivating exampleis a squash match where one of the players is not as fit asthe other. Should a player's energy be concentrated in the earlygames of the match? Should it be spread evenly over all possiblegames? Or should it be conserved for the end of the match? Wemodel this as a decision problem where, in each game, the decision-makermust determine how much energy to expend. We assume that thereare only a small number of discrete energy choices for eachgame and that the more energy the decision-maker expends, themore likely he is to win that game. We solve for the optimaldecision with dynamic programming. With only two possible energychoices for each game, we show that it does not matter how energyis expended. In the case where there are three or more energychoices, we show how to take advantage of the structure of theproblem to determine the optimal sequence of decisions. As forpractical advice, the model suggests that when the decision-makerfalls behind in a match, he ought to switch to a more conservativeapproach by dividing his remaining energy evenly among all thepossible remaining games. Received 14 May 2003. Revised 5 January 2004.