Quasi-planar graphs have a linear number of edges

A graph is calledquasi-planar if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph withn vertices isO(n).Work on this paper by Pankaj K. Agarwal, Boris Aronov and Micha Sharir has been supported by a grant from the U.S.-Israeli Binational Science Foundation. Work on this paper by Pankaj K. Agarwal has also been supported by NSF Grant CCR-93-01259, by an Army Research Office MURI grant DAAH04-96-1-0013, by an NYI award, and by matching funds from Xerox Corporation. Work on this paper by Boris Aronov has also been supported by NSF Grant CCR-92-11541 and by a Sloan Research Fellowship. Work on this paper by János Pach, Richard Pollack, and Micha Sharir has been supported by NSF Grants CCR-91-22103 and CCR-94-24398. Work by János Pach was also supported by Grant OTKA-4269 and by a CUNY Research Award. Work by Richard Pollack was also supported by NSF Grants CCR-94-02640 and DMS-94-00293. Work by Micha Sharir was also supported by NSF Grant CCR-93-11127, by a Max-Planck Research Award, and by grants from the Israel Science Fund administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development. Part of the work on this paper was done during the participation of the first four authors in the Special Semester on Computational and Combinatorial Geometry organized by the Mathematical Research Institute of Tel Aviv University, Spring 1995.     

BOOK REVIEWS

Book reviewed in this article: Beloved Scientist , by David O. Woodbury. Physics , A Textbook for Colleges , by Oscar M. Stewart. Modern Physics , by Charles E. Dull. Experiments in Organic Chemistry , by E. Wertheim. Dynamical Analogies , by Harry F. Olson, E.E., Ph.D. A Peimer of Electronics , by Don P. Caverly. Applied Mechanics and Heat , by L. Raymond Smith. An Elementary Course in Qualitative Analysis , by William Lloyd Evans, Jesse Erwin Day, and Alfred Benjamin Garrett. Fundamentals of Machines , by John A. Clark. Fundamentals of Machines , by Charles E. Dull. Algebra (Mathematics for Technical Training ), by Paul L. Evans. Geometry with Military and Naval Applications , by Willis F. Kern and James R. Bland. Plane Trigonometry with Tables , by Paul L. Evans. Elementary Applied Electricity , by L. Raymond Smith. Fundamentals of Electricity , Based on Material Developed for the Teaching of Learners and Apprentices of the Carnegie -Illinois Steel Corporation . Rewritten to Conform to the Preinduction Training Course in Fundamentals of Electricity as Prepared by the War Department . Fundamental Jobs in Electricity , by Edgar C. Perry, A. M. and Harry V. Schafebook.     

Intrinsic regular submanifolds in Heisenberg groups are differentiable graphs

We characterize intrinsic regular submanifolds in the Heisenberg group as intrinsic differentiable graphs. G. Arena is supported by MIUR (Italy), by INDAM and by University of Trento. R. Serapioni is supported by MIUR (Italy), by GALA project of the Sixth Framework Programme of European Community and by University of Trento.     

Symmetry Reductions of the Combined KdV—mKdV Equation

ＳｙｍｍｅｔｒｙＲｅｄｕｃｔｉｏｎｓｏｆｔｈｅＣｏｍｂｉｎｅｄＫｄＶ－ｍＫｄＶＥｑｕａｔｉｏｎＺｈａｎｇＪｉｅｆａｎｇ（张解放）；ＸｕＸｕｅｊｕｎ（许学军）；ＣｈｅｎｇＤｅｓｈｅｎｇ（程德声）（ＤｅｐａｒｔｍｅｎｔｏｆＰｈｙｓｉｃｓ，Ｚｈｅｊｉａｎｇ...     

带干扰的Erlang(2)过程

本篇论文主要讨论带干扰的E rlang(2)过程,首先通过指数分布的可加性来推得生存概率所满足的积分微分方程,进而得到破产概率(由干扰引起和由索赔引起)所满足的积分微分方程,最后得到破产概率的拉氏变换所满足的方程.     

On Solvability of Lie Rings with an Automorphism of Finite Order

A new criterion for a Lie ring with a semisimple automorphism of finite order to be solvable is proved. It generalizes the effective version of Winter's criterion obtained earlier by Khukhro and Shumyatsky and by Bergen and Grzeszczuk in replacing the ideal generated by a certain set by the subring generated by this set. The proof is inspired by the original theorem of Kreknin on solvability of Lie rings with regular automorphisms of finite order and is conducted mostly in terms of Lie rings graded by a finite cyclic group.     

