DOCSLIB.ORG

Lecture Notes in Computer Science 555 (1991), 108 123

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture Notes in Computer Science 555 (1991), 108 123 ACKNOWLEDGMENTS 99 Acknowledgments MANY PEOPLE provided considerable help to the author as these notes were being prepared, notably Eli Goodman, Leo Guibas, Ricky Pollack, Jfirgen Richter-Gebert, David Satesin, Raimund Seidel, Bernd Sturmfels, Frances Yao, and Gfinter Ziegler. Special thanks are also due to Phyllis Winkler, who transformed more than 150 pages of scribbled manuscript into a respectable-looking scientific document. Some of the research was done during a visit to the Institute of Systems Science at the University of Singapore; the work was completed during a visit to Institut Mittag-Lemer in Djursholm, Sweden. @ 100 AXIOMS AND HULLS Bibliography [1] E. al-Aamily, A. O. Morris, and M. H. Peel, "The representations of the Weyl groups of type Bn," Journal of Algebra 68 (1981), 298-305. Cited on page 17. [2] Cecilia R. Aragon and Raimund G. Seidel, "Randomized search trees" (ex- tended abstract), 30th IEEE Symposium on Foundations of Computer Science (1989), 540-546. Cited on page 53. [3] Marshall Bern, David Eppstein, Paul Plassman, and Frances Yao, "Horizon theorems for lines and polygons," in Discrete and Computational Geometry: Papers from the DIMACS Special Year, edited by Jacob E. Goodman, Richard Pollack, and William Steiger, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6 (1991), 45-66. Cited on page 96. [4] Marshall Bern, personal communication, January 1991. Cited on page 97. [5] Anders BjSrner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and G/inter M. Ziegler, Oriented Matroids, Encyclopedia of Mathematics Series, Cam- bridge University Press (1992). Cited on page 97. [6] Robert G. Bland and Michel Las Vergnas, "Orientability of matroids," Journal of Combinatorial Theory B24 (1978), 94-123. Cited on pages 40, 95, 96, and 98. [7] J. Bokowski, G. Laffaille, and J. Richter-Gebert, "10 point oriented matroids and projective incidence theorems," in preparation. Cited on page 97. [8] J/irgen Bokowski, Jfirgen Richter, and Bernd Sturmfels, "Nonrealizability proofs in computational geometry," Discrete ~: Computational Geometry 5 (1990), 333-350. Cited on page 6. [9] J/irgen Bokowski and Bernd Sturmfels, "On the coordinatization of oriented matroids," Discrete & Computational Geometry 1 (1986), 293-306. Cited on page 95. [10] J/irgen Bokowski and Bernd Sturmfels; "An infinite family of minor-minimal nonrealizable 3-chirotopes," Mathematische Zeitschrift 200 (1989), 583-589. Cited on page 96. [11] Bernard Chazelle, Leonidas J. Guibas, and D. T. Lee, "The power of geometric duality," BIT 25 (1985), 76-90. Cited on page 96. [12] Kenneth L. Clarkson and Peter W. Shor, "Applications of random sampling in computational geometry, II," Discrete & Computational Geometry 4 (1989), 387-421. Cited on page 81. [13] B. Delaunay, "Neue Darstellung der geometrischen Krystallographie," Zeit- schrift f//r Kristallographie 84 (1932), 109 149; errata, 85 (1933), 332. Cited on page 69. [14] Andreas Dress, "Chirotops and oriented matroids: Diskrete Strukturen, alge- braische Methoden und Anwendungen," Bayreuther Mathematische Schriften 21 (1986), 14-68. Cited on page 95. BIBLIOGRAPHY 101 [15] Andreas Dress, Andr6 Dreiding, and Hans Haegi, "Classification of mobile molecules by category theory," in Symmetries and Properties of Non-Rigid Molecules, Proceedings of an International Symposium in Paris, France, 1-7 July 1982, edited by J. Maruani and J. Serre; Studies in Physical and Theo- retical Chemistry 23 (1983), 39-58. Cited on page 95. [16] P.H. Edelman and C. Greene, "Balanced tableaux," Advances in Mathematics 63 (1987), 42-99. Cited on page 35. [17] Herbert Edelsbrunner and Ernst Peter M/icke, "Simulation of Simplicity: A technique to cope with degenerate cases in geometric algorithms," Fourth An- nual ACM Symposium on Computational Geometry (1988), 118-133. Cited on page 59. [18] H. Edelsbrunner, J. O'Rourke, and R. Seidel, "Constructing arrangements of lines and hyperplanes with applications," SIAM Journal on Computing 15 (1986), 341- 363. Cited on page 96. [19] H. Edelsbrunner, R. Seidel, and M. Sharir, "On the zone theorem for hyper- plane arrangements," SIAM Journal of Computing, to appear. Preprint in New Results and New Trends in Computer Science, edited by Hermann Man- rer, Lecture Notes in Computer Science 555 (1991), 108 123. Cited on page 96. [20] Robert W Floyd, personal communication, February 1964. Cited on page 29. [21] Jon Folkman and Jim Lawrence, "Oriented matroids," Journal of Combinato- rim Theory B25 (1978), 199-236. Cited on pages 40, 43, and 96. [22] Steven Fortune, "Stable maintenance of point set triangulations in two dimen- sions," 30th IEEE Symposium on Foundations of Computer Science (1989), 494-499. Cited on pages 62 and 67. [23] Fred Galvin, personal communications, November 1991 and January 1992. Cited on page 15. [24] Michael R. Garey and David S. Johnson, Computers and Intractability (San Francisco: W. H. Freeman, 1979). Cited on page 20. [25] G6rard Gonzales-Sprinberg and Guy Laffaille, "Sur les arrangements simples de huit droites dans RP 2,'' Comptes Rendus de l'Acaddmie des Sciences, Sdrie I, 309 (1989), 341-344. Cited on page 97. [26] Jacob E. Goodman and Richard Pollack, "On the combinatorial classification of nondegenerate configurations in the plane," Journal of Combinatorial The- ory A29 (1980), 220-235. Cited on page 94. [27] Jacob E. Goodman and Richard Pollack, "Proof of Grilnbaum's conjecture on the stretchability of certain arrangements of pseudolines," Journal of Combi- natorial Theory A29 (1980), 385-390. Cited on pages 94 and 96. [28] Jacob E. Goodman and Richard Pollack, "A theorem of ordered duality," Ge- ometri~e Dedicata 12 (1982), 63-74. Cited on page 94. [29] Jacob E. Goodman and Richard Pollack, "Multidimensional sorting," SIAM Journal on Computing 12 (1983), 484-507. Cited on pages 46 and 94. 102 AXIOMS AND HULLS [30] Jacob E. Goodman and Richard Pollack, "Semispaces of configurations, cell complexes of arrangements," Journal of Combinatorial Theory A37 (1984), 257 293. Cited on pages 35 and 94. [31] Jacob E. Goodman and Richard Pollack, "Upper bounds for configurations and polytopes in Rd, '' Discrete 35 Computational Geometry 1 (1986), 219- 227. Cited on pages 40 and 96. [32] Jacob E. Goodman and Richard Pollack, "Allowable sequences and order types in discrete and computational geometry," New Trends in Discrete and Com- putational Geometry, edited by J. Pach (Springer-Verlag, 1992), to appear. Cited on page 94. [33] Ronald L. Graham, Donald E. Knuth, Oren Patashnik, Concrete Mathematics (Reading, Mass.: Addison-Wesley, 1989). Cited on page 14. [34] Branko Griinbaum, Convex Polytopes (London Interscience, 1967). Cited on pages 94 and 98. [35] Branko Griinbaum, Arrangements and Spreads. Conference Board of the Mathematical Sciences, Regional Conference Series in Mathematics, Volume 10 (Providence, RI: American Mathematical Society, 1972). Cited on pages 34 and 94. [36] Leonidas J. Guibas, Donald E. Knuth, and Micha Sharir, "Randomized in- cremental construction of Delaunay and Voronoi diagrams," Algorithmica 7 (1992), 381 413. Abbreviated version in Automata, Languages and Program- ming, edited by M. S. Paterson, Lecture Notes in Computer Science 443 (1990), 414-431. Cited on pages 2, 3, 74, 77, and 80. [37] Leonidas Guibas, David Salesin, and Jorge Stolfi, "Constructing strongly con- vex approximate hulls with inaccurate primitives," Algorithmica, to appear. Abbreviated version in Proceedings of the International Symposium on Algo- rithms SIGAL 90, edited by T. Asano, T. Ibaraki, H. Imai, and T. Nishizeki, Lecture Notes in Computer Science 450 (1990), 261 270. Cited on page 67. [38] Leonidas Guibas and Jorge Stolfi, "Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams," ACM Transactions on Graphics 4 (1985), 74-123. Cited on pages v, 69, 72, and 97. [39] Lino Gutierrez Novoa, "On n-ordered sets and order completeness," Pacific Journal of Mathematics 15 (1965), 1337-1345. Cited on page 94. [40] Eric Richard Halsey, Zonotopal complexes on the d-cube, Ph.D. dissertation, University of Washington, Seattle, WA (1972). Cited on page 97. [41] Beat Jaggi, Peter Mani-Levitska, Bernd Sturmfels, and Neil White, "Uniform oriented matroids without the isotopy property," Discrete 35 Computational Geometry 4 (1989), 97-100. Cited on page 96. [42] J.W. Jaromczyk and G. W. Wasilkowski, "Numerical stability of a convex hull algorithm for simple polygons," University of Kentucky technical report 177-90 (1990), 18 pp. Cited on page 67. BIBLIOGRAPHY 103 [43] Arne Jonassen and Donald E. Knuth, "A trivial algorithm whose analysis isn't," Journal of Computer and System Sciences 16 (1978), 301-322. Cited on page 55. [44] Mikhail H. Klin, Serge S. Tratch, and Nikolai S. Zefirov, "2D-configurations and clique-cyclic orientations of the graphs L(Kp)," Reports in Molecular The- ory 1 (1990), 149-163. Cited on page 97. [45] Donald E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching (Reading, MA: Addison-Wesley, 1973). Cited on pages 29 and 47. [46] Donald E. Knuth, "Two notes on notation," American Mathematical Monthly 99 (1992), 403-422. Cited on page 14. [47] Donald E. Knuth, The Stanford GraphBase, book in preparation. Cited on page 53. [48] Michel Las Vergnas, "Bases in oriented matroids," Journal of Combinatorial Theory B25 (1978), 283 289. Cited on pages 3, 40, and 95. [49] Michel Las Vergnas, "Convexity in oriented matroids," Jo,lrnal of Combinato- rial Theory B29 (1980), 231 243. Cited on page 96. [50] Alain Lascoux and Marcel-Panl Schiitzenberger, "Structure de Hopf de l'annean de cohomologie et de l'anneau de Grothendieck d'une vari6t~ de dra- peaux," Comptes Rendus des sdances de l'Acaddmie des Sciences, S~rie I, 295 (1982), 629 633. Cited on page 35. [51] Jim Lawrence, "Oriented matroids and multiply ordered sets," Linear Algebra and Its Applications 48 (1982), 1 12. Cited on pages 3 and 95. [52] F. Levi, "Die Teilung der projektiven Ebene durch Gerade oder Pseudo- gerade," Berichte fiber die Verhandlungen der ss Akademie der Wissenschaften, Leipzig, Mathematisch-physische Klasse 78 (1926), 256 267.
Load more

