Velocity inversion: A case study in infinite-dimensional optimization

The goal of seismic velocity inversion is the estimation of seismic wave velocities inside the earth by attempting to predict, in a least-error sense, seismic waveforms measured at its surface. We present velocity inversion as a case study in the various infinite-dimensional pathologies which may afflict practically important problems of distributed parameter identification, treated as optimization problems in function spaces. These features differentiate various problem formulations far beyond the degree one would expect for finite- (small-) dimensional problems. We illustrate this differentiation by comparing the characteristics of three different least-squares formulations of velocity inversion.     

Chvátal closures for mixed integer programming problems

Chvátal introduced the idea of viewing cutting planes as a system for proving that every integral solution of a given set of linear inequalities satisfies another given linear inequality. This viewpoint has proven to be very useful in many studies of combinatorial and integer programming problems. The basic ingredient in these cutting-plane proofs is that for a polyhedronP and integral vectorw, if max(wx|x P, wx integer} =t, thenwx t is valid for all integral vectors inP. We consider the variant of this step where the requirement thatwx be integer may be replaced by the requirement that be integer for some other integral vector . The cutting-plane proofs thus obtained may be seen either as an abstraction of Gomory's mixed integer cutting-plane technique or as a proof version of a simple class of the disjunctive cutting planes studied by Balas and Jeroslow. Our main result is that for a given polyhedronP, the set of vectors that satisfy every cutting plane forP with respect to a specified subset of integer variables is again a polyhedron. This allows us to obtain a finite recursive procedure for generating the mixed integer hull of a polyhedron, analogous to the process of repeatedly taking Chvátal closures in the integer programming case. These results are illustrated with a number of examples from combinatorial optimization. Our work can be seen as a continuation of that of Nemhauser and Wolsey on mixed integer cutting planes.Supported by Sonderforschungsbereich 303 (DFG) and by NSF Grant Number ECS-8611841.Supported by NSF Grant Number ECS-8418392 and Sonderforschungsbereich 303 (DFG), Institut für Ökonometrie und Operations Research, Universität Bonn, FR Germany.     

Über den Typenkonvergenzsatz auf zusammenhängenden Lie Gruppen

The Convergence of Types Theorem on ^d is wellknown as an important tool for investigations on the limit behaviour of normalized sums or r.v. It is natural to look for a generalization for group-valued r.v. While for simply connected nilpotent Lie groups the Theorem is valid in general the existence of non-trivial compact subgroups causes problems. For compact extensions of nilpotent groups we prove restricted versions of the Convergence of Types Theorem.

---

---

Herrn Prof. Dr. L. Schmetterer zum 70. Geburtstag gewidmet     

On combinatorial and projective geometry

Cross ratios constitute an important tool in classical projective geometry. Using the theory of Tutte groups as discussed in [6] it will be shown in this note that the concept of cross ratios extends naturally to combinatorial geometries or matroids. From a thorough study of these cross ratios which, among other observations, includes a new matroid theoretic version and proof of the Pappos theorem, it will be deduced that for any projective space M= _n (K) of dimension n2 of M over some skewfield K the inner Tutte group is isomorphic to the commutator factor group K ^*/[K ^*, K ^*] of K ^*K{0}. This shows not only that in case M= _n (K) our matroidal cross ratios are nothing but the classical ones. It can also be used to correlate orientations of the matroid M= _n (K) with the orderings of K. And it implies that Dieudonné's (non-commutative) determinants which, by Dieudonné's definition, take their values in K ^*/[K ^*, K ^*] as well, can be viewed as a special case of a determinant construction which works for just every combinatorial geometry.Research supported by the DFG (Deutsche Forschungsgemeinschaft).     

On the Snider equation

