Surgery on 3-manifolds with \mathbb{S} 1-actions

We study the topological structure of all 3-manifolds obtained by surgery along principal fibers of a closed orientable -manifold. As a consequence, we give alternative proofs of some classical results due to W. Heil and L. Moser. Moreover, we completely specify the Seifert invariants for the considered manifolds. Finally we classify the manifolds obtained by surgery along certain Seifert links and determine geometric presentations of their fundamental groups.Work performed under the auspices of C.N.R. (National Research Council) of Italy and partially supported by Ministero della Ricerca Scientifica e Tecnologica within the projects Geometria Reale e Complessa and Topologia.     

On the products of cross-ratios on diagonals of polygons

The purpose of this paper is to establish a conjecture of B. Grünbaum, which states that in every n-polygon P in the plane, n 5, some diagonals intersect in a pattern that defines a new n-polygon (P), such that the product of the cross-rations on the diagonals of P is equal to the product of the corresponding cross-ratios on the diagonals of (P).     

There are uncountably many universal topological planes

We prove the existence of uncountably many nonisomorphic topological projective planes, each universal in the sense that it contains an isomorphic copy of every pseudoline arrangement.     

On the maximal length of two sequences of integers in arithmetic progressions with the same prime divisors

In this paper we consider an analogue of the problem of Erds and Woods for arithmetic progressions. A positive answer follows from theabc conjecture. Partial results are obtained unconditionally.     

Der Richtungsabstand

In the study of chemical structural phenomena, the idea of mixedness appears to provide most valuable information if this notion is understood as a quantity that counts for a natural distinction between more or less mixed situations. The search for such a concept was initiated by the need of a corresponding valuation of chemical molecules that differ in the type-composition of a system of varying molecular parts at given molecular skeleton sites. In other words, an order relation for the partitions of a finite set was sought that explains the extent of mixing in a canonical way. This and related questions led to the concepts of themixing character andmixing distance. Success in applying these concepts to further chemical and physical problems, to graph theory, to representation theory of the symmetric group, and to probability theory confirmed the hope that there is a common background in some basic mathematics that allows a systematic treatment.The expected concept summarizing the above-mentioned experience is called thedirection distance and the mathematics concerned is linear geometry with a normspecific metric or structural analysis of normed vector spaces, respectively. Direction distance is defined as a map that represents the total metric information on any pair of directions (= pair of half-lines with a common vertex or a corresponding figure in normed vector spaces). Generally, that metrical figure changes when the half-lines are interchanged. As a consequence thereof, Hilbert's congruence axioms do not permit a metric criterion for the congruence of angles except in particular cases. The metric figures of direction pairs, however, may be classified according to metric congruence, and the normspecific metric induces an order in the set of congruence classes. This order, as a rule, is partial; it proves to be total if and only if the vector spaces are (pre-) Hilbert spaces (Lemma 8). A thorough comparison of the direction distance with the conventional distance deepens the understanding of the novel concept and justifies the terminology. The results are summarized in a number of lemmata. Furthermore, so-calledd-complete systems of order-homomorphic functional (so-calledd-functionals) establish an alternative formulation of the direction distance order. If and only if the order is total,d-complete systems can be represented by singled-functionals. Consequently, the case that normed vector spaces are (pre-) Hilbert spaces is pinpointed by the fact that the negative scalar product is already ad-complete system. These particular circumstances allow a metric congruence relation for angles.Another family of normed vector spaces is traced out by the conditions under which the direction distance takes the part of the mixing distance. Roughly speaking, a subset of vectors may be viewed as representing mixtures if it has two properties. First, with any two vectors of this subset all positive linear combinations are vectors of it as well. Second, the length of these vectors is an additive property. Correspondingly, the definition of the mentioned family, the family of so-calledmc-spaces, is based on the concepts of ameasure cone (Def. 5 and Def. 5) and an associated class ofmc- (= measure cone)norms being responsible for length additivity ofpositive vectors (= vectors of the measure cone) (Def. 6). Such norms provide congruence classes for positive vectors and positive direction pairs marked by the propertieslength andmixing distance, respectively. These congruence classes do not depend on the choice of the particularmc-norm within the class associated with a given measure cone, however, the mixing distance does. The consistency of the stipulated mathematical instrumentarium becomes apparent with Theorem 1 stating: The mixing distanceorder doesnot depend on the choice of a particular norm within the measure cone specific class; this order, together with the stipulated length of positive vectors, are properties necessary and sufficient for fixing the measure cone specific class ofmc-norms.Decreasing (or constant) mixing distance was found to describe a characteristic change in the relation between two probability distributions on a given set of classical events, a change in fact necessary and sufficient for the existence of alinear stochastic operator that maps a given pair of distributions into another given pair. This physically notable statement was originally proved for the space ofL ¹-functions on a compact -interval, it was expected to keep its validity for probability distributions in the range of classical physics and, as a consequence of that, for measures of any type. Theorem 2 presents the said statement in terms ofmc-endomorphisms ofmc-spaces; after an extension of the original proof to a more general family ofL ¹-spaces another method presented in a separate paper confirms Theorem 2 for bounded additive set functions and, accordingly, secures the expected range of validity. The discussion below is without reference to the validity range and primarily devoted to geometrical consequences without detailed speculations about physical applications.A few remarks on applications, however, illustrate the physical relevance of the mixing distance and its specialization, theq-character, in the particular context of Theorem 2. With reference to measure cones with such physical interpretations as statistical systems,mc-endomorphisms effect changes that can be described by linear stochastic operators and result physically either from an approach to some equilibrium state or from an adoption to a time-dependent influence on the system from outside. Theorem 2 provides a necessary and sufficient criterion for such changes. The discussion may concern phenomena of irreversible thermodynamics as well as evolving systems under the influence of a surrounding world summarized asorganization phenomena. Entropies and relative entropies of the Renyi-type ared-functionais which do not establishd-complete systems. The validity of Theorem 2 does not encompass the nonclassical case; the reason for it is of high physical interest. The full range of validity and its connection with symmetry arguments seems a promising mathematical problem in the sense of Klein'sErlanger Programm. From the point of mathematical history, the Hardy-Littlewood-Polya theorem should be quoted as a very special case of Theorem 2.

     