Recommended publications
  • Computations in Algebraic Geometry with Macaulay 2
    Computations in algebraic geometry with Macaulay 2 Editors: D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels Preface Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re- cently developed algorithms have made theoretical aspects of the subject accessible to a broad range of mathematicians and scientists. The algorith- mic approach to the subject has two principal aims: developing new tools for research within mathematics, and providing new tools for modeling and solv- ing problems that arise in the sciences and engineering. A healthy synergy emerges, as new theorems yield new algorithms and emerging applications lead to new theoretical questions. This book presents algorithmic tools for algebraic geometry and experi- mental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. A wide range of mathematical scientists should find these expositions valuable. This includes both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all.
    [Show full text]
  • Prizes and Awards Session
    PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes ....................................................................................................................
    [Show full text]
  • Arxiv:2010.06953V2 [Math.RA] 23 Apr 2021
    IDENTITIES AND BASES IN THE HYPOPLACTIC MONOID ALAN J. CAIN, ANTÓNIO MALHEIRO, AND DUARTE RIBEIRO Abstract. This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the hypoplactic monoid of rank 2. This confirms that all hypoplactic monoids of rank greater than or equal to 2 satisfy exactly the same identities. We then give a complete characterization of those identities, and prove that the variety generated by the hypoplactic monoid has finite axiomatic rank, by giving a finite basis for it. 1. Introduction A (non-trivial) identity is a formal equality u ≈ v, where u and v are words over some alphabet of variables, which is not of the form u ≈ u. If a monoid is known to satisfy an identity, an important question is whether the set of identities it satisfies is finitely based, that is, if all these identities are consequences of those in some finite subset (see [37, 42]). The plactic monoid plac, also known as the monoid of Young tableaux, is an important algebraic structure, first studied by Schensted [38] and Knuth [23], and later studied in depth by Lascoux and Schützenberger [27]. It is connected to many different areas of Mathematics, such as algebraic combinatorics, symmetric functions [29], crystal bases [4] and representation theory [14]. In particular, the question of identities in the plactic monoid has received a lot of attention recently [26, 20]. Finitely-generated polynomial-growth groups are virtually nilpotent and so sat- isfy identities [16].
    [Show full text]
  • Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone
    Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone: (510) 642 4687, Fax: (510) 642 8204, [email protected] M.A. [Diplom] TH Darmstadt, Germany, Mathematics and Computer Science, 1985 Ph.D. [Dr. rer. nat.] TH Darmstadt, Germany, Mathematics, 1987 Ph.D. University of Washington, Seattle, Mathematics, 1987 Professional Experience: 1987–1988 Postdoctoral Fellow, I.M.A., University of Minnesota, Minneapolis 1988–1989 Assistant Professor, Research Institute for Symbolic Computation, (RISC-Linz), Linz, Austria 1989–1991 Assistant Professor, Department of Mathematics, Cornell University 1992–1996 Associate Professor, Department of Mathematics, Cornell University 1994–2001 Professor, Department of Mathematics, University of California, Berkeley 2001– Professor, Department of Mathematics and Computer Science, UC Berkeley Academic Honors: 1986 - 1987 Alfred P. Sloan Doctoral Dissertation Fellowship 1991 - 1993 Alfred P. Sloan Research Fellow 1992 - 1997 National Young Investigator (NSF) 1992 - 1997 David and Lucile Packard Fellowship 1999 Lester R. Ford Prize for Expository Writing (MAA) 2000-2001 Miller Research Professorship, UC Berkeley Spring 2003 John von Neumann Professor, Technical University M¨unchen 2003-2004 Hewlett-Packard Research Professor at MSRI Berkeley July 2004 Clay Mathematics Institute Senior Scholar Research Interests: Computational Algebra, Combinatorics, Algebraic Geometry Selected Professional Activities: Visiting Positions: D´epartment de Math´ematiques, Universit´ede Nice, France, Spring 1989 Mathematical Sciences Research Institute, Berkeley, Fall 1992 Courant Institute, New York University, 1994–95 RIMS, Kyoto University, Japan, 1997–98 Current Editorial Board Membership: Journal of the American Mathematical Society, Duke Mathematical Journal, Collecteana Mathematica, Beitr¨agezur Geometrie und Algebra, Order, Discrete and Computational Geometry, Applicable Algebra (AAECC) Journal of Combinatorial Theory (Ser.
    [Show full text]
  • April 2017 Table of Contents
    ISSN 0002-9920 (print) ISSN 1088-9477 (online) of the American Mathematical Society April 2017 Volume 64, Number 4 AMS Prize Announcements page 311 Spring Sectional Sampler page 333 AWM Research Symposium 2017 Lecture Sampler page 341 Mathematics and Statistics Awareness Month page 362 About the Cover: How Minimal Surfaces Converge to a Foliation (see page 307) MATHEMATICAL CONGRESS OF THE AMERICAS MCA 2017 JULY 2428, 2017 | MONTREAL CANADA MCA2017 will take place in the beautiful city of Montreal on July 24–28, 2017. The many exciting activities planned include 25 invited lectures by very distinguished mathematicians from across the Americas, 72 special sessions covering a broad spectrum of mathematics, public lectures by Étienne Ghys and Erik Demaine, a concert by the Cecilia String Quartet, presentation of the MCA Prizes and much more. SPONSORS AND PARTNERS INCLUDE Canadian Mathematical Society American Mathematical Society Pacifi c Institute for the Mathematical Sciences Society for Industrial and Applied Mathematics The Fields Institute for Research in Mathematical Sciences National Science Foundation Centre de Recherches Mathématiques Conacyt, Mexico Atlantic Association for Research in Mathematical Sciences Instituto de Matemática Pura e Aplicada Tourisme Montréal Sociedade Brasileira de Matemática FRQNT Quebec Unión Matemática Argentina Centro de Modelamiento Matemático For detailed information please see the web site at www.mca2017.org. AMERICAN MATHEMATICAL SOCIETY PUSHING LIMITS From West Point to Berkeley & Beyond PUSHING LIMITS FROM WEST POINT TO BERKELEY & BEYOND Ted Hill, Georgia Tech, Atlanta, GA, and Cal Poly, San Luis Obispo, CA Recounting the unique odyssey of a noted mathematician who overcame military hurdles at West Point, Army Ranger School, and the Vietnam War, this is the tale of an academic career as noteworthy for its o beat adventures as for its teaching and research accomplishments.
    [Show full text]
  • Curriculum Vitae
    Paul Breiding | Curriculum Vitae Max-Planck-Institute for Mathematics in the Sciences, Inselstr. 22, 04103 Leipzig, Germany Q [email protected] • paulbreiding.org • PBrdng u Paul Breiding • 7 @_pbrdng • born 12th of May 1988, german citizenship Max-Plack-Institute for Mathematics in the Sciences Leipzig Head of Emmy Noether Research Group: Numerical and Probabilistic Nonlinear Algebra Since 04/2021 University of Kassel Substitute Professor for Computeralgebra 11/2020 – 03/2021 Akademie der Wissenschaften und der Literatur Mainz Member of the Junge Akademie 04/2020 – 03/2024 Parental leave 7 months in total 10/2019 – 11/2019 and 04/2020 – 10/2020 Technische Universität Berlin Postdoctoral researcher in the algorithmic algebra research group 04/2019 – 10/2020 Max-Plack-Institute for Mathematics in the Sciences Leipzig Postdoctoral researcher in the nonlinear algebra research group 10/2017 – 03/2019 Technische Universität Berlin PhD student with Prof. Dr. Bürgisser 12/2013 – 09/2017 Date of thesis defense: July 25, 2017. Evaluation ’summa cum laude’. Simons Institute for the Theory of Computing Visiting graduate student 08/2014 – 10/2014 Algorithms and Complexity in Algebraic Geometry Education Georg-August-Universität Göttingen Master of Science 10/2011 – 11/2013 Evaluation: excellent. Universidad de Sevilla Undergraduate studies, part of the Erasmus exchange program 02/2011 – 09/2011 Georg-August Universität Göttingen Bachelor of Science 10/2008 – 09/2011 Languages........................................................................................................................
    [Show full text]
  • Lectures on Algebraic Statistics
    Lectures on Algebraic Statistics Mathias Drton, Bernd Sturmfels, Seth Sullivant September 27, 2008 2 Contents 1 Markov Bases 7 1.1 Hypothesis Tests for Contingency Tables . 7 1.2 Markov Bases of Hierarchical Models . 17 1.3 The Many Bases of an Integer Lattice . 26 2 Likelihood Inference 35 2.1 Discrete and Gaussian Models . 35 2.2 Likelihood Equations for Implicit Models . 46 2.3 Likelihood Ratio Tests . 54 3 Conditional Independence 67 3.1 Conditional Independence Models . 67 3.2 Graphical Models . 75 3.3 Parametrizations of Graphical Models . 85 4 Hidden Variables 95 4.1 Secant Varieties in Statistics . 95 4.2 Factor Analysis . 105 5 Bayesian Integrals 113 5.1 Information Criteria and Asymptotics . 113 5.2 Exact Integration for Discrete Models . 122 6 Exercises 131 6.1 Markov Bases Fixing Subtable Sums . 131 6.2 Quasi-symmetry and Cycles . 136 6.3 A Colored Gaussian Graphical Model . 139 6.4 Instrumental Variables and Tangent Cones . 143 6.5 Fisher Information for Multivariate Normals . 150 6.6 The Intersection Axiom and Its Failure . 152 6.7 Primary Decomposition for CI Inference . 155 6.8 An Independence Model and Its Mixture . 158 7 Open Problems 165 4 Contents Preface Algebraic statistics is concerned with the development of techniques in algebraic geometry, commutative algebra, and combinatorics, to address problems in statis- tics and its applications. On the one hand, algebra provides a powerful tool set for addressing statistical problems. On the other hand, it is rarely the case that algebraic techniques are ready-made to address statistical challenges, and usually new algebraic results need to be developed.
    [Show full text]
  • MONOMIAL RESOLUTIONS Dave Bayer Irena Peeva Bernd Sturmfels
    MONOMIAL RESOLUTIONS Dave Bayer Irena Peeva Bernd Sturmfels 1. Introduction. Let M be a monomial ideal in the polynomial ring S = k[x1,...,xn] over a field k. We are interested in the problem, first posed by Kaplansky in the early 1960’s, of finding a minimal free resolution of S/M over S. The difficulty of this problem is reflected in the fact that the homology of arbitrary simplicial complexes can be encoded (via the Stanley-Reisner correspondence [BH,Ho,St]) into the multigraded Betti numbers of S/M. In particular, the minimal free resolution may depend on the characteristic of k. We introduce a method for resolving S/M by encoding the entire resolution into a single simplicial complex (Construction 2.1). This method is different from the way simplicial complexes are used in the Stanley-Reisner correspondence to compute Betti numbers. One of the central ideas in this paper is that there exists a genericity condition, which ensures simply structured homological behavior. The same idea is developed further for toric varieties in [PS]. We call a monomial ideal M generic if no variable xi appears with the same nonzero exponent in two distinct minimal generators of M. Almost all monomial ideals are generic, in the sense that those which fail to be generic lie on finitely many hyperplanes in the matrix space of exponents. We prove that the minimal free resolution for any generic monomial ideal M comes (in the sense of Construction 2.1) from a simplicial complex ∆M , which we call the Scarf complex of M.IfM is Artinian, then the Scarf complex is a regular triangulation of a simplex (Corollary 5.5).
    [Show full text]
  • The 1999 Notices Index, Volume 46, Number 11
    index.qxp 10/15/99 11:17 AM Page 1480 The 1999 Notices Index Index Section Page Number The AMS 1480 Meetings Information 1489 Announcements 1481 Memorial Articles 1490 Authors of Articles 1482 New Publications Offered by the AMS 1490 Reference and Book List 1420 Officers and Committee Members 1490 Deaths of Members of the Society 1483 Opinion 1490 Education 1484 Opportunities 1490 Feature Articles 1484 Prizes and Awards 1491 Forum 1485 Articles on the Profession 1492 Letters to the Editor 1486 Reviews 1492 Mathematicians 1487 Surveys 1493 Mathematics Articles 1489 Tables of Contents 1493 Mathematics History 1489 About the Cover, 26, 245, 318, 420, 534, 658, 781, 918, AMS Meeting in August 2000, 355 1073, 1208, 1367 AMS Menger Awards at the 1999 Intel-International Science and Engineering Fair, 912 Acknowledgment of Contributions, 947 AMS Officers and Committee Members, 1271 AMS Participates in Capitol Hill Exhibition, 918 The AMS AMS Participates in Faculty Preparation Program, 1072 1998 Election Results, 266 AMS Short Courses, 1171 1998 Report of the Committee on Meetings and Confer- AMS Standard Cover Sheet, 60, 270, 366, 698, 972, 1102, ences, 810 1282, 1428 1999 AMS Centennial Fellowships Awarded, 684 (The) Birth of an AMS Meeting, 1029 1999 AMS Election, 58, 267 Bylaws of the American Mathematical Society, 1252 1999 AMS-MAA-SIAM Morgan Prize, 469 Call for Proposals for 2001 Conferences, 1177, 1331 1999 Arnold Ross Lectures, 692 Conference Announced (Summer Mathematics Experience: 1999 Bôcher Prize, 463 A Working Conference on Summer
    [Show full text]
  • On the Rank of a Tropical Matrix
    Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 On the Rank of a Tropical Matrix MIKE DEVELIN, FRANCISCO SANTOS, AND BERND STURMFELS Abstract. This is a foundational paper in tropical linear algebra, which is linear algebra over the min-plus semiring. We introduce and compare three natural definitions of the rank of a matrix, called the Barvinok rank, the Kapranov rank and the tropical rank. We demonstrate how these notions arise naturally in polyhedral and algebraic geometry, and we show that they differ in general. Realizability of matroids plays a crucial role here. Connections to optimization are also discussed. 1. Introduction The rank of a matrix M is one of the most important notions in linear algebra. This number can be defined in many different ways. In particular, the following three definitions are equivalent: • The rank of M is the smallest integer r for which M can be written as the sum of r rank one matrices. A matrix has rank 1 if it is the product of a column vector and a row vector. • The rank of M is the smallest dimension of any linear space containing the columns of M. • The rank of M is the largest integer r such that M has a nonsingular r × r minor. Our objective is to examine these familiar definitions over an algebraic struc- ture which has no additive inverses. We work over the tropical semiring (R, ⊕, ), whose arithmetic operations are a ⊕ b := min(a, b) and a b := a + b. This work was conducted during the Discrete and Computational Geometry semester at M.S.R.I., Berkeley.
    [Show full text]
  • Tropical Gaussians: a Brief Survey 3
    TROPICAL GAUSSIANS: A BRIEF SURVEY NGOC MAI TRAN Abstract. We review the existing analogues of the Gaussian measure in the tropical semir- ing and outline various research directions. 1. Introduction Tropical mathematics has found many applications in both pure and applied areas, as documented by a growing number of monographs on its interactions with various other ar- eas of mathematics: algebraic geometry [BP16, Gro11, Huh16, MS15], discrete event systems [BCOQ92, But10], large deviations and calculus of variations [KM97, Puh01], and combinato- rial optimization [Jos14]. At the same time, new applications are emerging in phylogenetics [LMY18, YZZ19, PYZ20], statistics [Hoo17], economics [BK19, CT16, EVDD04, GMS13, Jos17, Shi15, Tra13, TY19], game theory, and complexity theory [ABGJ18, AGG12]. There is a growing need for a systematic study of probability distributions in tropical settings. Over the classical algebra, the Gaussian measure is arguably the most important distribution to both theoretical probability and applied statistics. In this work, we review the existing analogues of the Gaussian measure in the tropical semiring. We focus on the three main characterizations of the classical Gaussians central to statistics: invariance under orthonor- mal transformations, independence and orthogonality, and stability. We show that some notions do not yield satisfactory generalizations, others yield the classical geometric or ex- ponential distributions, while yet others yield completely different distributions. There is no single notion of a ‘tropical Gaussian measure’ that would satisfy multiple tropical analogues of the different characterizations of the classical Gaussians. This is somewhat expected, for the interaction between geometry and algebra over the tropical semiring is rather different from that over R.
    [Show full text]
  • Jahrbuch-2018 V3
    Berlin-Brandenburgische Akademie der Wissenschaften vormals Preußische Akademie der Wissenschaften JAHRBUCH 2018 Berlin-Brandenburgische Akademie der Wissenschaften vormals Preußische Akademie der Wissenschaften Berlin-Brandenburgische Akademie der Wissenschaften vormals Preußische Akademie der Wissenschaften JAHRBUCH 2018 Impressum Herausgeberin: Berlin-Brandenburgische Akademie der Wissenschaften Redaktion: Andreas Schmidt unter Mitarbeit von Iris Johanna Bauer Redaktionsschluss: 10. Mai 2019 Grafik und Layout: angenehme gestaltung/Thorsten Probst Druck: Druckerei Conrad GmbH, Berlin © Berlin-Brandenburgische Akademie der Wissenschaften, 2019 Jägerstraße 22/23, 10117 Berlin, www.bbaw.de Nachdruck, auch auszugsweise, nur mit ausdrücklicher Genehmigung der Herausgeberin ISBN 978-3-939818-83-0 VORWORT Liebe Leserinnen und Leser, die wissenschaftliche Arbeit unserer Akademie ist bestimmt von geis- teswissenschaftlicher Grundlagenforschung. Unsere 23 Akademien- vorhaben haben 2018 ihre Arbeit erfolgreich fortgesetzt und zusammen mit der TELOTA-Initiative an der Digitalisierung ihrer Forschungsergebnisse gearbeitet. Welche grundlegende Arbeit in Foto: BBAW, Judith Affolter unserem Hause geleistet wird, wird in der Öffentlichkeit oft durch Jahres tage und Jubiläen besonders sichtbar. Ein solches war der 200. Geburtstag von Karl Marx am 5. Mai 2018. So wurde in zahlreichen Presseveröffentlichungen auf die Publikationen unseres Aka- demien vorhabens „Marx-Engels-Gesamtausgabe“ (MEGA) Bezug genommen. Große Projekte umzu- setzen, erfordert nicht
    [Show full text]