Does a generic connection depend continuously on its curvature?

For a principal bundle with semi-simple structure group over a smooth four-dimensional base manifold, the set of connections (gauge potentials)A which are uniquely determined by their curvature (field or field strength)F is generic in the set of all potentials, endowed with the WhitneyC ^∞ topology. However, the operator taking each such fieldF to its potentialA is not continuous. Partial negative results are given concerning the existence of a smaller generic set on which this operator is continuous.     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Stable Ergodicity and Frame Flows

In this note we show that all diffeomorphisms close enough to the time-one map of the frame flow on certain negatively curved manifolds are ergodic. As a simple corollary we deduce that the frame flows are ergodic for all compact manifolds with curvature pinched sufficiently close to –1, thus providing results in the case of manifolds of dimension 7 or 8 which were missing from the results of Brin and Karcher.     

Computation of Almost Split Sequences with Applications to Relatively Projective and Prinjective Modules

Let be an Artin algebra, let mod be the category of finitely generated -modules, and let Amod be a contravariantly finite and extension closed subcategory. For an indecomposable and not Ext-projective module CA, we compute the almost split sequence 0ABC0 in A from the almost split sequence 0DTrCEC0 in mod. Since the computation is particularly simple if the minimal right A-approximation of DTrC is indecomposable for all indecomposable and not Ext-projective CA, we manufacture subcategories A with the desired property using orthogonal subcategories. The method of orthogonal subcategories is applied to compute almost split sequences for relatively projective and prinjective modules.     

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.     

Microwave frequency shifting using photon acceleration

Using a Bostick Gun as a plasma source, we have been investigating the effects of a moving plasma front on the frequency of an incident R.F. signal. We have been able to measure frequency shifts of 10 MHz frequency with a 2.6 GHz signal. The density is such that the plasma frequency is well above the transmitter frequency 1.3 meters from the plasma source. No magnetic field is used.     

Quasiperiodic motions in superquadratic time-periodic potentials

It is shown that for a large class of potentials on the line with superquadratic growth at infinity and with the additional time-periodic dependence all possible motions under the influence of such potentials are bounded for all time and that most (in a precise sense) motions are in fact quasiperiodic. The class of potentials includes, as very particular examples, the exponential, polynomial and much more. This extends earlier results and gives an answer to a problem posed by Littlewood in the mid 1960's. Along the way machinery is developed for estimating the action-angle transformation directly in terms of the potential and also some apparently new identities involving singular integrals are derived.     

Finding minimum areak-gons

Given a setP ofn points in the plane and a numberk, we want to find a polygon with vertices inP of minimum area that satisfies one of the following properties: (1) is a convexk-gon, (2) is an empty convexk-gon, or (3) is the convex hull of exactlyk points ofP. We give algorithms for solving each of these three problems in timeO(kn ³). The space complexity isO(n) fork=4 andO(kn ²) fork5. The algorithms are based on a dynamic programming approach. We generalize this approach to polygons with minimum perimeter, polygons with maximum perimeter or area, polygons containing the maximum or minimum number of points, polygons with minimum weight (for some weights added to vertices), etc., in similar time bounds.This paper includes work done while David Eppstein was at Columbia University, Department of Computer Science, and while Günter Rote and Gerhard Woeginger were at the Freie Universität Berlin, Fachbereich Mathematik, Institut für Informatik. Research was partially supported by the ESPRIT II Basic Research Actions Program of the EC under Contract No. 3075 (project ALCOM).