Using CAS Sessions in TEXMACS

Total Page:16

File Type:pdf, Size:1020Kb

Using CAS Sessions in TEXMACS Using CAS sessions in TEXMACS One important feature of TeXmacs is that users can "execute" external computer algebra system (CAS) within worksheet. Supported CAS’s include: maxima octave gnuplot yacas R qcl etc. The detailed menu will be listed in [Insert] [Session] according to exactly CAS’s installat- tions1 in your system. → 1. Octave When you choose from the [Octave] choice from [Insert] [Session] or from submenu in middle line, octave will be invoked and you can input the octave→ command after the prompt as follows: octave> A=[1 0 0 0;2 2 0 0;-1 0 2 0;0 -1 2 2] octave> A^2 octave> A.^2 octave> eig(A) octave> [U,V]=eig(A) octave> V.^1 octave> U.^1 octave> A’ octave> 1.1. Linear System Equations The following equation can be solved only by division: ax = b x = b/a if a 0 ⇒ The method for solving linear system equation is similar as follows: I I 1 I Am nXI n 1 = bm 1 Xn 1 = Am− nbm 1 × × × ⇒ × × × And octave support the operation for such solution: I 1 I I XI n 1 = Am− nbm 1 Xn 1 = Am n bm 1 × × × ⇒ × × × / Example 1. Solve the linear system of equations: x + x = 2 − 1 2 2x + 3x = 1 1 2 − This system of equations can be rewritten as: 1 1 x 2 1 = −2 3 x 1 2 − Now the solution by octave is: octave> A=[-1 1; 2 3];b=[2;-1] octave> A\b octave> Note the command is A b but neither A/b nor b/A. \ Exercise 1. Solve the following systems of equations: i. x + 2x + 3x = 2 − 1 2 3 4x1 5x2 + 6x3 = 1 7x − 8x + 9x = 1− 1 − 2 3 ii. 1.1 x + 2.2x + 3.3x = 2.2 − 1 2 3 4.4x1 5.5x2 + 6.6x3 = 1.1 7.7x − 8.8x + 9.9x = 1.1− 1 − 2 3 1.2. LU Decomposition Another method, UV decomposition, is usually used in large linear systems. Suppose that I AXI = b This equation can be solved as follows: I I I I PAX = LUX LyI = Pb = c ⇒ I Iy = L c ⇒ \ I X = U Iy ⇒ \ where L is a lower triangular matrix and U is an upper triangular matrix. The octave command about this LU decomposition is [ LUP] = lu( A) Example 2. Solve the same problem in Example 1 in LU decomposition. And compare the solutions. octave> A=[-1 1; 2 3];b=[2;-1] octave> [L U P]=lu(A) octave> y=L\(P*b) octave> x=U\y octave> x.^1 octave> Exercise 2. Solve the problems in Exercise 1 by LU decomposition. 1.3. Octave Programming Not only the fundamental mathematical functions octave supports, programmability is also sup- ported too. octave> A=[1 0 0 0;2 2 0 0;-1 0 2 0;0 -1 2 2] octave> A^2 octave> A.^2 octave> [u,v]=eig(A) octave> Q=[1 0 0 0;-2 2 1 0;1 1 0 0;-4 0 0 -1] octave> P=inv(Q) octave> P*A*Q The first octave program example is to plot graph of mathematical function, y = x + sin x. Unlike general alike software, Octave plot such graph piecewisely. In other words, we have to partition the parameter axis into several nonoverlapping subintervals firstly as following: x = linspace( xinit, xend, number of intervals) − − and plot the curve as: y = function( x) plot( x, y, ′′ ; title; ′′ ) A simple plotting example is given: 1. Partition [10,-10] into 1000 non-overlapping subintervals: octave> x=linspace(-10,10,1000); 2. define the function, y( x) = x + sin x octave> y=x+sin(x); 3. plot octave> plot(x,y,";Function y=x+sin(x);"); 10 Function y=x+sin(x) 8 6 4 2 0 -2 -4 -6 -8 -10 -10 -5 0 5 10 octave> z=x+cos(x);hold on octave> plot(x,z,";z=x+cos(x);"); 10 Function y=x+sin(x) z=x+cos(x) 5 0 -5 -10 -15 -10 -5 0 5 10 octave> octave> For more detailed explanation, we can use “set options” to modify the defaulted output, such as the tics, title and format etc. In the following example, we will use the octave command: gsplot(3d data) − to plot a 3D curve: ( x( t) , y( t) , z( t)) = ( cos2πt, sin2πt,t) Actually, the former ( x( t) , y( t)) pair is come from the Euler formulae, famous complex number: e 2πıt = cos2πt + ısin2πt where ı is √ 1 − octave> t=linspace(0,3,200); Define the particle position ( x( t) , y( t) , z( t)) in parametric form octave> x=cos(2*pi*t); octave> y=sin(2*pi*t); octave> z=t; octave> wave = [x’,y’,z’]; octave> grid Plot a parametric graph octave> gset parametric octave> gset ticslevel 0 set up format of the the output and save octave> gset term postscript enhanced eps color octave> gset out "/tmp/wave.eps" Plot the the graph with 3D data octave> gsplot wave octave> The example describe and the result is as follows: line 1 3 2.5 2 1.5 1 0.5 1 0.6 0.8 0 0.2 0.4 -1-0.8 0 -0.6-0.4-0.2 -0.4-0.2 0 0.2 0.4 -0.8-0.6 0.6 0.8 1 -1 Figure 1. Euler Representation Nowadays, this formulae is very useful to describe how the wireless network works! Exercise 3. Plot the graph of function, y = sin( x)/x, around x = 0. and gauss what the limit of y at x = 0 is. 1.4. ODE simulations One of the powers of Octave is modeling and simulations. The following example is to simulate the system of ODEs (Ordinary Differential Equation): dx ( t) 1 = 10( x ( t) x ( t)) dt − 1 − 2 dx ( t) 2 = 28x ( t) x ( t) x ( t) x ( t) dt 1 − 2 − 1 3 dx ( t) 8 3 = ( x ( t) x ( t) x ( t) ) dt 3 1 2 − 3 Initial condition: x1 (0) = 2, x2(0) = 5, x3(0) = 10 and output the resulted in postscript format: Initial condition: octave> x0=[2;5;10]; octave> t = linspace (0,10,800); The Differential Equations octave> function dx = butter (x ,t) dx(1) = -10.0*(x(1)-x(2)); dx(2) = 28.0*x(1)-x(2)-x(1)*x(3); dx(3) = 8.0/3.0*( x(1)*x(2) -x(3) ); end; Solve the DE numerically octave> y=lsode("butter",x0,t); octave> gset parametric; octave> gset term postscript enhanced color eps; octave> gset xtics 10;gset ytics 10; gset ztics 10; Output the result in eps format octave> gset out "/tmp/butterfly.eps"; octave> gsplot y title "Butterfly Effect" octave> At the last part of Octave code, we first save the 3D trajectory as butterfly.eps in /tmp directory. Then we can embed this EPS file into the worksheet as follows: Butterfly Effect 50 40 30 20 10 0 20 10 -20 0 -10 0 -10 10 20 -20 Figure 2. Butterfly Effect In the small octave codes, the first part shows the operation about linear algebra, multiplication, inverse and signalization of matrix. The second part shows the graph capacity of Octave, 2D and 3D graphs. 2D graphs can be automatically embedded into the worksheet but 3D graphs are not. You have to save the results somewhere and insert the results. You can download from http://octave.sf.net Exercise 4. (van der Pol Equation) Consider the following initial value problem: d2 x dx (1 x2 ) + x = 0 dt2 − − dt x(0) = 0 dx (0) = 1 dt a) Plot the graph for ( t, x( t)) within 10 unit time. b) Plot the parametric graph for ( x( t) , x ′( t)) . Hint: Consider the vector, Iy : x( t) Iy = x ( t) ′ and transform the original second order ODE of x( t) into first ODE of y( t) : y ( t) ′ y = 1 ′ y ( t) 2 x ( t) = ′ x ( t) ′′ y1′ ( t) = y2 ( t) 2 y′ ( t) = (1 y ( t) ) y ( t) y ( t) 2 − 1 2 − 1 Finally, the system of ODE’s becomes y ( t) y ( t) y = 1′ = 2 ′ y ( t) (1 y ( t) 2 ) y ( t) y ( t) 2′ ! − 1 2 − 1 Exercise 5. Challenge problem. 226 The differential equation for the famous Rutherford’s experiment, emitted α-particle toward Ra88 particle is as followed: 2 2 d x Zα ZAue x 2 = 3 dt 4πε0mα r 2 2 d y Zα ZAue y 2 = 3 dt 4πε0mα r where the velocity of α is v0 = 0.053[ c] . After all, the equations become: d2 x x = 0.0164 dt2 r3 d2 y y = 0.0164 dt2 r3 A simulation is as follows: Figure 3. Rutherford Scattering Simulation Derive the equations into first order system ODE’s for Ip ( t) = ( x( t); x ′( t); y( t); y′( t)) . 1.5. ODE Revisited 1.5.1. Newton Scheme Remember the great Newton’s linear approximation: f( xi +1 ) f( xi) + f ′( xi 1 ) ∆x ∼ − · where ∆x is the unit length for x partition. Consider the following mechanical problem: L θ1 L1 W1 L4 θ2 W2 W L2 3 θ θ3 4 L3 where Li , i = 1 , 2, 3, 4, is the length for each section, Wi , i = 1 , 2, 3, is the weight of the hang ball and θi , 1 , 2, 3, 4 is the angle between the horizontal level and the line section at each ball. The governed equations for this system are as follows : 4 Li cos θi L = 0 − i =1 X 4 Li sin θi = 0 i =1 X f( xi) f( xi ) cos θi = 0 ( where i = 1 , 2, 3) − +1 +1 f( xi) f( xi ) sin θi Wi = 0 ( where i = 1 , 2, 3) − +1 +1 − In this octave example, the values for the weight ( W2, 1 6 W2 6 3) and the total length, ( L, 1 6 L 6 4) have to be input by user.
Recommended publications
  • Using Macaulay2 Effectively in Practice
    Using Macaulay2 effectively in practice Mike Stillman ([email protected]) Department of Mathematics Cornell 22 July 2019 / IMA Sage/M2 Macaulay2: at a glance Project started in 1993, Dan Grayson and Mike Stillman. Open source. Key computations: Gr¨obnerbases, free resolutions, Hilbert functions and applications of these. Rings, Modules and Chain Complexes are first class objects. Language which is comfortable for mathematicians, yet powerful, expressive, and fun to program in. Now a community project Journal of Software for Algebra and Geometry (started in 2009. Now we handle: Macaulay2, Singular, Gap, Cocoa) (original editors: Greg Smith, Amelia Taylor). Strong community: including about 2 workshops per year. User contributed packages (about 200 so far). Each has doc and tests, is tested every night, and is distributed with M2. Lots of activity Over 2000 math papers refer to Macaulay2. History: 1976-1978 (My undergrad years at Urbana) E. Graham Evans: asked me to write a program to compute syzygies, from Hilbert's algorithm from 1890. Really didn't work on computers of the day (probably might still be an issue!). Instead: Did computation degree by degree, no finishing condition. Used Buchsbaum-Eisenbud \What makes a complex exact" (by hand!) to see if the resulting complex was exact. Winfried Bruns was there too. Very exciting time. History: 1978-1983 (My grad years, with Dave Bayer, at Harvard) History: 1978-1983 (My grad years, with Dave Bayer, at Harvard) I tried to do \real mathematics" but Dave Bayer (basically) rediscovered Groebner bases, and saw that they gave an algorithm for computing all syzygies. I got excited, dropped what I was doing, and we programmed (in Pascal), in less than one week, the first version of what would be Macaulay.
    [Show full text]
  • GNU/Linux AI & Alife HOWTO
    GNU/Linux AI & Alife HOWTO GNU/Linux AI & Alife HOWTO Table of Contents GNU/Linux AI & Alife HOWTO......................................................................................................................1 by John Eikenberry..................................................................................................................................1 1. Introduction..........................................................................................................................................1 2. Symbolic Systems (GOFAI)................................................................................................................1 3. Connectionism.....................................................................................................................................1 4. Evolutionary Computing......................................................................................................................1 5. Alife & Complex Systems...................................................................................................................1 6. Agents & Robotics...............................................................................................................................1 7. Statistical & Machine Learning...........................................................................................................2 8. Missing & Dead...................................................................................................................................2 1. Introduction.........................................................................................................................................2
    [Show full text]
  • Bringing GNU Emacs to Native Code
    Bringing GNU Emacs to Native Code Andrea Corallo Luca Nassi Nicola Manca [email protected] [email protected] [email protected] CNR-SPIN Genoa, Italy ABSTRACT such a long-standing project. Although this makes it didactic, some Emacs Lisp (Elisp) is the Lisp dialect used by the Emacs text editor limitations prevent the current implementation of Emacs Lisp to family. GNU Emacs can currently execute Elisp code either inter- be appealing for broader use. In this context, performance issues preted or byte-interpreted after it has been compiled to byte-code. represent the main bottleneck, which can be broken down in three In this work we discuss the implementation of an optimizing com- main sub-problems: piler approach for Elisp targeting native code. The native compiler • lack of true multi-threading support, employs the byte-compiler’s internal representation as input and • garbage collection speed, exploits libgccjit to achieve code generation using the GNU Com- • code execution speed. piler Collection (GCC) infrastructure. Generated executables are From now on we will focus on the last of these issues, which con- stored as binary files and can be loaded and unloaded dynamically. stitutes the topic of this work. Most of the functionality of the compiler is written in Elisp itself, The current implementation traditionally approaches the prob- including several optimization passes, paired with a C back-end lem of code execution speed in two ways: to interface with the GNU Emacs core and libgccjit. Though still a work in progress, our implementation is able to bootstrap a func- • Implementing a large number of performance-sensitive prim- tional Emacs and compile all lexically scoped Elisp files, including itive functions (also known as subr) in C.
    [Show full text]
  • GNU MP the GNU Multiple Precision Arithmetic Library Edition 6.2.1 14 November 2020
    GNU MP The GNU Multiple Precision Arithmetic Library Edition 6.2.1 14 November 2020 by Torbj¨ornGranlund and the GMP development team This manual describes how to install and use the GNU multiple precision arithmetic library, version 6.2.1. Copyright 1991, 1993-2016, 2018-2020 Free Software Foundation, Inc. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with no Invariant Sections, with the Front-Cover Texts being \A GNU Manual", and with the Back-Cover Texts being \You have freedom to copy and modify this GNU Manual, like GNU software". A copy of the license is included in Appendix C [GNU Free Documentation License], page 132. i Table of Contents GNU MP Copying Conditions :::::::::::::::::::::::::::::::::::: 1 1 Introduction to GNU MP ::::::::::::::::::::::::::::::::::::: 2 1.1 How to use this Manual :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 2 2 Installing GMP ::::::::::::::::::::::::::::::::::::::::::::::::: 3 2.1 Build Options:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 3 2.2 ABI and ISA :::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 8 2.3 Notes for Package Builds:::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 11 2.4 Notes for Particular Systems :::::::::::::::::::::::::::::::::::::::::::::::::::::: 12 2.5 Known Build Problems ::::::::::::::::::::::::::::::::::::::::::::::::::::::::::: 14 2.6 Performance
    [Show full text]
  • An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
    An Industrial Strength Theorem Prover for a Logic Based on Common Lisp y z Matt Kaufmannand J Strother Moore Personal use of this material is permitted. particular style of formal veri®cation that has shown consid- However, permission to reprint/republish this erable promise in recent years is the use of general-purpose material for advertising or promotional pur- automated reasoning systems to model systems and prove poses or for creating new collective works for properties of them. Every such reasoning system requires resale or redistribution to servers or lists, or considerable assistance from the user, which makes it im- to reuse any copyrighted component of this portant that the system provide convenient ways for the user work in other works must be obtained from the to interact with it. IEEE.1 One state-of-the-art general-purpose automated reason- ing system is ACL2: ªA Computational Logic for Applica- AbstractÐACL2 is a re-implemented extended version tive Common Lisp.º A number of automated reasoning of Boyer and Moore's Nqthm and Kaufmann's Pc-Nqthm, systems now exist, as we discuss below (Subsection 1.1). In intended for large scale veri®cation projects. This paper this paper we describe ACL2's offerings to the user for con- deals primarily with how we scaled up Nqthm's logic to an venientªindustrial-strengthºuse. WebegininSection2with ªindustrial strengthº programming language Ð namely, a a history of theACL2 project. Next, Section 3 describes the large applicative subset of Common Lisp Ð while preserv- logic supportedby ACL2, which has been designed for con- ing the use of total functions within the logic.
    [Show full text]
  • Research in Algebraic Geometry with Macaulay2
    Research in Algebraic Geometry with Macaulay2 1 Macaulay2 a software system for research in algebraic geometry resultants the community, packages, the journal, and workshops 2 Tutorial the ideal of a monomial curve elimination: projecting the twisted cubic quotients and saturation 3 the package PHCpack.m2 solving polynomial systems numerically MCS 507 Lecture 39 Mathematical, Statistical and Scientific Software Jan Verschelde, 25 November 2019 Scientific Software (MCS 507) Macaulay2 L-39 25November2019 1/32 Research in Algebraic Geometry with Macaulay2 1 Macaulay2 a software system for research in algebraic geometry resultants the community, packages, the journal, and workshops 2 Tutorial the ideal of a monomial curve elimination: projecting the twisted cubic quotients and saturation 3 the package PHCpack.m2 solving polynomial systems numerically Scientific Software (MCS 507) Macaulay2 L-39 25November2019 2/32 Macaulay2 D. R. Grayson and M. E. Stillman: Macaulay2, a software system for research in algebraic geometry, available at https://faculty.math.illinois.edu/Macaulay2. Funded by the National Science Foundation since 1992. Its source is at https://github.com/Macaulay2/M2; licence: GNU GPL version 2 or 3; try it online at http://habanero.math.cornell.edu:3690. Several workshops are held each year. Packages extend the functionality. The Journal of Software for Algebra and Geometry (at https://msp.org/jsag) started its first volume in 2009. The SageMath interface to Macaulay2 requires its binary M2 to be installed on your computer. Scientific
    [Show full text]
  • An Alternative Algorithm for Computing the Betti Table of a Monomial Ideal 3
    AN ALTERNATIVE ALGORITHM FOR COMPUTING THE BETTI TABLE OF A MONOMIAL IDEAL MARIA-LAURA TORRENTE AND MATTEO VARBARO Abstract. In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the way of describing the method, we also prove new constraints on the shape of the possible Betti tables of a monomial ideal. 1. Introduction Since many years syzygies, and more generally free resolutions, are central in purely theo- retical aspects of algebraic geometry; more recently, after the connection between algebra and statistics have been initiated by Diaconis and Sturmfels in [DS98], free resolutions have also become an important tool in statistics (for instance, see [D11, SW09]). As a consequence, it is fundamental to have efficient algorithms to compute them. The usual approach uses Gr¨obner bases and exploits a result of Schreyer (for more details see [Sc80, Sc91] or [Ei95, Chapter 15, Section 5]). The packages for free resolutions of the most used computer algebra systems, like [Macaulay2, Singular, CoCoA], are based on these techniques. In this paper, we introduce a new algorithmic method to compute the minimal graded free resolution of any finitely generated graded module over a polynomial ring such that some (possibly non- minimal) graded free resolution is known a priori. We describe this method and we present the resulting algorithm in the case of monomial ideals in a polynomial ring, in which situ- ation we always have a starting nonminimal graded free resolution.
    [Show full text]
  • 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]
  • What Can Computer Algebraic Geometry Do Today?
    What can computer Algebraic Geometry do today? Gregory G. Smith Wolfram Decker Mike Stillman 14 July 2015 Essential Questions ̭ What can be computed? ̭ What software is currently available? ̭ What would you like to compute? ̭ How should software advance your research? Basic Mathematical Types ̭ Polynomial Rings, Ideals, Modules, ̭ Varieties (affine, projective, toric, abstract), ̭ Sheaves, Divisors, Intersection Rings, ̭ Maps, Chain Complexes, Homology, ̭ Polyhedra, Graphs, Matroids, ̯ Established Geometric Tools ̭ Elimination, Blowups, Normalization, ̭ Rational maps, Working with divisors, ̭ Components, Parametrizing curves, ̭ Sheaf Cohomology, ঠ-modules, ̯ Emerging Geometric Tools ̭ Classification of singularities, ̭ Numerical algebraic geometry, ̭ ैक़௴Ь, Derived equivalences, ̭ Deformation theory,Positivity, ̯ Some Geometric Successes ̭ GEOGRAPHY OF SURFACES: exhibiting surfaces with given invariants ̭ BOIJ-SÖDERBERG: examples lead to new conjectures and theorems ̭ MODULI SPACES: computer aided proofs of unirationality Some Existing Software ̭ GAP,Macaulay2, SINGULAR, ̭ CoCoA, Magma, Sage, PARI, RISA/ASIR, ̭ Gfan, Polymake, Normaliz, 4ti2, ̭ Bertini, PHCpack, Schubert, Bergman, an idiosyncratic and incomplete list Effective Software ̭ USEABLE: documented examples ̭ MAINTAINABLE: includes tests, part of a larger distribution ̭ PUBLISHABLE: Journal of Software for Algebra and Geometry; www.j-sag.org ̭ CITATIONS: reference software Recent Developments in Singular Wolfram Decker Janko B¨ohm, Hans Sch¨onemann, Mathias Schulze Mohamed Barakat TU Kaiserslautern July 14, 2015 Wolfram Decker (TU-KL) Recent Developments in Singular July 14, 2015 1 / 24 commutative and non-commutative algebra, singularity theory, and with packages for convex and tropical geometry. It is free and open-source under the GNU General Public Licence.
    [Show full text]
  • Unix Quickref.Dvi
    Summary of UNIX commands Table of Contents df [dirname] display free disk space. If dirname is omitted, 1. Directory and file commands 1994,1995,1996 Budi Rahardjo ([email protected]) display all available disks. The output maybe This is a summary of UNIX commands available 2. Print-related commands in blocks or in Kbytes. Use df -k in Solaris. on most UNIX systems. Depending on the config- uration, some of the commands may be unavailable 3. Miscellaneous commands du [dirname] on your site. These commands may be a commer- display disk usage. cial program, freeware or public domain program that 4. Process management must be installed separately, or probably just not in less filename your search path. Check your local documentation or 5. File archive and compression display filename one screenful. A pager similar manual pages for more details (e.g. man program- to (better than) more. 6. Text editors name). This reference card, obviously, cannot de- ls [dirname] scribe all UNIX commands in details, but instead I 7. Mail programs picked commands that are useful and interesting from list the content of directory dirname. Options: a user's point of view. 8. Usnet news -a display hidden files, -l display in long format 9. File transfer and remote access mkdir dirname Disclaimer make directory dirname The author makes no warranty of any kind, expressed 10. X window or implied, including the warranties of merchantabil- more filename 11. Graph, Plot, Image processing tools ity or fitness for a particular purpose, with regard to view file filename one screenfull at a time the use of commands contained in this reference card.
    [Show full text]
  • GNU Texmacs User Manual Joris Van Der Hoeven
    GNU TeXmacs User Manual Joris van der Hoeven To cite this version: Joris van der Hoeven. GNU TeXmacs User Manual. 2013. hal-00785535 HAL Id: hal-00785535 https://hal.archives-ouvertes.fr/hal-00785535 Preprint submitted on 6 Feb 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. GNU TEXMACS user manual Joris van der Hoeven & others Table of contents 1. Getting started ...................................... 11 1.1. Conventionsforthismanual . .......... 11 Menuentries ..................................... 11 Keyboardmodifiers ................................. 11 Keyboardshortcuts ................................ 11 Specialkeys ..................................... 11 1.2. Configuring TEXMACS ..................................... 12 1.3. Creating, saving and loading documents . ............ 12 1.4. Printingdocuments .............................. ........ 13 2. Writing simple documents ............................. 15 2.1. Generalities for typing text . ........... 15 2.2. Typingstructuredtext ........................... ......... 15 2.3. Content-basedtags
    [Show full text]
  • The Reesalgebra Package in Macaulay2
    Journal of Software for Algebra and Geometry The ReesAlgebra package in Macaulay2 DAVID EISENBUD vol 8 2018 JSAG 8 (2018), 49–60 The Journal of Software for dx.doi.org/10.2140/jsag.2018.8.49 Algebra and Geometry The ReesAlgebra package in Macaulay2 DAVID EISENBUD ABSTRACT: This note introduces Rees algebras and some of their uses, with illustrations from version 2.2 of the Macaulay2 package ReesAlgebra.m2. INTRODUCTION. A central construction in modern commutative algebra starts from an ideal I in a commutative ring R, and produces the Rees algebra R.I / VD R ⊕ I ⊕ I 2 ⊕ I 3 ⊕ · · · D∼ RTI tU ⊂ RTtU; where RTtU denotes the polynomial algebra in one variable t over R. For basics on Rees algebras, see[Vasconcelos 1994] and[Swanson and Huneke 2006], and for some other research, see[Eisenbud and Ulrich 2018; Kustin and Ulrich 1992; Ulrich 1994], and[Valabrega and Valla 1978]. From the point of view of algebraic geometry, the Rees algebra R.I / is a homo- geneous coordinate ring for the graph of a rational map whose total space is the blowup of Spec R along the scheme defined by I. (In fact, the “Rees algebra” is sometimes called the “blowup algebra”.) Rees algebras were first studied in the algebraic context by David Rees, in the now-famous paper[Rees 1958]. Actually, Rees mainly studied the ring RTI t; t−1U, now also called the extended Rees algebra of I. Mike Stillman and I wrote a Rees algebra script for Macaulay classic. It was aug- mented, and made into the[Macaulay2] package ReesAlgebra.m2 around 2002, to study a generalization of Rees algebras to modules described in[Eisenbud et al.
    [Show full text]