Adaptive local grid refinement algorithms for finite-element collocation

An adaptive grid refinement procedure allows accurate solutions to advection-dominated, time-dependent flows using finite-element collocation. The technique relies on a data structure that is readily amenable to parallel computing. The paper discusses computational aspects of the method.     

A gauge-covariant bimetric tetrad theory of gravitation and electromagnetism

In order to get to a geometrically based theory of gravitation and electromagnetism, a gauge covariant bimetric tetrad space-time is introduced. The Weylian connection vector is derived from the tetrads and it is identified with the electromagnetic potential vector. The formalism is simplified by the use of gauge-invariant quantities. The theory contains a contorsion tensor that is connected with spinning properties of matter. The electromagnetic field may be induced by conventional sources and by spinning matter. In absence of spinning matter, the equations are identical with those of the gauge-covariant bimetric theory.⁽²³⁾     

Duality Principles in Frame Theory

Duality principles in Gabor theory such as the Ron–Shen duality principle and the Wexler–Raz biorthogonality relations play a fundamental role for analyzing Gabor systems. In this article we present a general approach to derive duality principles in abstract frame theory. For each sequence in a separable Hilbert space we define a corresponding sequence dependent only on two orthonormal bases. Then we characterize exactly properties of the first sequence in terms of the associated one, which yields duality relations for the abstract frame setting. In the last part we apply our results to Gabor systems.     

Affine Twin Buildings

It is well known from work of Bruhat and Tits that an affinebuilding has a spherical building at infinity. The paper studiesthe structure at infinity for an affine twin building. It isshown that the twinning restricts the structure at infinityin a natural way, producing two smaller spherical buildingsthat are canonically isomorphic to one another. In the processit is shown that to each wall and panel of these buildings atinfinity is attached a twin tree.     

Pentopyranosyl Oligonucleotide Systems. 9th Communication

Pyranosyl‐RNA (‘p‐RNA’ ) is an oligonucleotide system isomeric to natural RNA and composed of the very same building blocks as RNA. Its generational, chemical, and informational properties are deemed to be those of an alternative nucleic acid system that could have been a candidate in Nature's evolutionary choice of the molecular basis of genetic function. We consider the study of the chemistry of p‐RNA as etiologically relevant in the sense that knowledge of its structural, chemical, and informational properties on the chemical level offers both a perspective and reference points for the recognition of specific structural assets of the RNA structure that made it the (supposedly) superior system among possible alternatives and, therefore, the system that became part of biology as we know it today. The paper describes the chemical synthesis of β‐d‐ (and L )‐ribopyranosyl‐(4′→2′)‐oligonucleotide sequences, presents a resume of their structural and chemical properties, and cautiously discusses what we may and may not have learned from the pyranosyl isomer of RNA with respect to the conundrum of RNA's origin.     

The Central Limit Problem for Random Vectors with Symmetries

Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are coordinatewise symmetric, uniform in a regular simplex, or spherically symmetric. Our proofs are based on Stein’s method of exchangeable pairs; as far as we know, this approach has not previously been used in convex geometry. The spherically symmetric case is treated by a variation of Stein’s method which is adapted for continuous symmetries. This work was done while at Stanford University.     

A very simple algorithm for estimating the number of k-colorings of a low-degree graph

A fully polynomial randomized approximation scheme is presented for estimating the number of (vertex) k-colorings of a graph of maximum degree Δ, when k ≥ 2Δ + 1. © 1995 John Wiley & Sons, Inc.     

A convenient synthesis of sulfonylureas from carboxylic acids and sulfonamides via an in situ Curtius rearrangement

A one-pot reaction of carboxylic acids with sulfonamides to afford sulfonylureas is described.     

Pseudo-Anosov foliations on periodic surfaces

We study lifts of the stable foliation of a pseudo-Anosov diffeomorphism to abelian covers. Under certain conditions, we show that it is ergodic but not uniquely ergodic and describe the ergodic measures.     

Mean curvature flow with a forcing term in minkowski space

We study the forced mean curvature flow of graphs in Minkowski space and prove longtime existence of solutions. When the forcing term is a constant, we prove convergence to either a constant mean curvature hypersurface or a translating soliton – depending on the boundary conditions at infinity. It is a pleasure to thank my PhD advisors Klaus Ecker and Gerhard Huisken for their assistance and encouragement. I also thank Maria Athanassenas, Oliver Schnürrer and Marty Ross for their interest and useful comments, and the Max Planck Gesellschaft for financial support.