DOCSLIB.ORG

Version 13.0 Release Notes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Version 13.0 Release Notes Release Notes The tool of thought for expert programming Version 13.0 Dyalog is a trademark of Dyalog Limited Copyright 1982-2011 by Dyalog Limited. All rights reserved. Version 13.0 First Edition April 2011 No part of this publication may be reproduced in any form by any means without the prior written permission of Dyalog Limited. Dyalog Limited makes no representations or warranties with respect to the contents hereof and specifically disclaims any implied warranties of merchantability or fitness for any particular purpose. Dyalog Limited reserves the right to revise this publication without notification. TRADEMARKS: SQAPL is copyright of Insight Systems ApS. UNIX is a registered trademark of The Open Group. Windows, Windows Vista, Visual Basic and Excel are trademarks of Microsoft Corporation. All other trademarks and copyrights are acknowledged. iii Contents C H A P T E R 1 Introduction .................................................................................... 1 Summary........................................................................................................................... 1 System Requirements ....................................................................................................... 2 Microsoft Windows .................................................................................................... 2 Microsoft .Net Interface .............................................................................................. 2 Unix and Linux ........................................................................................................... 2 Installation Changes ......................................................................................................... 2 Version Numbering ..................................................................................................... 2 Files and Directories ................................................................................................... 2 Interoperability and Compatibility.................................................................................... 4 Introduction ................................................................................................................. 4 Code ............................................................................................................................ 4 “Ordinary” Arrays ....................................................................................................... 4 32 vs. 64-bit Component Files .................................................................................... 5 External Variables ....................................................................................................... 5 32 vs. 64-bit Interpreters ............................................................................................. 5 Unicode vs. Classic Editions ....................................................................................... 5 ⎕AVU ............................................................................................................ 6 DECFs and Complex numbers .................................................................................... 6 Very large array components ...................................................................................... 7 File Journaling ............................................................................................................ 7 TCPSockets ................................................................................................................. 7 Auxiliary Processors ................................................................................................... 7 Session Files ............................................................................................................... 7 Improvements to Take, Drop and Index ........................................................................... 8 New Functions .................................................................................................................. 9 Left and Same ............................................................................................................. 9 Identity and Right ....................................................................................................... 9 Floating-Point Representation ..................................................................................... 9 Profiling ...................................................................................................................... 9 Space Indicator............................................................................................................ 9 Regular Expression Operators..................................................................................... 9 Variant Operator ....................................................................................................... 10 Update DataTable ( 2010⌶ ) ...................................................................................... 10 Read DataTable ( 2020⌶ ) ......................................................................................... 10 Fork New User: Unix only ( 4000⌶ ) ........................................................................ 10 Change User: Unix only ( 4001⌶ ) ............................................................................ 10 Reap Forked Tasks: Unix only ( 4002⌶ ) .................................................................. 10 Signal Counts: Unix only ( 4007⌶ ) .......................................................................... 10 Changes to Formatting. ................................................................................................... 11 New Idioms .................................................................................................................... 13 Retained translate table for Grade .................................................................................. 14 Correction to Dyadic Grade ............................................................................................ 14 iv Contents Correction to Index Generator........................................................................................ 14 Dyalog Unicode IME ..................................................................................................... 15 Configuring the Dyalog Unicode IME ..................................................................... 17 OLE interface changes ................................................................................................... 21 New Parameters ............................................................................................................. 22 Internal Error (99) .......................................................................................................... 23 Deprecation of support for 32-bit component files ........................................................ 24 C H A P T E R 2 128 Bit Decimal Floating-Point Support ....................................... 25 Introduction .................................................................................................................... 25 Floating-Point Representation ........................................................................................ 25 Conversion between Decimal and Binary ................................................................ 27 Decimal Comparison Tolerance ............................................................................... 27 Passing floating-point values .................................................................................... 28 Decimal Floats and Microsoft.NET .......................................................................... 28 C H A P T E R 3 Complex Numbers .......................................................................... 31 Overview .................................................................................................................. 31 Notation .................................................................................................................... 31 Arithmetic ................................................................................................................. 31 Circular functions ..................................................................................................... 32 Different Result for Power ....................................................................................... 33 Comparison .............................................................................................................. 34 C H A P T E R 4 Search and Replace System Operators ....................................... 35 Overview ........................................................................................................................ 35 Syntax ............................................................................................................................ 36 Input Document .............................................................................................................. 37 Output ............................................................................................................................ 38 ⎕R ............................................................................................................................. 38 ⎕S ............................................................................................................................. 39 Search pattern ................................................................................................................
Load more

