Non-Standard Analysis in Projective Geometry

Total Page:16

File Type:pdf, Size:1020Kb

Non-Standard Analysis in Projective Geometry Technische Universität München Fakultät für Mathematik Lehrstuhl für Geometrie und Visualisierung Non-standard Analysis in Projective Geometry Michael Strobel Vollständiger Abdruck der von der Fakultät für Mathematik der Technischen Universität München zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) genehmigten Dissertation. Vorsitzender: Prof. Dr. Michael Marc Wolf Prüfer der Dissertation: 1. Prof. Dr. Dr. Jürgen Richter-Gebert 2. Prof. Jacques Fleuriot, Ph.D. University of Edinburgh Die Dissertation wurde am 29.05.2018 bei der Technischen Universität München einge- reicht und durch die Fakultät für Mathematik am 19.09.2018 angenommen. Contents 1. Geometry and Infinity1 2. Site Map3 3. Singularities of Geometric Constructions6 3.1. Modelling Dynamic Geometry.........................7 3.2. The Analytic Case............................... 13 3.3. Singularities and Derivatives.......................... 15 3.4. The Radical of all Evil............................. 21 3.5. Methods for Non-differentiable Functions.................. 25 3.5.1. Classical Power Series......................... 25 3.5.2. Law of Large Numbers......................... 26 3.5.3. Cauchy’s Integral Formula....................... 27 3.5.4. Algebraic Curves: Blow Up...................... 27 4. Non-standard Analysis 30 4.1. Constructing the Hyperreal and Hypercomplex Numbers.......... 31 4.2. Mathematical Logic and the Transfer Principle............... 35 ∗ 4.3. Basic Operations on K ............................ 41 4.4. Derivatives and Newton Quotients...................... 50 4.5. Some Useful Series Expansions........................ 51 5. Non-standard Projective Geometry 55 5.1. Incidence of Points and Lines......................... 65 5.2. Non-standard Projective Transformations.................. 75 5.3. Non-standard Cross-Ratios.......................... 82 5.4. Non-standard Conics.............................. 84 6. Removal of Singularities & Numerics 88 6.1. Non-standard Analysis and Removal of Singularities............ 88 6.2. Stability of a Solution............................. 97 3 6.3. The Relation to Perturbation Theory..................... 101 6.4. Fast Numerical Methods............................ 103 6.4.1. Derivatives Revisited.......................... 103 6.4.2. There is no such Thing as a Free Non-standard Lunch....... 104 6.4.3. Implementation of a Non–Archimedean Field............ 105 6.4.4. Levi-Civita Field............................ 107 6.4.5. Implementation of the Levi-Civita Field............... 114 6.4.6. Application to Singularities in Geometric Constructions...... 119 6.5. Experimental Results & Examples...................... 121 6.5.1. Von-Staudt Construction....................... 121 6.5.2. Disjoint Circle Intersection...................... 127 6.6. Limitation of the Levi-Civita Field...................... 132 6.7. A priori Avoidance of Singularities...................... 138 6.7.1. Modeling the Avoidance of Singularities............... 138 6.7.2. From Plücker’s µ to Efficient Implementation............ 139 6.7.3. Limits of a Priori Resolution..................... 141 7. Open Problems & Future Work 143 7.1. Randomized Proving using Infinitesimal Deflection............. 143 7.2. Möbius Transformations............................ 144 7.3. New Approaches to Tracing.......................... 147 7.3.1. Infinitesimal Tracing.......................... 148 7.3.2. Tracing and Automatic Differentiation................ 149 Appendix A. CindyScript Implementation of the Levi-Civita Field 150 Appendix B. Computer Algebra System Code Tangential Circle Intersection 160 Appendix C. Law of Large Numbers 162 Appendix D. Projective Midpoint via Plücker’s µ 163 Bibliography 164 Acknowledgments “Alle guten Dinge haben etwas Lässiges und liegen wie Kühe auf der Wiese.” Friedrich Nietzsche, [100] First of all I want to thank J. Richter-Gebert for the freedom of choice in the subject and the means of my thesis and for being a lighthouse in the sea of science. And also I want to thank Jacques Fleuriot for examining this thesis and the numerous helpful remarks. Furthermore, I want to thank my family Silvia, Willi, Johannes and Andi for constantly supporting me. This thesis is also your merit! My special thanks go to Steffi for her support and the infamous coffee breaks. I want to thank my friends who accompanied me over all the years: Wolle, Daniel, Peppie, Stocke, Maze, Mario, Hannah, Sonja, Michi, Don, Jo, Anja, Karin, Jakob and Ella. Many thanks to Katharina and her family Dominik, Lydia and Norbert. The university and Munich would not have been the same without my friends and colleagues who always brought joyful distraction and discussions: Christoph, Peter, Benni, Patrick, Flo, Felix, Mario, Angela, Karin, Max, Benedict, Georg, Steffi, Horst, Rebecca, Eva, Kathi, Johanna, Anna, Matthias, André, Leo, Laura, Tim, Jutta, Diane, Carsten, Uli (and his Italian espresso machine), Florian and the rest of the chair of Geometry and Visualization. The coffee breaks will always be one of my favourite memories of my doctorate. I also want to thank my office roommate Aaron for happily discussing my ideas and always being so enthusiastic. Also I want to thank Thomas, the Servicebüro Studium and the Fachschaft for making the university a better place to be. Also I want to thank the group of Emo Welzl at the ETH Zürich for the nice and fruitful stay in Switzerland. Additionally, I want to thank the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics” for funding my position. Last but not least: I want to thank the CindyJS team. Jürgen and Uli (the benevolent dictators for life), Martin, Stefan and Aaron. It has not been always easy, but always a lot of fun! 1. Geometry and Infinity “Wahrlich es ist nicht das Wissen, sondern das Lernen, nicht das Besitzen, sondern das Erwerben, nicht das Da-Seyn, sondern das Hinkommen, was den grössten Genuss gewährt. Wenn ich eine Sache ganz ins Klare gebracht und erschöpft habe, so wende ich mich davon weg, um wieder ins Dunkle zu gehen; so sonderbar ist der nimmersatte Mensch, hat er ein Gebäude vollendet so ist es nicht um nun ruhig darin zu wohnen, sondern um ein anderes anzufangen.” Carl Friedrich Gauß, [49] p. 94 In this thesis we will integrate concepts of non-standard analysis into projective geometry. One major application of the developed theory will be the automatic removal of singularities in geometric constructions. Non-standard analysis allows the precise handling of infinitely small (infinitesimal) and infinitely large (unlimited) numbers which admits statements like: “there is an > 0 such + + that < r ∀r ∈ R ” or “there is an H such that H > r ∀r ∈ R ”. This obviously violates the Archimedean axiom. Therefore such fields that contain infinitesimal and unlimited numbers are also called “non-Archimedean”. To embed this theory into the “standard” ∗ theory, one may use field extensions of R and C. We will call them R (hyperreal numbers) ∗ and C (hypercomplex numbers), and one may seamlessly integrate these numbers into well-established (we will refer to it by the adjective “standard”) analysis in the sense of Weierstrass. Although the construction of these fields is highly non-trivial, its mere application is very intuitive. One strength of projective geometry is the natural and comprehensive integration of infinity. For example: consider the intersection of two (disjoint) lines. Euclidean geometry has to distinguish two cases: the lines intersect or they do not intersect (if they are parallel). In projective geometry there is always a point of intersection, it just may be infinitely far way. In practice, projective geometry is usually carried out over R or C, but its not restricted to these canonical fields. One may consider arbitrary fields for geometric operations and this will enable us to combine the mathematical branches of projective geometry and non-standard analysis. 1 1. Geometry and Infinity Using infinitesimal elements in geometry is not a new concept, au contraire it is one of the oldest concepts. Already Leibniz and Newton used them for geometric reasoning. Dynamic (projective) geometry allows us to describe the movement of geometric constructions and implement them on a computer. In dynamic constructions, singularities naturally arise. We will look into methods for resolving singularities and situations in which standard theory does not offer concise and consistent solutions. This will naturally lead to the integration of non-standard analysis into projective geometry. Non-standard analysis in projective geometry is quite an exciting topic on its own and we will explore basic properties that are sometimes surprising. Using this extension of projective geometry, we will be able to develop the theory of proper desingularization. After expanding this theory we will also develop algorithms and a real time capable implementation to integrate the theory into a dynamic geometry system. 2 2. Site Map Abstruse Goose (CC BY–NC 3.0, http://abstrusegoose.com/440) 3 2. Site Map If you are looking for a more streamlined version of this thesis, we already published two preprints that cover most of the novelties: [128, 129]. This thesis is essentially divided into five parts: Singularities of Geometric Construc- tions, an introduction to Non-standard Analysis, Non-standard Projective Geometry, Removal of Singularities & Numerics and Open Problems & Future Work. We will assume that the reader is familiar with projective geometry, if this is not the case we refer to the books
Recommended publications
  • Good Reduction of Puiseux Series and Applications Adrien Poteaux, Marc Rybowicz
    Good reduction of Puiseux series and applications Adrien Poteaux, Marc Rybowicz To cite this version: Adrien Poteaux, Marc Rybowicz. Good reduction of Puiseux series and applications. Journal of Symbolic Computation, Elsevier, 2012, 47 (1), pp.32 - 63. 10.1016/j.jsc.2011.08.008. hal-00825850 HAL Id: hal-00825850 https://hal.archives-ouvertes.fr/hal-00825850 Submitted on 24 May 2013 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Good Reduction of Puiseux Series and Applications Adrien Poteaux, Marc Rybowicz XLIM - UMR 6172 Universit´ede Limoges/CNRS Department of Mathematics and Informatics 123 Avenue Albert Thomas 87060 Limoges Cedex - France Abstract We have designed a new symbolic-numeric strategy to compute efficiently and accurately floating point Puiseux series defined by a bivariate polynomial over an algebraic number field. In essence, computations modulo a well chosen prime number p are used to obtain the exact information needed to guide floating point computations. In this paper, we detail the symbolic part of our algorithm: First of all, we study modular reduction of Puiseux series and give a good reduction criterion to ensure that the information required by the numerical part is preserved.
    [Show full text]
  • 9<HTMERB=Eheihg>
    Mathematics springer.com/NEWSonline Advances in Mathematical K. Alladi, University of Florida, Gainesville, FL, I. Amidror, Ecole Polytechnique Fédérale de USA; M. Bhargava, Princeton University, NJ, USA; Lausanne, Switzerland Economics D. Savitt, P. H. Tiep, University of Arizona, Tucson, AZ, USA (Eds) Mastering the Discrete Fourier Series editors: S. Kusuoka, R. Anderson, C. Castaing, Transform in One, Two or F. H. Clarke, E. Dierker, D. Duffie, L. C. Evans, Quadratic and Higher Degree T. Fujimoto, N. Hirano, T. Ichiishi, A. Ioffe, Forms Several Dimensions S. Iwamoto, K. Kamiya, K. Kawamata, H. Matano, Pitfalls and Artifacts M. K. Richter, Y. Takahashi, J.‑M. Grandmont, In the last decade, the areas of quadratic and T. Maruyama, M. Yano, A. Yamazaki, K. Nishimura higher degree forms have witnessed dramatic The discrete Fourier transform (DFT) is an ex- Volume 17 advances. This volume is an outgrowth of three tremely useful tool that finds application in many seminal conferences on these topics held in 2009, different disciplines. However, its use requires S. Kusuoka, T. Maruyama (Eds) two at the University of Florida and one at the caution. The aim of this book is to explain the Arizona Winter School. DFT and its various artifacts and pitfalls and to Advances in Mathematical show how to avoid these (whenever possible), or Economics Volume 17 Features at least how to recognize them in order to avoid 7 Provides survey lectures, also accessible to non- misinterpretations. A lot of economic problems can be formulated experts 7 Introduction summarizes current as constrained optimizations and equilibration research on quadratic and higher degree forms Features of their solutions.
    [Show full text]
  • A Survey on Recent Advances and Future Challenges in the Computation of Asymptotes
    A Survey on Recent Advances and Future Challenges in the Computation of Asymptotes Angel Blasco and Sonia P´erez-D´ıaz Dpto. de F´ısica y Matem´aticas Universidad de Alcal´a E-28871 Madrid, Spain [email protected], [email protected] Abstract In this paper, we summarize two algorithms for computing all the gener- alized asymptotes of a plane algebraic curve implicitly or parametrically de- fined. The approach is based on the notion of perfect curve introduced from the concepts and results presented in [Blasco and P´erez-D´ıaz(2014)], [Blasco and P´erez-D´ıaz(2014-b)] and [Blasco and P´erez-D´ıaz(2015)]. From these results, we derive a new method that allow to easily compute horizontal and vertical asymptotes. Keywords: Implicit Algebraic Plane Curve; Parametric Plane Curve; Infinity Branches; Asymptotes; Perfect Curves; Approaching Curves. 1 Introduction In this paper, we deal with the problem of computing the asymptotes of the infinity branches of a plane algebraic curve. This question is very important in the study of real plane algebraic curves because asymptotes contain much of the information about the behavior of the curves in the large. For instance, determining the asymptotes of a curve is an important step in sketching its graph. Intuitively speaking, the asymptotes of some branch, B, of a real plane algebraic curve, C, reflect the status of B at the points with sufficiently large coordinates. In analytic geometry, an asymptote of a curve is a line such that the distance between the curve and the line approaches zero as they tend to infinity.
    [Show full text]
  • Undergraduate Catalog 14-16
    UNDERGRADUATE CATALOG: 2014-2016 Connecticut State Colleges and Universities ACADEMIC DEPARTMENTS, PROGRAMS, AND Accreditation and Policy COURSES Message from the President Ancell School of Business Academic Calendar School of Arts & Sciences Introduction to Western School of Professional Studies The Campus School of Visual and Performing Arts Admission to Western Division of Graduate Studies Student Expenses Office of Student Aid & Student Employment Directory Student Affairs Administration Academic Services and Procedures Faculty/Staff Academic Programs and Degrees Faculty Emeriti Graduation Academic Program Descriptions WCSU Undergraduate Catalog: 2014-2016 1 CONNECTICUT STATE COLLEGES & UNIVERSITIES The 17 Connecticut State Colleges & Universities (ConnSCU) provide affordable, innovative and rigorous programs that permit students to achieve their personal and career goals, as well as contribute to the economic growth of Connecticut. The ConnSCU System encompasses four state universities – Western Connecticut State University in Danbury, Central Connecticut State University in New Britain, Eastern Connecticut State University in Willimantic and Southern Connecticut State University in New Haven – as well as 12 community colleges and the online institution Charter Oak State College. Until the state’s higher education reorganization of 2011, Western was a member of the former Connecticut State Unviersity System that also encompassed Central, Eastern and Southern Connecticut state universities. With origins in normal schools for teacher education founded in the 19th and early 20th centuries, these institutions evolved into diversified state universities whose graduates have pursued careers in the professions, business, education, public service, the arts and other fields. Graduates of Western and other state universities contribute to all aspects of Connecticut economic, social and cultural life.
    [Show full text]
  • Arxiv:Math/9404219V1
    A Package on Formal Power Series Wolfram Koepf Konrad-Zuse-Zentrum f¨ur Informationstechnik Heilbronner Str. 10 D-10711 Berlin [email protected] Mathematica Journal 4, to appear in May, 1994 Abstract: Formal Laurent-Puiseux series are important in many branches of mathemat- ics. This paper presents a Mathematica implementation of algorithms devel- oped by the author for converting between certain classes of functions and their equivalent representing series. The package PowerSeries handles func- tions of rational, exponential, and hypergeometric type, and enables the user to reproduce most of the results of Hansen’s extensive table of series. Subal- gorithms of independent significance generate differential equations satisfied by a given function and recurrence equations satisfied by a given sequence. Scope of the Algorithms A common problem in mathematics is to convert an expression involving el- ementary or special functions into its corresponding formal Laurent-Puiseux series of the form ∞ k/n f(x)= akx . (1) kX=k0 Expressions created from algebraic operations on series, such as addition, arXiv:math/9404219v1 [math.CA] 19 Apr 1994 multiplication, division, and substitution, can be handled by finite algo- rithms if one truncates the resulting series. These algorithms are imple- mented in Mathematica’s Series command. For example: In[1]:= Series[Sin[x] Exp[x], {x, 0, 5}] 3 5 2xx 6 Out[1]= x + x + -- - -- + O[x] 3 30 It is usually much more difficult to find the exact formal result, that is, an explicit formula for the coefficients ak. 1 This
    [Show full text]
  • Formulae and Asymptotics for Coefficients of Algebraic Functions
    FORMULAE AND ASYMPTOTICS FOR COEFFICIENTS OF ALGEBRAIC FUNCTIONS CYRIL BANDERIER AND MICHAEL DRMOTA UUUWe dedicate this article to the memory of Philippe Flajolet, who was and will remain a guide and a wonderful source of inspiration for so many of us. UUU [ This article will appear in Combinatorics, Probability, and Computing, in the special volume dedicated to Philippe Flajolet. ] Cyril Banderier, CNRS/Univ. Paris 13, Villetaneuse (France). Cyril.Banderier at lipn.univ-paris13.fr, http://lipn.univ-paris13.fr/∼banderier Michael Drmota, TU Wien (Austria). drmota at dmg.tuwien.ac.at, http://dmg.tuwien.ac.at/drmota/ Date: March 22, 2013 (revised March 22, 2014). Key words and phrases. analytic combinatorics, generating function, algebraic function, singu- larity analysis, context-free grammars, critical exponent, non-strongly connected positive systems, Gaussian limit laws, N-algebraic function. 1 2 FORMULAE AND ASYMPTOTICS FOR COEFFICIENTS OF ALGEBRAIC FUNCTIONS P n Abstract. We study the coefficients of algebraic functions n≥0 fnz . First, we recall the too-little-known fact that these coefficients fn always admit a closed form. Then we study their asymptotics, known to be of the type n α fn ∼ CA n . When the function is a power series associated to a context- free grammar, we solve a folklore conjecture: the critical exponents α can- not be 1=3 or −5=2; they in fact belong to a proper subset of the dyadic numbers. We initiate the study of the set of possible values for A. We ex- tend what Philippe Flajolet called the Drmota{Lalley{Woods theorem (which states that α = −3=2 when the dependency graph associated to the algebraic system defining the function is strongly connected).
    [Show full text]
  • SMT Solving in a Nutshell
    SAT and SMT Solving in a Nutshell Erika Abrah´ am´ RWTH Aachen University, Germany LuFG Theory of Hybrid Systems February 27, 2020 Erika Abrah´ am´ - SAT and SMT solving 1 / 16 What is this talk about? Satisfiability problem The satisfiability problem is the problem of deciding whether a logical formula is satisfiable. We focus on the automated solution of the satisfiability problem for first-order logic over arithmetic theories, especially using SAT and SMT solving. Erika Abrah´ am´ - SAT and SMT solving 2 / 16 CAS SAT SMT (propositional logic) (SAT modulo theories) Enumeration Computer algebra DP (resolution) systems [Davis, Putnam’60] DPLL (propagation) [Davis,Putnam,Logemann,Loveland’62] Decision procedures NP-completeness [Cook’71] for combined theories CAD Conflict-directed [Shostak’79] [Nelson, Oppen’79] backjumping Partial CAD Virtual CDCL [GRASP’97] [zChaff’04] DPLL(T) substitution Watched literals Equalities and uninterpreted Clause learning/forgetting functions Variable ordering heuristics Bit-vectors Restarts Array theory Arithmetic Decision procedures for first-order logic over arithmetic theories in mathematical logic 1940 Computer architecture development 1960 1970 1980 2000 2010 Erika Abrah´ am´ - SAT and SMT solving 3 / 16 SAT SMT (propositional logic) (SAT modulo theories) Enumeration DP (resolution) [Davis, Putnam’60] DPLL (propagation) [Davis,Putnam,Logemann,Loveland’62] Decision procedures NP-completeness [Cook’71] for combined theories Conflict-directed [Shostak’79] [Nelson, Oppen’79] backjumping CDCL [GRASP’97] [zChaff’04]
    [Show full text]
  • A Proof of Saari's Conjecture for the Three-Body
    A PROOF OF SAARI’S CONJECTURE FOR THE THREE-BODY PROBLEM IN Rd RICHARD MOECKEL Abstract. The well-known central configurations of the three-body problem give rise to periodic solutions where the bodies rotate rigidly around their center of mass. For these solutions, the moment of inertia of the bodies with respect to the center of mass is clearly constant. Saari conjectured that such rigid motions, called relative equilibrium solutions, are the only solutions with constant moment of inertia. This result will be proved here for the Newtonian three-body problem in Rd with three positive masses. The proof makes use of some computational algebra and geometry. When d ≤ 3, the rigid motions are the planar, periodic solutions arising from the five central configurations, but for d ≥ 4 there are other possibilities. 1. Introduction It is a well-known property of the Newtonian n-body problem that the center of mass of the bodies moves along a line with constant velocity. Making a change of coordinates, one may assume that the center of mass is actually constant and remains at the origin. Once this is done, the moment of inertia with respect to the origin provides a natural measure of the size of the configuration. The familiar rigidly rotating periodic solutions of Lagrange provide examples of solutions with constant moment of inertia. Saari conjectured that these are in fact the only such solutions [11]. The goal of this paper is to provide a proof for the three-body problem in Rd. This corresponding result for the planar problem was presented in [9].
    [Show full text]
  • Coefficients of Algebraic Functions: Formulae and Asymptotics
    COEFFICIENTS OF ALGEBRAIC FUNCTIONS: FORMULAE AND ASYMPTOTICS CYRIL BANDERIER AND MICHAEL DRMOTA Abstract. This paper studies the coefficients of algebraic functions. First, we recall the too-less-known fact that these coefficients fn always a closed form. Then, we study their asymptotics, known to be of the type n α fn ∼ CA n . When the function is a power series associated to a context-free grammar, we solve a folklore conjecture: the appearing critical exponents α belong to a subset of dyadic numbers, and we initiate the study the set of possible values for A. We extend what Philippe Flajolet called the Drmota{Lalley{Woods theorem (which is assuring α = −3=2 as soon as a "dependency graph" associated to the algebraic system defining the function is strongly connected): We fully characterize the possible singular behaviors in the non-strongly connected case. As a corollary, it shows that certain lattice paths and planar maps can not be generated by a context-free grammar (i.e., their generating function is not N-algebraic). We give examples of Gaussian limit laws (beyond the case of the Drmota{Lalley{Woods theorem), and examples of non Gaussian limit laws. We then extend our work to systems involving non-polynomial entire functions (non-strongly connected systems, fixed points of entire function with positive coefficients). We end by discussing few algorithmic aspects. Resum´ e.´ Cet article a pour h´erosles coefficients des fonctions alg´ebriques.Apr`esavoir rappel´ele fait trop peu n α connu que ces coefficients fn admettent toujours une forme close, nous ´etudionsleur asymptotique fn ∼ CA n .
    [Show full text]
  • Fractional-Order Phase Transition of Charged Ads Black Holes
    Physics Letters B 795 (2019) 490–495 Contents lists available at ScienceDirect Physics Letters B www.elsevier.com/locate/physletb Fractional-order phase transition of charged AdS black holes ∗ Meng-Sen Ma a,b, a Institute of Theoretical Physics, Shanxi Datong University, Datong 037009, China b Department of Physics, Shanxi Datong University, Datong 037009, China a r t i c l e i n f o a b s t r a c t Article history: Employing the fractional derivatives, one can construct a more elaborate classification of phase transitions Received 23 May 2019 compared to the original Ehrenfest classification. In this way, a thermodynamic system can even undergo Received in revised form 26 June 2019 a fractional-order phase transition. We use this method to restudy the charged AdS black hole and Van Accepted 28 June 2019 der Waals fluids and find that at the critical point they both have a 4/3-order phase transition, but not Available online 2 July 2019 the previously recognized second-order one. Editor: M. Cveticˇ © 2019 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license 3 (http://creativecommons.org/licenses/by/4.0/). Funded by SCOAP . 1. Introduction The generalized classification can work in any thermodynamic systems that having phase structures. Black holes, being charac- In many thermodynamic systems there exist phase transitions terized by only three parameters, are the simplest thermodynamic and critical phenomena. The original classification of phase tran- system. In particular, it has been found that AdS black holes have sitions was proposed by Ehrenfest.
    [Show full text]
  • A Survey of User Interfaces for Computer Algebra Systems
    J. Symbolic Computation (1998) 25, 127–159 A Survey of User Interfaces for Computer Algebra Systems NORBERT KAJLER† AND NEIL SOIFFER‡§ †Ecole des Mines de Paris, 60 Bd. St-Michel, 75006 Paris, France ‡Wolfram Research, Inc., 100 Trade Center Drive, Champaign, IL 61820, U.S.A. This paper surveys work within the Computer Algebra community (and elsewhere) di- rected towards improving user interfaces for scientific computation during the period 1963–1994. It is intended to be useful to two groups of people: those who wish to know what work has been done and those who would like to do work in the field. It contains an extensive bibliography to assist readers in exploring the field in more depth. Work related to improving human interaction with computer algebra systems is the main focus of the paper. However, the paper includes additional materials on some closely related issues such as structured document editing, graphics, and communication protocols. c 1998 Academic Press Limited 1. Introduction There are several problems with current computer algebra systems (CASs) that are interface-related. These problems include: the use of an unnatural linear notation to enter and edit expressions, the inherent difficulty of selecting and modifying subexpressions with commands, and the display of large expressions that run off the screen. These problems may intimidate novice users and frustrate experienced users. The more natural and intuitive the interface (the closer it corresponds to pencil and paper manipulations), the more likely it is that people will want to take advantage of the CAS for its ability to do tedious computations and to verify derivations.
    [Show full text]
  • The Process of Urban Systems Integration
    THE PROCESS OF URBAN SYSTEMS An integrative approach towards the institutional process of systems integration in urban area development INTEGRATION MSc Thesis Eva Ros MSc Thesis November 2017 Eva Ros student number # 4188624 MSc Architecture, Urbanism and Building Sciences Delft University of Technology, department of Management in the Built Environment chair of Urban Area Development (UAD) graduation laboratory Next Generation Waterfronts in collaboration with the AMS institute First mentor Arie Romein Second mentor Ellen van Bueren This thesis was printed on environmentally friendly recycled and unbleached paper 2 THE PROCESS OF URBAN SYSTEMS INTEGRATION An integrative approach towards the institutional process of systems integration in urban area development 3 MANAGEMENT SUMMARY (ENG) INTRODUCTION Today, more than half of the world’s population lives in cities. This makes them centres of resource consumption and waste production. Sustainable development is seen as an opportunity to respond to the consequences of urbanisation and climate change. In recent years the concepts of circularity and urban symbiosis have emerged as popular strategies to develop sustainable urban areas. An example is the experimental project “Straat van de Toekomst”, implementing a circular strategy based on the Greenhouse Village concept (appendix I). This concept implements circular systems for new ways of sanitation, heat and cold storage and greenhouse-house symbiosis. Although many technological artefacts have to be developed for these sustainable solutions, integrating infrastructural systems asks for more than just technological innovation. A socio-cultural change is needed in order to reach systems integration. The institutional part of technological transitions has been underexposed over the past few years.
    [Show full text]