Modular curves and Poncelet polygons

Parts of the results and the essential techniques of this note are taken from the Erlangen thesis (1991) of the second author. They were circulated as Nr. 122 of Schriftenreihe Komplexe Mannigfaltigkeiten. Our research was supported by DFG grant Ba 423/3-3 and the European Science Project Geometry of Algebraic Varieties SCI-0398-C(A)     

Local analyticity for the [`(?)]\overline \partial -Neumann problem in completely decoupled pseudoconvex domains-Neumann problem in completely decoupled pseudoconvex domains

In this paper we prove local analyticity of solutions to the -Neumann problem up to the boundary of rigid, completely decoupled pseudoconvex domains with real-analytic boundary. These are domains that are locally of the form Imw > Σ |h _k (z _k )|² with eachh _k holomorphic and vanishing only at 0. As in those earlier papers, we use purelyL ² methods and must construct a special holomorphic vector fieldM and then use carefully balanced polynomials inM to localize high powers ofT = ∂/∂t effectively, wheret = Rew.     

Unique continuation theorems for the\bar \partial - Operator and applications

We formulate a unique continuation principle for the inhomogeneous Cauchy-Riemann equations near a boundary pointz ₀ of a smooth domain in complex euclidean space. The principle implies that the Bergman projection of a function supported away fromz ₀ cannot vanish to infinite order atz ₀ unless it vanishes identically. We prove that the principle holds in planar domains and in domains where the problem is known to be analytic hypoelliptic. We also demonstrate the relevance of such questions to mapping problems in several complex variables. The last section of the paper deals with unique continuation properties of the Szegő projection and kernel in planar domains. Research supported by NSF Grant DMS-8922810.     

Alternating iteration and elliptic variational inequalities

Summary Free boundary value problems, too complicated for formulation as a variational inequality, are broken up into two problems on overlapping regions. On one region the problem is treated as an ordinary boundary value problem; on the second region, the free boundary part of the problem is reduced to a variational inequality. By solving the two problems successively it is shown that under certain conditions the successive solutions converge to a single function that gives a solution of the original problem. Application to a filtration problem is given.     

Calculs de complexité relatifs à une méthode de dissection emboîtée

Résumé Nous présentons une numérotation de type Nested Dissection des inconnues d'un système linéaireAX=B pour des ensembles de matricescreuses symétriques définies positives correspondant à des famille de graphes non orientés,à degré borné, et admettant un -thérème de séparation. Comparativement aux méthodes et résultats de Rose [9], l'algorithme présenté est plus simple, mais les théorèmes de complexité moins généraux, en raison de l'hypothèse restrictive de degré borné. En outre, les démonstrations font appel en permanence à la structure d'arbre sur la famille des séparateurs qui constitue, par ailleurs, une partition de l'ensemble des sommets du graphe initial. Nous présentons ensuite le schéma général d'implémentation dans le cadre du code d'éléments finis MODULEF pourdes problèmes plans d'éléments finis, et nous donnons quelques mesures comparatives avec la numérotation plus classique qui tend à minimiser le profil de la matrice.

---

Complexity bounds for a nested dissection method

Summary A nested dissection ordering is given for solving any system of linear equationsAX=B, for the family ofsparse symmetric positive definite matrices corresponding to the class of undirected graphs withbounded degree, and satisfyinga -separator theorem. If we compare the methods and results presented by Rose [9], our algorithm is more simple, but the complexity results are less general because of the restriction of bounded degree. Besides, our proofs use continually the arborescent structure on the family of separators, which is, by another way, a partition of the set of vertices for the initial graph. Then, the general implementation scheme in the finite element package MODULEF, fortwo-dimensional finite element problems, is presented, and numerical comparisons between our ordering and the standard envelope method are given.