Recommended publications
  • Generalizing Zeckendorf's Theorem to F-Decompositions
    GENERALIZING ZECKENDORF’S THEOREM TO f-DECOMPOSITIONS PHILIPPE DEMONTIGNY, THAO DO, ARCHIT KULKARNI, STEVEN J. MILLER, DAVID MOON, AND UMANG VARMA ABSTRACT. A beautiful theorem of Zeckendorf states that every positive integer can be uniquely decomposed as a sum of non-consecutive Fibonacci numbers fFng, where F1 = 1, F2 = 2 and Fn+1 = Fn + Fn−1. For general recurrences fGng with non-negative coefficients, there is a notion of a legal decomposition which again leads to a unique representation, and the number of sum- mands in the representations of uniformly randomly chosen m 2 [Gn;Gn+1) converges to a normal distribution as n ! 1. We consider the converse question: given a notion of legal decomposition, is it possible to con- struct a sequence fang such that every positive integer can be decomposed as a sum of terms from the sequence? We encode a notion of legal decomposition as a function f : N0 ! N0 and say that if an is in an “f-decomposition”, then the decomposition cannot contain the f(n) terms immediately before an in the sequence; special choices of f yield many well known decompositions (including base-b, Zeckendorf and factorial). We prove that for any f : N0 ! N0, there exists a sequence 1 fangn=0 such that every positive integer has a unique f-decomposition using fang. Further, if f is periodic, then the unique increasing sequence fang that corresponds to f satisfies a linear recurrence relation. Previous research only handled recurrence relations with no negative coefficients. We find a function f that yields a sequence that cannot be described by such a recurrence relation.
    [Show full text]
  • A Robust Software Watermarking for Copyright Protection
    computers & security 28 (2009) 395–409 available at www.sciencedirect.com journal homepage: www.elsevier.com/locate/cose A robust software watermarking for copyright protection Ibrahim Kamela,*, Qutaiba Albluwib aDepartment of Computer Engineering Sharjah University, P.O. Box 27272, United Arab Emirates bSchool of Computing, Queens University, Canada article info abstract Article history: This paper advocates protecting software copyright through hiding watermarks in various Received 18 August 2008 data structures used by the code, e.g., Bþ-trees, R-trees, linked lists, etc. Prior proposals Received in revised form hide the watermarks in dummy data structures, e.g., linked lists and graphs that are 13 January 2009 created, solely for this reason, during the execution of the hosting software. This makes Accepted 30 January 2009 them vulnerable to subtractive attacks, because the attacker can remove the dummy data structures without altering the functionality or the semantic of the software program. We Keywords: argue that hiding watermarks in one or more data structures that are used by the program Information security would make the watermark more robust because disturbing the watermark would affect R-trees the semantic and the functionality of the underlying software. The challenge is that the Watermarking insertion of the watermark should have a minimal effect on the operations and perfor- Multimedia indexes mance of the data structure. Spatial data structures This paper proposes a novel method for watermarking R-tree data structure and its variants. Copyright protection The proposed watermarking technique does not change the values of the stored data objects. It takes advantage of the redundancy in the order of entries inside the R-tree nodes.
    [Show full text]
  • Technical Reference Manual for the Standardization of Geographical Names United Nations Group of Experts on Geographical Names
    ST/ESA/STAT/SER.M/87 Department of Economic and Social Affairs Statistics Division Technical reference manual for the standardization of geographical names United Nations Group of Experts on Geographical Names United Nations New York, 2007 The Department of Economic and Social Affairs of the United Nations Secretariat is a vital interface between global policies in the economic, social and environmental spheres and national action. The Department works in three main interlinked areas: (i) it compiles, generates and analyses a wide range of economic, social and environmental data and information on which Member States of the United Nations draw to review common problems and to take stock of policy options; (ii) it facilitates the negotiations of Member States in many intergovernmental bodies on joint courses of action to address ongoing or emerging global challenges; and (iii) it advises interested Governments on the ways and means of translating policy frameworks developed in United Nations conferences and summits into programmes at the country level and, through technical assistance, helps build national capacities. NOTE The designations employed and the presentation of material in the present publication do not imply the expression of any opinion whatsoever on the part of the Secretariat of the United Nations concerning the legal status of any country, territory, city or area or of its authorities, or concerning the delimitation of its frontiers or boundaries. The term “country” as used in the text of this publication also refers, as appropriate, to territories or areas. Symbols of United Nations documents are composed of capital letters combined with figures. ST/ESA/STAT/SER.M/87 UNITED NATIONS PUBLICATION Sales No.
    [Show full text]
  • THÈSE DOCTEUR DE L'université DU LUXEMBOURG EN INFORMATIQUE ET DOCTEUR DE L'université LILLE1 EN INFORMATIQUE Malika Mehd
    PhD-FSTC-2011-17 Faculté des Sciences, de la Technologie et de Faculté des Sciences et Technologies de Lille la Communication THÈSE Soutenue le 20/10/2011 à Luxembourg En vue de l’obtention du grade académique de DOCTEUR DE L’UNIVERSITÉ DU LUXEMBOURG EN INFORMATIQUE ET DOCTEUR DE L’UNIVERSITÉ LILLE1 EN INFORMATIQUE par Malika Mehdi née le 10 septembre 1981 à Bejaia PARALLEL HYBRID OPTIMIZATION METHODS FOR PERMUTATION BASED PROBLEMS Jury de thèse Prof. Dr. Pascal Bouvry, directeur de thèse Professeur, Université du Luxembourg Prof. Dr. El-Ghazali Talbi, directeur de thèse Professeur, Université Lille1 Prof. Dr. Nouredine Melab, co-directeur de thèse Professeur, Université Lille1 Prof. Dr. Raymond Bisdorff, président Professeur, Université du Luxembourg Prof. Dr. Enrique Alba, membre Professeur, Université de Malaga Dr. Didier El-Baz, membre HDR, LAAS-CNRS, Toulouse Abstract Solving efficiently large benchmarks of NP-hard permutation-based problems re- quires the development of hybrid methods combining different classes of optimiza- tion methods. Indeed, it is now acknowledged that such methods perform better than traditional optimization methods when used separately. The key challenge is how to find connections between the divergent search strategies used in each class of methods in order to build efficient hybridization strategies. Genetic algorithms (GAs) are very popular population-based metaheuristics based on stochastic evo- lutionary operators. The hybridization of GAs with tree-based exact methods such as Branch-and-Bound is a promising research trend. B&B algorithms are based on an implicit enumeration of the solution space represented as a tree. Our hybridization approach consists in providing a common solution and search space coding and associated search operators enabling an efficient cooperation between the two methods.
    [Show full text]
  • A Könyvtárüggyel Kapcsolatos Nemzetközi Szabványok
    A könyvtárüggyel kapcsolatos nemzetközi szabványok 1. Állomány-nyilvántartás ISO 20775:2009 Information and documentation. Schema for holdings information 2. Bibliográfiai feldolgozás és adatcsere, transzliteráció ISO 10754:1996 Information and documentation. Extension of the Cyrillic alphabet coded character set for non-Slavic languages for bibliographic information interchange ISO 11940:1998 Information and documentation. Transliteration of Thai ISO 11940-2:2007 Information and documentation. Transliteration of Thai characters into Latin characters. Part 2: Simplified transcription of Thai language ISO 15919:2001 Information and documentation. Transliteration of Devanagari and related Indic scripts into Latin characters ISO 15924:2004 Information and documentation. Codes for the representation of names of scripts ISO 21127:2014 Information and documentation. A reference ontology for the interchange of cultural heritage information ISO 233:1984 Documentation. Transliteration of Arabic characters into Latin characters ISO 233-2:1993 Information and documentation. Transliteration of Arabic characters into Latin characters. Part 2: Arabic language. Simplified transliteration ISO 233-3:1999 Information and documentation. Transliteration of Arabic characters into Latin characters. Part 3: Persian language. Simplified transliteration ISO 25577:2013 Information and documentation. MarcXchange ISO 259:1984 Documentation. Transliteration of Hebrew characters into Latin characters ISO 259-2:1994 Information and documentation. Transliteration of Hebrew characters into Latin characters. Part 2. Simplified transliteration ISO 3602:1989 Documentation. Romanization of Japanese (kana script) ISO 5963:1985 Documentation. Methods for examining documents, determining their subjects, and selecting indexing terms ISO 639-2:1998 Codes for the representation of names of languages. Part 2. Alpha-3 code ISO 6630:1986 Documentation. Bibliographic control characters ISO 7098:1991 Information and documentation.
    [Show full text]
  • Analysis of Mutual Influence of Music and Text in Svan Songs
    Analysis of mutual influence of music and text in Svan songs Nana Mzhavanadze Madona Chamgeliani University of Potsdam Lidbashi Foundation [email protected] [email protected] ABSTRACT stand and, secondly, due to the phonetic reservoir (es- pecially vowels in upper Svaneti) of Svans being rich The present paper discusses the influence of musicological, lin- and often having grammatical function. This raises a guistic, and ethnological aspects on the music-text relation in question about phonetic events being of musical or Svan songs. In a lot of cases, there is a deep bond between verbal linguistic origin. texts and their musical counterparts (Mzhavanadze & Chamgeliani, 2015). Despite the fact that the lyrics of songs are • In contradiction to the hypothesis of some authors that of critical importance to the rituals in which they are performed, Svan songs are believed to be “song-poems“ many of them are difficult (at times impossible) to transcribe. The (Shanidze et al., 1939), the texts often do not show present analysis shows that the reservoir of Svan melos is rela- high integrity with the music as they are sung. tively modest in comparison with the verbal texts. In songs in which musical patterns repeat and texts alter, the latter get modi- This suggests that in order to understand Svans’ musical fied and often distorted to the degree to make them incomprehen- grammar, the interrelationship between music and verbal sible. This is also true for texts of pre-Christian origin, which has texts cannot be ignored. The presented paper touches on interesting ethnological consequences. The results of the current the issues what role either play in the forming process of study challenge the isolated linguistic interpretation of verbal texts of Svan songs and emphasize the need for a joint analysis a musical (artistic) image.
    [Show full text]
  • Georgian Romanization
    Georgian Values are shown for the older Khutsuri and the modern Mkhedruli alphabets. There are no upper case letters in Mkhedruli. Upper case letters Lower case letters Khutsuri Romanization Khutsuri Mkhedruli Romanization Ⴀ A ⴀ ა a Ⴁ B ⴁ ბ b Ⴂ G ⴂ ზ g Ⴃ D ⴃ დ d Ⴄ E ⴄ ე e Ⴅ V ⴅ ქ v Ⴆ Z ⴆ ჩ z Ⴇ Tʻ ⴇ უ tʻ Ⴈ I ⴈ ი i Ⴉ K ⴉ ჯ k Ⴊ L ⴊ მ l Ⴋ M ⴋ ნ m Ⴌ N ⴌ ო n Ⴍ O ⴍ პ o Ⴎ P ⴎ ჰ p Ⴏ Ž ⴏ შ ž Ⴐ R ⴐ ს r Ⴑ S ⴑ ტ s Ⴒ T ⴒ ჳ t Ⴓ U ⴓ ფ u Ⴔ Pʻ ⴔ ჟ pʻ Ⴕ Kʻ ⴕ ლ kʻ Ⴖ Ġ ⴖ ჭ ġ Ⴗ Q ⴗ ჱ q Ⴘ Š ⴘ ჲ š Ⴙ Čʻ ⴙ ძ čʻ Ⴚ Cʻ ⴚ გ cʻ Ⴛ Ż ⴛ ჴ ż Ⴜ C ⴜ ც c Ⴝ Č ⴝ წ č Ⴞ X ⴞ ყ x Ⴟ J ⴟ ხ j Ⴠ H ⴠ თ h Ⴡ Ē ⴡ ჵ ē Ⴢ Y ⴢ კ y Ⴤ X ⴤ რ x Ⴥ Ō ⴥ ჶ ō Ⴣ W ⴣ ღ w ვ f ჷ ĕ ჸ ʻ (ayn) , ŭ Transliteration of Georgian 1/3 GEORGIAN Georgian script* ISO 9984 National IKE ALA-LC KNAB BGN/PCGN TITUS 1996(1.0) 2002(2.0) 1974(3.0) 1997(4.0) 1993(5.0) 1981(6.0) 2000(7.0) 01 Ⴀ ა a a a a a a a 02 Ⴁ ბ b b b b b b b 03 Ⴂ გ g g g g g g g 04 Ⴃ დ d d d d d d d 05 Ⴄ ე e e e e e e e 06 Ⴅ ვ v v v v v v v 07 Ⴆ ზ z z z z z z z 08 Ⴡ ჱ a ē — ē / ey ē — (ey) (ē) 09 Ⴇ თ t’ t t tʻ t tʼ t 10 Ⴈ ი i i i i i i i 11 Ⴉ კ k k’ ḳ k ķ k ḳ 12 Ⴊ ლ l l l l l l l 13 Ⴋ მ m m m m m m m 14 Ⴌ ნ n n n n n n n 15 Ⴢ ჲ a y — y y — (j) — 16 Ⴍ ო o o o o o o o 17 Ⴎ პ p p’ ṗ p ṗ p ṗ 18 Ⴏ ჟ ž zh ž z̆ ž zh ž 19 Ⴐ რ r r r r r r r 20 Ⴑ ს s s s s s s s 21 Ⴒ ტ t t’ ṭ t ţ t ṭ 22 Ⴣ ჳ a w — wi / ü w — — — 23 Ⴓ უ u u u u u u u 24 Ⴔ ფ pʼ p p pʻ p pʼ p 25 Ⴕ ქ kʼ k k kʻ k kʼ k 26 Ⴖ ღ ḡ gh ǧ / ɣ ġ ǧ gh ġ 27 Ⴗ ყ q q’ q̇ q q q q̇ 28 Ⴘ შ š sh š š š sh š 29 Ⴙ ჩ čʼ ch č čʻ č chʼ č 30 Ⴚ ც cʼ ts c cʻ c tsʼ c 31 Ⴛ ძ j dz j / ʒ ż dz dz ʒ 32 Ⴜ წ c ts’ c̣ c ç ts c̣ 33 Ⴝ ჭ č ch’ č̣ č ç̌ ch č̣ 34 Ⴞ ხ x kh x x x kh χ 35 Ⴤ ჴ a ẖ — q x̣ — (qʼ) q 36 Ⴟ ჯ ǰ j ǰ / ǯ j dž j ǯ 37 Ⴠ ჰ h h h h h h h 38 Ⴥ ჵ a ō — ō / ow ō — — (ō) Thomas T.
    [Show full text]
  • Svan Funeral Dirges (Zär): Musical Acoustical Analysis of a New Collection of Field Recordings
    Trabzon University State Conservatory © 2017-2020 Volume 4 Issue 2 December 2020 Research Article Musicologist 2020. 4 (2): 138-167 DOI: 10.33906/musicologist.782094 FRANK SCHERBAUM Universität Potsdam, Germany [email protected] orcid.org/0000-0002-5050-7331 NANA MZHAVANADZE Universität Potsdam, Germany [email protected] orcid.org/0000-0001-5726-1656 Svan Funeral Dirges (Zär): Musical Acoustical Analysis of a New Collection of Field Recordings ABSTRACT This paper is a companion paper to Mzhavanadze & Scherbaum (2020). KEYWORDS Jointly, the two papers describe the results of an interdisciplinary study of three-voiced Svan funeral dirges, known as zär in Svan and zari in Traditional Georgian Georgian. In the present paper, to which we refer as paper 1, we analyze Vocal Music the musical acoustical properties of a new set of field recordings Computational collected during an ethnomusicological field expedition to Georgia in Ethnomusicology 2016. The aim of the study is to investigate the tonal organization of eleven different performances of six different variants of zär, performed Ethnomusicological by singers from different villages. For some of the performances, we Field Recordings observe a strong gradual pitch rise of up to 100 cents per minute. The intra-variant differences in the performances of different groups of singers were observed to be remarkably different, including the use of significantly different harmonic tuning systems. In contrast, two subsequent performances of the Mest’ia variant of zär by a group of singers recorded in Zargǟsh were essentially identical. This demonstrates the widespread absence of improvisational elements in these two performances. One of the most interesting results of our analysis is the observation that the musical structure of zär, expressed, for example, in its ambitus, the complexity of its melodic progression, and its harmonic chord inventory, change systematically along the course of the Enguri valley.
    [Show full text]
  • 4 Issue: 2 December 2020 Masthead
    Trabzon University e-ISSN: 2618-5652 State Conservatory Vol: 4 Issue: 2 December 2020 Masthead Musicologist: International Journal of Music Studies Volume 4 Issue 2 December 2020 Musicologist is a biannually, peer-reviewed, open access, online periodical published in English by Trabzon University State Conservatory, in Trabzon, Turkey. e-ISSN: 2618-5652 Owner on behalf of Trabzon University State Conservatory Merve Eken KÜÇÜKAKSOY (Director) Editor-In-Chief Abdullah AKAT (İstanbul University – Turkey) Deputy Editor Merve Eken KÜÇÜKAKSOY (Trabzon University – Turkey) Technical Editor Emrah ERGENE (Trabzon University – Turkey) Language Editor Marina KAGANOVA (Colombia University – USA) Editorial Assistant Uğur ASLAN (Trabzon University – Turkey) Contacts Address: Trabzon Üniversitesi Devlet Konservatuvarı Müdürlüğü, Fatih Kampüsü, Söğütlü 61335 Akçaabat/Trabzon, Turkey Web: www.musicologistjournal.com Email: [email protected] All rights reserved. The authors are responsible for all visual elements, including tables, figures, graphics and pictures. They are also responsible for any scholarly citations. Trabzon University does not assume any legal responsibility for the use of any of these materials. ©2017-2020 Trabzon University State Conservatory Editorial Board Alper Maral Ankara Music and Fine Arts University – Turkey Caroline Bithell The University of Manchester – UK Ekaterine Diasamidze Tbilisi State University – Georgia Elif Damla Yavuz Mimar Sinan Fine Arts University – Turkey Erol Köymen The University of Chicago – USA
    [Show full text]
  • Unranking Combinations Lexicographically: an Efficient New Strategy Compared with Others Cyann Donnot, Antoine Genitrini, Yassine Herida
    Unranking Combinations Lexicographically: an efficient new strategy compared with others Cyann Donnot, Antoine Genitrini, Yassine Herida To cite this version: Cyann Donnot, Antoine Genitrini, Yassine Herida. Unranking Combinations Lexicographically: an efficient new strategy compared with others. 2020. hal-02462764 HAL Id: hal-02462764 https://hal.sorbonne-universite.fr/hal-02462764 Preprint submitted on 31 Jan 2020 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. Unranking Combinations Lexicographically: an efficient new strategy compared with others Cyann Donnot1, Antoine Genitrini2, and Yassine Herida1 1 Full-time master student at Sorbonne University 2 Sorbonne University, LIP6. [email protected] Abstract. We propose a comparative study of four algorithms dedi- cated to the lexicographic unranking of combinations. The three first ones are algorithms from the literature. We give some key ideas how to analyze them in average and describe their strengths and weaknesses. We then introduce a new algorithm based on a new strategy inside the classical factorial numeral system (or factoradics). We conclude the pa- per with an experimental study, in particular when n = 10000; k = 5000, our algorithm is 36 (resp. 53) times as fast as our C++ implementation of Matlab’s (resp.
    [Show full text]
  • Math Book from Wikipedia
    Math book From Wikipedia PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Mon, 25 Jul 2011 10:39:12 UTC Contents Articles 0.999... 1 1 (number) 20 Portal:Mathematics 24 Signed zero 29 Integer 32 Real number 36 References Article Sources and Contributors 44 Image Sources, Licenses and Contributors 46 Article Licenses License 48 0.999... 1 0.999... In mathematics, the repeating decimal 0.999... (which may also be written as 0.9, , 0.(9), or as 0. followed by any number of 9s in the repeating decimal) denotes a real number that can be shown to be the number one. In other words, the symbols 0.999... and 1 represent the same number. Proofs of this equality have been formulated with varying degrees of mathematical rigour, taking into account preferred development of the real numbers, background assumptions, historical context, and target audience. That certain real numbers can be represented by more than one digit string is not limited to the decimal system. The same phenomenon occurs in all integer bases, and mathematicians have also quantified the ways of writing 1 in non-integer bases. Nor is this phenomenon unique to 1: every nonzero, terminating decimal has a twin with trailing 9s, such as 8.32 and 8.31999... The terminating decimal is simpler and is almost always the preferred representation, contributing to a misconception that it is the only representation. The non-terminating form is more convenient for understanding the decimal expansions of certain fractions and, in base three, for the structure of the ternary Cantor set, a simple fractal.
    [Show full text]
  • The Statistic Pinv for Number System∗
    Applied Mathematics E-Notes, 20(2020), 230-235 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.edu.tw/ amen/ The Statistic Pinv For Number System Fanomezantsoa Patrick Rabarisony, Hery Randriamaroz Received 19 April 2019 Abstract The number of inversions is a statistic on permutation groups measuring the degree to which the entries of a permutation are out of order. We provide a generalization of that statistic by introducing the statistic number of pseudoinversions on the colored permutation groups. The main motivation for studying that statistic is the possibility to use it to define a number system and a numeral system on the colored permutation groups. By means of the statistic number of i-pseudoinversions, we construct our number system, and a bijection between the set of positive integers and the colored permutation groups. 1 Introduction A statistic over a group is a function from that group to the set of nonnegative integers. One of the most studied statistics is the number of inversions, defined by inv := # (i, j) [n]2 i < j, (i) > (j) , 2 j on the symmetric group Sn over [n]. A well-known result is the equidistribution of inv with the statistic major index proved by Foata [3]. Besides, the Lehmer code is based on that statistic. It is a particular way to encode each permutation of n numbers, and an instance of a scheme for numbering permutations. Remark that Vajnovszki provided several permutation codes directly related to the Lehmer code [5]. In this article, we give a generalization of the statistic inv on the colored permutation group in order to create a more general code.
    [Show full text]