DOCSLIB.ORG

Computational Topology with Regina: Algorithms, Heuristics and Implementations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Computational Topology with Regina: Algorithms, Heuristics and Implementations COMPUTATIONAL TOPOLOGY WITH REGINA: ALGORITHMS, HEURISTICS AND IMPLEMENTATIONS BENJAMIN A. BURTON Dedicated to J. Hyam Rubinstein Author's self-archived version Available from http://www.maths.uq.edu.au/~bab/papers/ Abstract. Regina is a software package for studying 3-manifold triangula- tions and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combina- torial recognition of triangulations, and high-level functions such as 3-sphere recognition, unknot recognition and connected sum decomposition. This paper brings 3-manifold topologists up-to-date with Regina as it ap- pears today, and documents for the first time in the literature some of the key algorithms, heuristics and implementations that are central to Regina's perfor- mance. These include the all-important simplification heuristics, key choices of data structures and algorithms to alleviate bottlenecks in normal surface enumeration, modern implementations of 3-sphere recognition and connected sum decomposition, and more. We also give some historical background for the project, including the key role played by Rubinstein in its genesis 15 years ago, and discuss current directions for future development. 1. Introduction Algorithmic problems run to the heart of low-dimensional topology. Promi- nent amongst these are decision problems (e.g., recognising the unknot, or testing whether two triangulated manifolds are homeomorphic); decomposition problems (e.g., decomposing a triangulated manifold into a connected sum of prime mani- folds); and recognition problems (e.g., \naming" the manifold described by a given triangulation). For 3-manifolds in particular, such problems typically have highly complex and expensive solutions|running times are often exponential or super-exponential, and implementations are often major endeavours developed over many years (if they exist at all). This is in contrast to dimension two, where many such problems are easily solved in small polynomial time, and dimensions ≥ 4, where such problems can become provably undecidable [21, 40]. Regina [5, 14] is a software package for low-dimensional topologists and knot theorists. Its main focus is on triangulated 3-manifolds, though it is now branch- ing into both two and four dimensions also (see Section 7). It provides powerful 2000 Mathematics Subject Classification. Primary 57-04, 57N10; Secondary 68W05, 57Q15. Key words and phrases. 3-manifolds, algorithms, software, simplification, normal surfaces, recognition, angle structures. The author is supported by the Australian Research Council under the Discovery Projects funding scheme (projects DP1094516 and DP110101104). 1 2 BENJAMIN A. BURTON algorithms and heuristics to assist with decision, decomposition and recognition problems; more broadly, it includes a range of facilities to study and manipulate 3-manifold triangulations. It offers rich support for normal surface theory, a major algorithmic framework that recurs throughout 3-manifold topology. One of Regina's most important uses is for experimentation: it can analyse a single example too large to study by hand, or millions of examples \in bulk". Other uses include computer proofs, such as the recent resolution of Thurston's old ques- tion of whether the Weber-Seifert dodecahedral space is non-Haken [18], and calcu- lation of previously-unknown topological invariants, such as recent improvements to crosscap numbers in knot tables [13, 15]. The remainder of this introduction gives a brief overview of Regina and some history behind its early development, back to its genesis with Rubinstein 15 years ago. Following this, we select some of Regina's most important features and study the modern heuristics, algorithms and implementations behind them. Some of these details are crucial for Regina's fast performance, but have not appeared in the literature to date. Overall, this paper offers a fresh update on the significant progress and performance enhancements in the eight years since Regina's last major report in the literature [5]. The specific features that we focus on are: • the process of simplifying triangulations, which plays a critical role in many of Regina's high-level algorithms; • the enumeration of normal and almost normal surfaces, including the high- level 0-efficiency, 3-sphere recognition and connected sum decomposition algorithms; • combinatorial recognition, whereby Regina attempts to recognise a trian- gulation by studying its combinatorial structure; • the enumeration of angle structures, taut angle structures and veering struc- tures on triangulations. With respect to these features, there are interesting new developments in the pipeline. Examples include \breadth-first simplification” of triangulations, the tree traversal algorithm for enumerating vertex normal surfaces, and new 0-efficiency and 3-sphere recognition algorithms based on linear programming that exhibit ex- perimental polynomial-time behaviour. The corresponding code is already written (it is now being tested and prepared for integration into Regina), and we outline these new developments in the relevant sections of this paper. To finish, Section 6 gives concrete examples of how Regina can be used for experimentation, including an introduction to Regina's in-built Python scripting, so that interested readers can use these as launching points for their own experiments. Section 7 concludes with additional future directions for Regina, including new work with Ryan Budney on triangulated 4-manifolds, much of which is already coded and running in the development repository. 1.1. Overview of Regina. Regina is now 13 years old, with over 190 000 lines of source code. It is released under the GNU General Public License, and contribu- tions from the research community are welcome. It adheres to the following broad development principles, in order of precedence: (1) Correctness: Having correct output is critical, particularly for applications such as computer proofs. Regina is extremely conservative in this regard: COMPUTATIONAL TOPOLOGY WITH REGINA 3 for example, it will use arbitrary precision integer arithmetic if it cannot be proven unnecessary, and the API documentation makes thorough use of preconditions and postconditions. (2) Generality: Algorithms operate in the broadest possible scenarios (within reason), and do not require preconditions that cannot be easily tested. For instance, unknot recognition runs correctly for both bounded and ideal triangulations, and even when the input triangulation is not known to be a knot complement (whereupon it generalises to solid torus recognition). (3) Speed: Because many of its algorithms run in exponential or super-exponen- tial time, speed is imperative. Regina makes use of sophisticated algorithms and heuristics that, whilst adhering to the constraints of correctness and generality, make it practical for real topological problems. Regina is multi-platform, and offers a drag-and-drop installer for MacOS, an MSI-based installer for Windows, and ready-made packages for several GNU/Linux distributions. It is thoroughly documented, and stores its data files in a compressed XML format. Regina provides three levels of user interface: • a full graphical user interface, based on the Qt framework [48]; • a scripting interface based on Python, which can interact with the graphical interface or be used a standalone Python module; • a programmers' interface offering native access to Regina's mathematical core through a C++ shared library. There are facilities to help new users learn their way around, including an illus- trated users' handbook, context-sensitive \what's this?" help, and sample data files that can be opened through the File −! Open Example menu. Regina's core strengths are in working with triangulations, normal surfaces and angle structures. It only offers basic support for hyperbolic geometries, for which the software packages SnapPea [60] and its successor SnapPy [23] are more suitable. In addition to its range of low-level operations and 3-manifold invari- ants, Regina includes implementations of high-level decision and decomposition algorithms, including the only known full implementations of 3-sphere recogni- tion and connected sum decomposition. For a comprehensive list of features, see http://regina.sourceforge.net/docs/featureset.html. 1.2. History. In the 1990s, Jeff Weeks' software package SnapPea had opened up enormous possibilities for computer experimentation with hyperbolic 3-mani- folds. In contrast, outside the hyperbolic world many fundamental 3-manifold algorithms remained purely theoretical, including high-profile algorithms such as 3-sphere recognition, connected sum decomposition, Haken's unknot recognition algorithm, and testing for incompressible surfaces. More broadly, normal surface theory|a ubiquitous technology in algorithmic 3-manifold topology|had no concrete software implementation (or at least none that had been publicised). Many of the algorithms that used normal surfaces were so complex that it was believed that any attempt at implementation would be both painstaking to develop and impractically slow to run. Nevertheless, Rubinstein sought to move these algorithms from the theoretical realm to the practical, and in 1997 he assembled a team for a new software project that would make computational normal surface theory a reality. This initial team consisted of David Letscher, Richard Rannard, and myself. Much planning was 4 BENJAMIN A. BURTON done and a little preliminary code
Load more

Recommended publications
  • Of the American Mathematical Society August 2017 Volume 64, Number 7
    ISSN 0002-9920 (print) ISSN 1088-9477 (online) of the American Mathematical Society August 2017 Volume 64, Number 7 The Mathematics of Gravitational Waves: A Two-Part Feature page 684 The Travel Ban: Affected Mathematicians Tell Their Stories page 678 The Global Math Project: Uplifting Mathematics for All page 712 2015–2016 Doctoral Degrees Conferred page 727 Gravitational waves are produced by black holes spiraling inward (see page 674). American Mathematical Society LEARNING ® MEDIA MATHSCINET ONLINE RESOURCES MATHEMATICS WASHINGTON, DC CONFERENCES MATHEMATICAL INCLUSION REVIEWS STUDENTS MENTORING PROFESSION GRAD PUBLISHING STUDENTS OUTREACH TOOLS EMPLOYMENT MATH VISUALIZATIONS EXCLUSION TEACHING CAREERS MATH STEM ART REVIEWS MEETINGS FUNDING WORKSHOPS BOOKS EDUCATION MATH ADVOCACY NETWORKING DIVERSITY blogs.ams.org Notices of the American Mathematical Society August 2017 FEATURED 684684 718 26 678 Gravitational Waves The Graduate Student The Travel Ban: Affected Introduction Section Mathematicians Tell Their by Christina Sormani Karen E. Smith Interview Stories How the Green Light was Given for by Laure Flapan Gravitational Wave Research by Alexander Diaz-Lopez, Allyn by C. Denson Hill and Paweł Nurowski WHAT IS...a CR Submanifold? Jackson, and Stephen Kennedy by Phillip S. Harrington and Andrew Gravitational Waves and Their Raich Mathematics by Lydia Bieri, David Garfinkle, and Nicolás Yunes This season of the Perseid meteor shower August 12 and the third sighting in June make our cover feature on the discovery of gravitational waves
    [Show full text]
  • Non-Orientable Lagrangian Cobordisms Between Legendrian Knots
    NON-ORIENTABLE LAGRANGIAN COBORDISMS BETWEEN LEGENDRIAN KNOTS ORSOLA CAPOVILLA-SEARLE AND LISA TRAYNOR 3 Abstract. In the symplectization of standard contact 3-space, R × R , it is known that an orientable Lagrangian cobordism between a Leg- endrian knot and itself, also known as an orientable Lagrangian endo- cobordism for the Legendrian knot, must have genus 0. We show that any Legendrian knot has a non-orientable Lagrangian endocobordism, and that the crosscap genus of such a non-orientable Lagrangian en- docobordism must be a positive multiple of 4. The more restrictive exact, non-orientable Lagrangian endocobordisms do not exist for any exactly fillable Legendrian knot but do exist for any stabilized Legen- drian knot. Moreover, the relation defined by exact, non-orientable La- grangian cobordism on the set of stabilized Legendrian knots is symmet- ric and defines an equivalence relation, a contrast to the non-symmetric relation defined by orientable Lagrangian cobordisms. 1. Introduction Smooth cobordisms are a common object of study in topology. Motivated by ideas in symplectic field theory, [19], Lagrangian cobordisms that are cylindrical over Legendrian submanifolds outside a compact set have been an active area of research interest. Throughout this paper, we will study 3 Lagrangian cobordisms in the symplectization of the standard contact R , 3 t namely the symplectic manifold (R×R ; d(e α)) where α = dz−ydx, that co- incide with the cylinders R×Λ+ (respectively, R×Λ−) when the R-coordinate is sufficiently positive (respectively, negative). Our focus will be on non- orientable Lagrangian cobordisms between Legendrian knots Λ+ and Λ− and non-orientable Lagrangian endocobordisms, which are non-orientable Lagrangian cobordisms with Λ+ = Λ−.
    [Show full text]
  • Crosscap Number and Knot Projections
    CROSSCAP NUMBER AND KNOT PROJECTIONS NOBORU ITO AND YUSUKE TAKIMURA Abstract. We introduce an unknotting-type number of knot projections that gives an upper bound of the crosscap number of knots. We determine the set of knot projections with the unknotting-type number at most two, and this result implies classical and new results that determine the set of alternating knots with the crosscap number at most two. 1. Introduction In this paper, we introduce an unknotting-type number of knot projections (Def- inition 1) as follows. Every double point in a knot projection can be spliced two different ways (Figure 2), one of which gives another knot projection (Definition 2). A special case of such operations is a first Reidemeister move RI−, as shown in Fig- ure 2. If the other case of such operations, which is not of type RI−, it is denoted by S−. Beginning with an n-crossing knot projection P , there are many sequences of n splices of type RI− and type S−, all of which end with the simple closed curve O. Then, we define the number u−(P ) as the minimum number of splices of type S− (Definition 3). For this number, we determine the set of knot projections with u−(P ) = 1 or u−(P ) = 2 (Theorem 1, Section 3). Here, we provide an efficient method to obtain a knot projection P with u−(P ) = n for a given n (Move 1). Further, for a connected sum (Definition 4) of knot projections, we show that the additivity of u− under the connected sum (Section 7).
    [Show full text]
  • Crosscap Numbers of Alternating Knots Via Unknotting Splices
    Crosscap numbers of alternating knots via unknotting splices THOMAS KINDRED Ito-Takimura recently defined a splice-unknotting number u−(D) for knot diagrams. They proved that this number provides an upper bound for the crosscap number of any prime knot, asking whether equality holds in the alternating case. We answer their question in the affirmative. (Ito has independently proven the same result.) As an application, we compute the crosscap numbers of all prime alternating knots through at least 13 crossings, using Gauss codes. 57M25 1 Introduction Let K ⊂ S3 be a knot. An embedded, compact, connected surface F ⊂ S3 is said to span K if @F = K . The crosscap number of K , denoted cc(K), is the smallest value of 12 β1(F) among all 1-sided spanning surfaces for K. A theorem of Adams and the author [4] states that, given an alternating diagram D of a knot K, the crosscap number of K is realized by some state surface from D. (Section 2 reviews background.) Moreover, given such D and K, an algorithm in [4] finds a 1-sided state surface F from D with β1(F) = cc(K). Ito-Takimura recently introduced a splice-unknotting number u−(D) for knot diagrams. Minimizing this number across all diagrams of a given knot K defines a knot invariant, arXiv:1905.11367v1 [math.GT] 27 May 2019 u−(K). After proving that u−(D) ≥ cc(K) holds for any diagram D of any nontrivial knot K, Ito-Takimura ask whether this inequality is ever strict in the case of prime alternating diagrams.
    [Show full text]
  • CROSSCAP NUMBERS of PRETZEL KNOTS 1. Introduction It Is Well
    CROSSCAP NUMBERS OF PRETZEL KNOTS 市原 一裕 (KAZUHIRO ICHIHARA) 大阪産業大学教養部 (OSAKA SANGYO UNIVERSITY) 水嶋滋氏 (東京工業大学大学院情報理工学研究科) との共同研究 (JOINT WORK WITH SHIGERU MIZUSHIMA (TOKYO INSTITUTE OF TECHNOLOGY)) Abstract. For a non-trivial knot in the 3-sphere, the crosscap number is de¯ned as the minimal ¯rst betti number of non-orientable spanning surfaces for it. In this article, we report a simple formula of the crosscap number for pretzel knots. 1. Introduction It is well-known that any knot in the 3-sphere S3 bounds an orientable subsurface in S3; called a Seifert surface. One of the most basic invariant in knot theory, the genus of a knot K, is de¯ned to be the minimal genus of a Seifert surface for K. On the other hand, any knot in S3 also bounds a non-orientable subsurface in S3: Consider checkerboard surfaces for a diagram of the knot, one of which is shown to be non-orientable. In view of this, similarly as the genus of a knot, B.E. Clark de¯ned the crosscap number of a knot as follows. De¯nition (Clark, [1]). The crosscap number γ(K) of a knot K is de¯ned to be the minimal ¯rst betti number of a non-orientable surface spanning K in S3. For completeness we de¯ne γ(K) = 0 if and only if K is the unknot. Example. The ¯gure-eight knot K in S3 bounds a once-punctured Klein bottle S, appearing as a checkerboard surface for the diagram of K with minimal crossings. Thus γ(K) · ¯1(S) = 2.
    [Show full text]
  • Arxiv:1604.04901V3 [Math.GT] 26 Aug 2018 K 7→ P(K) for Any Knot K
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by MPG.PuRe ON THE UPSILON INVARIANT AND SATELLITE KNOTS PETER FELLERy, JUNGHWAN PARKyy, AND ARUNIMA RAYyyy Abstract. We study the effect of satellite operations on the Upsilon invariant of Ozsvath–Stipsicz–´ Szabo.´ We obtain results concerning when a knot and its satellites are independent; for example, we 1 show that the set fD2i;1gi=1 is a basis for an infinite rank summand of the group of smooth concordance classes of topologically slice knots, for D the positive clasped untwisted Whitehead double of any knot with positive τ–invariant, e.g. the right-handed trefoil. We also prove that the image of the Mazur satellite operator on the smooth knot concordance group contains an infinite rank subgroup of topologically slice knots. 1. Introduction Two knots K and J are said to be smoothly concordant if they cobound a smoothly embedded annulus in S 3 × [0; 1]; if they cobound a locally flat annulus, they are said to be topologically con- cordant. While we will suppress orientations in this text, we note that knots are oriented connected smooth 1-submanifolds (of S 3 if not otherwise specified) and in the above definition of concordance the induced orientations of the annulus has to agree on one knot and disagree on the other knot. A knot is smoothly slice if it bounds a smooth disk in B4, or equivalently, is smoothly concordant to the unknot U. Similarly, a knot is topologically slice if it bounds a locally flat disk in B4 or is topo- logically concordant to U.
    [Show full text]
  • Various Crosscap Numbers of Knots and Links
    Various Crosscap Numbers of Knots and Links Gengyu Zhang November 2008 Contents 1 Introduction 1 2 Preliminaries 5 2.1 Signature de ned by using Seifert matrix and Seifert surface . 7 2.2 Alternative way to calculate the signature for a link . 9 2.2.1 De nition of Goeritz matrix . 9 2.2.2 Alternative de nition for Goeritz matrix . 10 2.2.3 Signature of a link by Gordon and Litherland . 11 2.3 Linking form of a link . 13 2.3.1 Linking form of a 3-manifold . 13 2.3.2 Relation between linking form and Goeritz matrix . 13 2.4 Integral binary quadratic form . 14 3 Various orientable genera of knots 18 3.1 Three-dimensional knot genus . 18 3.2 Four-dimensional knot genus . 21 3.3 Concordance genus and relations with others . 22 4 Crosscap numbers of knots 24 i 4.1 Three-dimensional crosscap number . 24 4.2 Four-dimensional crosscap number . 28 5 Crosscap numbers of two-component links 30 5.1 De nitions . 31 5.2 Behavior of crosscap numbers under split union . 33 5.3 Upper bounds of crosscap numbers of two-component links . 37 5.4 An example of calculation . 41 5.5 Problems yet to solve . 49 6 Concordance crosscap number of a knot 51 6.1 Preliminaries . 52 6.2 Examples constructed from Seifert surfaces . 55 6.3 Examples constructed from non-orientable surfaces . 59 6.4 Further development by others . 62 ii List of Figures 2.1 Two-bridge knots . 6 2.2 Pretzel knot .
    [Show full text]
  • A Classification of Spanning Surfaces for Alternating Links 1 Introduction
    A Classification of Spanning Surfaces for Alternating Links COLIN ADAMS THOMAS KINDRED A classification of spanning surfaces for alternating links is provided up to genus, orientability, and a new invariant that we call aggregate slope. That is, given an alternating link, we determine all possible combinations of genus, orientability, and aggregate slope that a surface spanning that link can have. To this end, we describe a straightforward algorithm, much like Seifert’s Algorithm, through which to construct certain spanning surfaces called state surfaces, obtained by splitting each crossing one of the two ways, filling in the resulting circles with disks and connecting these disks with half twisted bands at the crossings. A particularly important subset of these will be what we call basic state surfaces. We can alter these surfaces by performing the entirely local operations of adding handles and/or crosscaps, each of which increases genus. The main result then shows that if we are given an alternating projection P(L) and a surface S spanning L, we can construct a surface T spanning L with the same genus, orientability, and aggregate slope as S that is a basic state surface with respect to P, except perhaps at a collection of added crosscaps and/or handles. Furthermore, S must be connected if L is non-splittable. This result has several useful corollaries. In particular, it allows for the determination of nonori- entable genus for alternating links. It also can be used to show that mutancy of alternating links preserves nonorientable genus. And it allows one to prove that there are knots that have a pair of minimal nonorientable genus spanning surfaces, one boundary-incompressible and one boundary-compressible.
    [Show full text]
  • Exact and Fast Algorithms for Mixed-Integer Nonlinear Programming
    Exact and Fast Algorithms for Mixed-Integer Nonlinear Programming vorgelegt von Dipl.-Math. Ambros M. Gleixner aus Landshut von der Fakultat¨ II – Mathematik und Naturwissenschaften der Technischen Universitat¨ Berlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften – Dr. rer. nat. – genehmigte Dissertation Promotionsausschuss Vorsitzender: Prof. Dr. Reinhold Schneider Berichter: Prof. Dr. Dr. h.c. mult. Martin Grotschel¨ Prof. Dr. Thorsten Koch Prof. Dr. Andrea Lodi Tag der wissenschaftlichen Aussprache: 24. Juni 2015 Berlin 2015 D 83 Abstract Mixed-integer nonlinear programming (MINLP) comprises the broad class of finite- dimensional mathematical optimization problems from mixed-integer linear program- ming and global optimization. The combination of the two disciplines allows us to construct more accurate models of real-world systems, while at the same time it in- creases the algorithmic challenges that come with solving them. This thesis presents new methods that improve the numerical reliability and the computational perfor- mance of global MINLP solvers. Since state-of-the-art algorithms for nonconvex MINLP fundamentally rely on solving linear programming (LP) relaxations, we address numerical accuracy directly for LP by means of LP iterative refinement: a new algorithm to solve linear programs to arbitrarily high levels of precision. The thesis is supplemented by an exact extension of the LP solver SoPlex, which proves on average 1.85 to 3 times faster than current state-of-the-art software for solving general linear programs exactly over the rational numbers. These methods can be generalized to quadratic programming. We study their application to numerically difficult multiscale LP models for metabolic networks in systems biology.
    [Show full text]
  • Concordance Crosscap Numbers of Knots and the Alexander Polynomial
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 136, Number 9, September 2008, Pages 3351–3353 S 0002-9939(08)09481-1 Article electronically published on April 25, 2008 CONCORDANCE CROSSCAP NUMBERS OF KNOTS AND THE ALEXANDER POLYNOMIAL CHARLES LIVINGSTON (Communicated by Daniel Ruberman) Abstract. For a knot K the concordance crosscap number, c(K), is the min- imum crosscap number among all knots concordant to K. Building on work of G. Zhang, which studied the determinants of knots with c(K) < 2, we apply the Alexander polynomial to construct new algebraic obstructions to c(K) < 2. With the exception of low crossing number knots previously known to have c(K) < 2, the obstruction applies to all but four prime knots of 11 or fewer crossings. 3 3 ∼ 2 2 Every knot K ⊂ S bounds an embedded surface F ⊂ S with F = #nP − B for some n ≥ 0, where P 2 denotes the real projective plane . The crosscap number of K, γ(K), is defined to be the minimum such n. The careful study of this invariant began with the work of Clark in [Cl]; other references include [HT, MY1]. The study of the 4–dimensional crosscap number, γ4(K), defined similarly but in terms of F ⊂ B4, appears in such articles as [MY2, Vi, Ya]. Gengyu Zhang [Zh] recently introduced a new knot invariant, the concordance crosscap number, γc(K). This is defined to be the minimum crosscap number of any knot concordant to K. This invariant is the nonorientable version of the concordance genus, originally studied by Nakanishi [Na] and Casson [Ca], and later investigated in [Li].
    [Show full text]
  • Bottom Tangles and Universal Invariants
    Algebraic & Geometric Topology 6 (2006) 1113–1214 1113 Bottom tangles and universal invariants KAZUO HABIRO A bottom tangle is a tangle in a cube consisting only of arc components, each of which has the two endpoints on the bottom line of the cube, placed next to each other. We introduce a subcategory B of the category of framed, oriented tangles, which acts on the set of bottom tangles. We give a finite set of generators of B, which provides an especially convenient way to generate all the bottom tangles, and hence all the framed, oriented links, via closure. We also define a kind of “braided Hopf algebra action” on the set of bottom tangles. Using the universal invariant of bottom tangles associated to each ribbon Hopf algebra H , we define a braided functor J from B to the category ModH of left H –modules. The functor J, together with the set of generators of B, provides an algebraic method to study the range of quantum invariants of links. The braided Hopf algebra action on bottom tangles is mapped by J to the standard braided Hopf algebra structure for H in ModH . Several notions in knot theory, such as genus, unknotting number, ribbon knots, boundary links, local moves, etc are given algebraic interpretations in the setting involving the category B. The functor J provides a convenient way to study the relationships between these notions and quantum invariants. 57M27; 57M25, 18D10 1 Introduction The notion of category of tangles (see Yetter[84] and Turaev[80]) plays a crucial role in the study of the quantum link invariants.
    [Show full text]
  • Light Programming Language
    UNIVERSIDADE FEDERAL DO RIO GRANDE DO SUL INSTITUTO DE INFORMÁTICA CURSO DE CIÊNCIA DA COMPUTAÇÃO PEDRO SASSEN VEIGA Light Programming Language Work presented in partial fulfillment of the requirements for the degree of Bachelor in Computer Science Advisor: Prof. Dr. Rodrigo Machado Porto Alegre December 2018 UNIVERSIDADE FEDERAL DO RIO GRANDE DO SUL Reitor: Prof. Rui Vicente Oppermann Vice-Reitora: Profa. Jane Fraga Tutikian Pró-Reitor de Graduação: Prof. Wladimir Pinheiro do Nascimento Diretora do Instituto de Informática: Profa. Carla Maria Dal Sasso Freitas Coordenador do Curso de Ciência de Computação: Prof. Sérgio Luis Cechin Bibliotecária-chefe do Instituto de Informática: Beatriz Regina Bastos Haro ACKNOWLEDGMENTS We thank Jonathan Blow for the inspiration to create a complete language. ABSTRACT The increase of computing power in the last decades allowed for the creation and establishment of many high level programming languages such as Java and Python. In these languages, control over the hardware is often neglected in favor of more convenient abstractions for the programmer that offer some important guarantees (such as memory safety). At the same time, older lower level languages, such as C, are still considered one of the few viable options for systems programming. This work proposes a new low level programming language called Light that makes use of meta-programming ideas, commonly present in higher level, interpreted languages, in a compiled one. Light is a lower level, statically typed language that focuses on simplicity, consistent syntax and understandability. It has minimal runtime, no garbage collection and is composed of a simple core with a meta-programming layer built on top.
    [Show full text]