An elementary approach to lower bounds in geometric discrepancy

For eachd≥2, it is possible to placen points ind-space so that, given any two-coloring of the points, a half-space exists within which one color outnumbers the other by as much ascn ^1/2−1/2d , for some constantc>0 depending ond. This result was proven in a slightly weaker form by Beck and the bound was later tightened by Alexander. It was recently shown to be asymptotically optimal by Matoušek. We present a proof of the lower bound, which is based on Alexander's technique but is technically simpler and more accessible. We present three variants of the proof, for three diffrent cases, to provide more intuitive insight into the “large-discrepancy” phenomenon. We also give geometric and probabilistic interpretations of the technique. Work by Bernard Chazelle has been supported in part by NSF Grant CCR-90-02352 and The Geometry Center, University of Minnesota, an STC funded by NSF, DOE, and Minnesota Technology, Inc. Work by Jiří Matoušek has been supported by Charles University Grant No. 351, by Czech Republic Grant GAČR 201/93/2167 and in part by DIMACS. Work by Micha Sharir has been supported by NSF Grant CCR-91-22103, by a Max-Planck Research Award, and by grants from the U.S.-Israeli Binational Science Foundation, the Fund for Basic Research administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development.     

On the covering relation in the interpretability lattice of equational theories

We prove that the chapter in the interpretability lattice represented by the equational theory of Boolean algebras has a unique cover in the lattice. We conjecture that, among chapters represented by equational theories of two-element algebras, this is the only one to have a cover. Also, we prove that the chapter represented by the equational theory of Abelian groups has no cover.Presented by W. Taylor.Research supported by a Ulam Research Professorship at the University of Colorado and by NSF Grant DMS 89 04014.     

Dynamic instability of a non-uniform beam modeled in a two-degree-of-freedom system

The behaviour of a non-uniform beam loaded by a parallel or tangential compressive force respectively is analyzed by exploiting a two-degree-of-freedom dynamic model. The same system has been analyzed previously by Lee and Reissner from a static point of view and by Neer and Baruch by a dynamic approach using a one-degree-of-freedom model. The previous analyses revealed only part of the phenomena by the present approach.Here, for the tangential force a classical flutter instability is obtained and for the parallel force only static instability is possible.     

“运价”为负的运输模型计算机求解问题的处理

为解决一些计算机软件求解"运价"既有正值又有负值运输模型时"不可求解"的问题,本文采用"运价同额增减法"决策模型转换的方法,将原模型的"运价"全部转换为正值后再用计算机软件求解,并分别编写了EXCEL求解模板和求解程序对该方法的计算加以印证。结果表明,采用该方法求解得出的最优解(最优决策方案)与原模型求得的最优解完全一样,而最优值(最优决策效果)减去虚增(或加上虚减)的部分就是原模型的最优值。采用这种方法能成功地解决一些计算机软件"不可求解"的问题。     

Asymptotic expansions for Markov processes with lévy generators

This paper considers a deterministic flow inn-dimensional space, perturbed by a Markov jump process with small variance. Asymptotic expansions are obtained for certain functionals of Feynman—Kac type, in powers of a small parameter representing a noise intensity. The methods are analytical rather than probabilistic.The research of the first author was partly supported by AFOSR under Contract No. 91-0116-0, by ONR under Contract No. N0014-83-K-0542, and by the Institute for Mathematics and Its Applications with funds provided by the NSF and ONR. The second author's research was partly supported by NSF under Contract No. DMS-8702537, and by the Institute for Mathematics and Its Applications with funds provided by the NSF and ONR.     

Realizability of words in mosaic labyrinths

In this paper we study mosaic labyrinths with the help of words generated by them in the alphabet of labels attached to arcs and vertices of a labyrinth. We consider the problem of the characterization of words generated by a labyrinth. We propose a constructive recognition criterion, it defines whether a word is generated by a labyrinth or not. We establish conditions under which a word can be generated by a unique labyrinth, by a finite number of labyrinths, or by infinitely many labyrinths.     

A five facets frame for the design of heuristics

The author suggested to distinguish between the ‘engineering approach’ and the ‘mathematical approach’ in connection with the design of heuristics. Stainton and Papoulias extended the scope by suggesting the ‘relational approach’. Based upon this extension, a five facets frame is presented here which is suggested to precede and accompany the ‘technical’ design of the heuristic. The facets are: coverage by participation, experience by doing, abstraction by structuring, extension by comparison, exploration by creativity.     

Solving combinatorial optimization problems using Karmarkar's algorithm

We describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem.Computational facilities provided by the Cornell Computational Optimization Project supported by NSF Grant DMS-8706133 and by the Cornell National Supercomputer Facility. The Cornell National Supercomputer Facility is a resource of the Center for Theory and Simulation in Science and Engineering at Cornell Unversity, which is funded in part by the National Science Foundation, New York State, and the IBM Corporation. The research of both authors was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by ONR Grant N00014-90-J-1714.Research partially supported by NSF Grant ECS-8602534 and by ONR Contract N00014-87-K-0212.     

Fibrations by nonsmooth genus three curves in characteristic three

Bertini’s theorem on variable singular points may fail in positive characteristic, as was discovered by Zariski in 1944. In fact, he found fibrations by nonsmooth curves. In this work we continue to classify this phenomenon in characteristic three by constructing a two-dimensional algebraic fibration by nonsmooth plane projective quartic curves, that is universal in the sense that the data about some fibrations by nonsmooth plane projective quartics are condensed in it. Our approach has been motivated by the close relation between it and the theory of regular but nonsmooth curves, or equivalently, nonconservative function fields in one variable. Actually, it also provides an understanding of the interesting effect of the relative Frobenius morphism in fibrations by nonsmooth curves. In analogy to the Kodaira-Néron classification of special fibers of minimal fibrations by elliptic curves, we also construct the minimal proper regular model of some fibrations by nonsmooth projective plane quartic curves, determine the structure of the bad fibers, and study the global geometry of the total spaces.     

Schrödinger Operator Perturbed by Operators Related to Null Sets

We discuss the Schrödinger operator with positive singular perturbations given by operators which act in the space constructed by a positive measure supported by a null set. We construct examples when perturbations are given by the one-dimensional Laplacian on a segment.     

Book Reviews

Book reviewed in this article: Selected titles: Let's-Read-And-Find-Out Science Books, Thomas Y. Caves by Roma Gans, illustrated by Giulio Maestro. Little Dinosaurs And Early Birds, written and illustrated by John Kaufmann How Many Teeth by Paul Showers, illustrated by Paul Galdone. Bees And Beelines by Judy Hawes, illustrated by Aliki. Ducks Don't Get Wet by Augusta Golden, illustrated by Leonard Kessler. Look At Your Eyes by Paul Showers, illustrated by Paul Galdone. The Skeleton Inside You by Philip Balestrino, illustrated by Don Bolognese. What Happens To A Hamburger by Paul Showers, illustrated by Anne Rockwell.     

On rank vs. communication complexity

This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.A preliminary version of this paper appeared in [10].This work was supported by USA-Israel BSF grant 92-00043 and by a Wolfeson research award administered by the Israeli Academy of Sciences.This work was supported by USA-Israel BSF grant 92-00106 and by a Wolfeson research award administered by the Israeli Academy of Sciences.     

A New Characterization of the Mathieu Groups and Alternating Groups with Degrees Primes

In the past thirty years, several kinds of quantitative characterizations of finite groups especially finite simple groups have been investigated by many mathematicians. Such as quantitative characterizations by group order and element orders, by element orders alone, by the set of sizes of conjugacy classes, by dimensions of irreducible characters, by the set of orders of maximal abelian subgroups and so on. Here the authors continue this topic in a new area tending to characterize finite simple groups with given orders by some special conjugacy class sizes, such as largest conjugacy class sizes, smallest conjugacy class sizes greater than 1 and so on.     

BOOK REVIEWS

Book reviewed in this article: Electronics : Today and Tomorrow , by John Mills. General Physics , A Textbook for Colleges , by Oswald Blackwood, Ph.D. Essentials of Astronomy , by John Charles Duncan, Ph.D. Basic Air Navigation , by Eibert F. Blackburn. How to Pass Radio License Examinations , by Charles E. Drew. Introductory Astronomy , A Guide for Night Watchers , by J. B. Sidgwick. Plane and Spherical Trigonometry , by Donald H. Ballou, Ph.D. and Frederick, H. Steen, Ph.D. How to Pass a Written Examination , by Harry C. McKown. Military Applications of Mathematics , by Paul P. Hanson, M.A. Calculus Refresher for Technical Men , by Albert Klaf, B.S., M.E. Mathematics for Aircraft Engine Mechanics , by Harold Griffiths. Essentials of Business Arithmetic , Revised Edition, by Edward M. Kanzer. Mathematics for the Emergency , a text-workbook in essential mathematics. By C. J. Lapp. Liberal Education , by Mark Van Doren.