We study the physical content of the Snider quantum transport equation and the origin of a puzzling feature of this equation, which implies contradictory values for the one-particle density operator. We discuss in detail why the two values are in fact not very different provided that the studied particles have sufficiently large wave packets and only a small interaction probability, a condition which puts a limit on the validity of the Snider equation. In order to improve its range of application, we propose a reinterpretation of the equation as a mixed equation relating the real one-particle distribution function (on the left-hand side of the equation) to the free distribution (on the right-hand side), which we have introduced in a recent contribution. In its original form, the Snider equation is valid only when used to generate Boltzmann-type equations where collisions are treated as point processes in space and time (no range, no duration); in this approximation, virial corrections are not included, so that the real and free distributions coincide. If the equation is used beyond this approximation to generate nonlocal and density corrections, we conclude that the results are not necessarily correct.     

On a point of order

A method of using algebraic curves to obtain estimates of critical points accurate enough to identify them as simple algebraic numbers (if that is what they are) is discussed and illustrated with an application to the (q-state Potts model on the triangular lattice for cases of pure two-site interactions and pure three-site interactions. In the latter case the critical point is conjectured to be . In a similar conjecture for the critical percolation probability on thedirected square lattice,q _c ^1/2 (q _c +3)=2(q _c +p _c =1).     

Synthesis and crystal and molecular structure of newN-substituted γ-hydroxybutyramides

TheN-(2-phenylethyl)amide of-(1, 1-ethylenedioxy)-ethyl--hydroxybutyric acid (II) and theN-(p-methoxybenzyl)amide of-(1, 1-ethylenedioxy)-ethyl--hydroxybutyric acid (III) have been synthesized and the crystal structure ofIII has been solved. CompoundIII, C₁₆H₂₃O₅N, crystallizes in the monoclinic space groupP2₁/c witha=12.572(2),b=11.149(2),c=12.317(2) Å and=106.53(1)°. The structure was solved by direct methods, and refined by full-matrix least squares to giveR=0.040 (R _w =0.047) for 2004 intensities. The dioxolane ring has a deformed half-chair conformation.     

Air-stable liquid clathrates. 1. Crystal structure of [NBu4][Br3] and reactivity of the [NBu4][Br3]·5 C6H6 liquid clathrate

[NBu₄][Br₃] interacts with C₆H₆ to form an air-stable liquid clathrate. The tribromide anion reacts with phenol to give para-bromophenol in>95% yield. The HBr which is generated in the reaction combines with the Br^– anion to form [Br-H-Br]^–. The latter forms the basis for a new liquid clathrate, [NBu₄][Br-H-Br]·n C₆H₆. The parent salt, [NBu₄][Br₃], crystallizes in the monoclinic space group C2/c witha=12.983(5),b=10.380(7),c=16.222(6) Å,=93.93(3)°, andD _c =1.47 g cm^–3 forZ=4. The final R value is 0.068 based on 787 observed reflections.     

Tracking poles and representing Hankel operators directly from data

Summary We propose and analyse a method of estimating the poles near the unit circleT of a functionG whose values are given at a grid of points onT: we give an algorithm for performing this estimation and prove a convergence theorem. The method is to identify the phase for an estimate by considering the peaks of the absolute value ofG onT, and then to estimate the modulus by seeking a bestL ² fit toG over a small arc by a first order rational function. These pole estimates lead to the construction of a basis ofL ² which is well suited to the numerical representation of the Hankel operator with symbolG and thereby to the numerical solution of the Nehari problem (computing the bestH , analytic, approximation toG relative to theL norm), as analysed in [HY]. We present the results of numerical tests of these algorithms.Partially supported by grants from the AFOSR and NSF     

Pointwise Stabilization for a Chain of Coupled Vibrating Strings

For the system representing a chain of coupled vibrating strings,we show that the associated semigroup satisfies the assumptionof spectrum-determined growth, and hence obtain conditions forenergy to decay strongly or exponentially. We examine in detailthe three-string case, and our results include those obtainedby others for the two-string case. Permanent address: Beijing Institute of Information and Control,Beijing, China.