The complexity of many cells in arrangements of planes and related problems

We consider several problems involving points and planes in three dimensions. Our main results are: (i) The maximum number of faces boundingm distinct cells in an arrangement ofn planes isO(m ^2/3 n logn +n ²); we can calculatem such cells specified by a point in each, in worst-case timeO(m ^2/3 n log³ n+n ² logn). (ii) The maximum number of incidences betweenn planes andm vertices of their arrangement isO(m ^2/3 n logn+n ²), but this number is onlyO(m ^3/5– n ^4/5+2 +m+n logm), for any>0, for any collection of points no three of which are collinear. (iii) For an arbitrary collection ofm points, we can calculate the number of incidences between them andn planes by a randomized algorithm whose expected time complexity isO((m ^3/4– n ^3/4+3 +m) log² n+n logn logm) for any>0. (iv) Givenm points andn planes, we can find the plane lying immediately below each point in randomized expected timeO([m ^3/4– n ^3/4+3 +m] log² n+n logn logm) for any>0. (v) The maximum number of facets (i.e., (d–1)-dimensional faces) boundingm distinct cells in an arrangement ofn hyperplanes ind dimensions,d>3, isO(m ^2/3 n ^d/3 logn+n ^d–1). This is also an upper bound for the number of incidences betweenn hyperplanes ind dimensions andm vertices of their arrangement. The combinatorial bounds in (i) and (v) and the general bound in (ii) are almost tight.Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by NSF Grant CCR-8714565. Work by the third author has been supported by Office of Naval Research Grant N00014-87-K-0129, by National Science Foundation Grant DCR-82-20085, by grants from the Digital Equipment Corporation, and the IBM Corporation, and by a research grant from the NCRD—the Israeli National Council for Research and Development. An abstract of this paper has appeared in theProceedings of the 13th International Mathematical Programming Symposium, Tokyo, 1988, p. 147.     

Rückbezüge des Mathematikunterrichts und der Methodik des Mathematikunterrichts in der DDR auf historische Vorausentwicklungen

The author discusses at some examples exemplarily, how the pedagogy of mathematics education in the GDR from curricular and educational/psychological knowledge from the time before 1945 has developed scientifically.     

Symmetric incidence groupoids

In [7] point-reflection geometries were studied which can be derived from commutative kinematic spaces without involutory elements. But the class of point-reflection geometries is larger. For example, elliptic planes with their reflections cannot be derived from commutative kinematic spaces. Here we investigate a larger class of reflection geometries.This paper was sponsored by Vigoni Program 1999.     

Scale Invariance of the PNG Droplet and the Airy Process

We establish that the static height fluctuations of a particular growth model, the PNG droplet, converges upon proper rescaling to a limit process, which we call the Airy process A(y). The Airy process is stationary, it has continuous sample paths, its single time (fixed y) distribution is the Tracy–Widom distribution of the largest eigenvalue of a GUE random matrix, and the Airy process has a slow decay of correlations as y ^–2. Roughly the Airy process describes the last line of Dyson's Brownian motion model for random matrices. Our construction uses a multi-layer version of the PNG model, which can be analyzed through fermionic techniques. Specializing our result to a fixed value of y, one reobtains the celebrated result of Baik, Deift, and Johansson on the length of the longest increasing subsequence of a random permutation.     

Ethanol-induced conformational fluctuations of NMDA receptors

Alcohol addiction ranks among the leading global causes of preventable death and disabilities in human population. Understanding the sites of ethanol action that mediate its acute and chronic neural and behavioural effects is critical to develop appropriate treatment options for this disorder. The N-methyl-d-asparate (NMDA) receptors are ligand-gated heterotetrameric ion channels, which are known to directly interact with alcohol in a concentration-dependent manner. Yet, the exact molecular mechanisms and conformational dynamics of this interaction are not well understood. Here, we conducted a series of molecular dynamics simulations of the interaction of moderate ethanol concentrations with rat's wild-type GluN1–GluN2B NMDA Receptor under physiological conditions. The simulations suggest that glutamate or glycine alone induce an intermediate conformational state and point towards the transmembrane domain (TMD) as the site of action of ethanol molecules. Ethanol interacts by double hydrogen bonds with Trp635 and Phe638 at the transmembrane M3 helix of GluN2B. Alcohol not only reduces the pore radius of the ion channel within the TMD but also decreases accessibility of glutamate and glycine to the ligand-binding sites by altering the structure of the ligand-binding domain and significantly widening the receptor in that area.     

Reaction-diffusion problems in electrolysis

Supported in part by Schweizerischer Nationalfonds (20-25263.88) and European Community (Science Plan, Project Evolutionary Systems)