CONCRETE MATHEMATICS Second Edition
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Counting Prime Polynomials and Measuring Complexity and Similarity of Information
Counting Prime Polynomials and Measuring Complexity and Similarity of Information by Niko Rebenich B.Eng., University of Victoria, 2007 M.A.Sc., University of Victoria, 2012 A Dissertation Submitted in Partial Fulllment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY in the Department of Electrical and Computer Engineering © Niko Rebenich, 2016 University of Victoria All rights reserved. This dissertation may not be reproduced in whole or in part, by photocopying or other means, without the permission of the author. ii Counting Prime Polynomials and Measuring Complexity and Similarity of Information by Niko Rebenich B.Eng., University of Victoria, 2007 M.A.Sc., University of Victoria, 2012 Supervisory Committee Dr. Stephen Neville, Co-supervisor (Department of Electrical and Computer Engineering) Dr. T. Aaron Gulliver, Co-supervisor (Department of Electrical and Computer Engineering) Dr. Venkatesh Srinivasan, Outside Member (Department of Computer Science) iii Supervisory Committee Dr. Stephen Neville, Co-supervisor (Department of Electrical and Computer Engineering) Dr. T. Aaron Gulliver, Co-supervisor (Department of Electrical and Computer Engineering) Dr. Venkatesh Srinivasan, Outside Member (Department of Computer Science) ABSTRACT This dissertation explores an analogue of the prime number theorem for polynomi- als over nite elds as well as its connection to the necklace factorization algorithm T-transform and the string complexity measure T-complexity. Specically, a precise asymptotic expansion for the prime polynomial counting function is derived. The approximation given is more accurate than previous results in the literature while requiring very little computational eort. In this context asymptotic series expan- sions for Lerch transcendent, Eulerian polynomials, truncated polylogarithm, and polylogarithms of negative integer order are also provided. -
Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae Available Online
Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae available Online Bio BIO Donald Ervin Knuth is an American computer scientist, mathematician, and Professor Emeritus at Stanford University. He is the author of the multi-volume work The Art of Computer Programming and has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces. As a writer and scholar,[4] Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents. He has expressed his disagreement directly to the patent offices of the United States and Europe. (via Wikipedia) ACADEMIC APPOINTMENTS • Professor Emeritus, Computer Science HONORS AND AWARDS • Grace Murray Hopper Award, ACM (1971) • Member, American Academy of Arts and Sciences (1973) • Turing Award, ACM (1974) • Lester R Ford Award, Mathematical Association of America (1975) • Member, National Academy of Sciences (1975) 5 OF 44 PROFESSIONAL EDUCATION • PhD, California Institute of Technology , Mathematics (1963) PATENTS • Donald Knuth, Stephen N Schiller. "United States Patent 5,305,118 Methods of controlling dot size in digital half toning with multi-cell threshold arrays", Adobe Systems, Apr 19, 1994 • Donald Knuth, LeRoy R Guck, Lawrence G Hanson. -
The File Cmfonts.Fdd for Use with Latex2ε
The file cmfonts.fdd for use with LATEX 2".∗ Frank Mittelbach Rainer Sch¨opf 2019/12/16 This file is maintained byA theLTEX Project team. Bug reports can be opened (category latex) at https://latex-project.org/bugs.html. 1 Introduction This file contains the external font information needed to load the Computer Modern fonts designed by Don Knuth and distributed with TEX. From this file all .fd files (font definition files) for the Computer Modern fonts, both with old encoding (OT1) and Cork encoding (T1) are generated. The Cork encoded fonts are known under the name ec fonts. 2 Customization If you plan to install the AMS font package or if you have it already installed, please note that within this package there are additional sizes of the Computer Modern symbol and math italic fonts. With the release of LATEX 2", these AMS `extracm' fonts have been included in the LATEX font set. Therefore, the math .fd files produced here assume the presence of these AMS extensions. For text fonts in T1 encoding, the directive new selects the new (version 1.2) DC fonts. For the text fonts in OT1 and U encoding, the optional docstrip directive ori selects a conservatively generated set of font definition files, which means that only the basic font sizes coming with an old LATEX 2.09 installation are included into the \DeclareFontShape commands. However, on many installations, people have added missing sizes by scaling up or down available Metafont sources. For example, the Computer Modern Roman italic font cmti is only available in the sizes 7, 8, 9, and 10pt. -
Surviving the TEX Font Encoding Mess Understanding The
Surviving the TEX font encoding mess Understanding the world of TEX fonts and mastering the basics of fontinst Ulrik Vieth Taco Hoekwater · EuroT X ’99 Heidelberg E · FAMOUS QUOTE: English is useful because it is a mess. Since English is a mess, it maps well onto the problem space, which is also a mess, which we call reality. Similary, Perl was designed to be a mess, though in the nicests of all possible ways. | LARRY WALL COROLLARY: TEX fonts are mess, as they are a product of reality. Similary, fontinst is a mess, not necessarily by design, but because it has to cope with the mess we call reality. Contents I Overview of TEX font technology II Installation TEX fonts with fontinst III Overview of math fonts EuroT X ’99 Heidelberg 24. September 1999 3 E · · I Overview of TEX font technology What is a font? What is a virtual font? • Font file formats and conversion utilities • Font attributes and classifications • Font selection schemes • Font naming schemes • Font encodings • What’s in a standard font? What’s in an expert font? • Font installation considerations • Why the need for reencoding? • Which raw font encoding to use? • What’s needed to set up fonts for use with T X? • E EuroT X ’99 Heidelberg 24. September 1999 4 E · · What is a font? in technical terms: • – fonts have many different representations depending on the point of view – TEX typesetter: fonts metrics (TFM) and nothing else – DVI driver: virtual fonts (VF), bitmaps fonts(PK), outline fonts (PFA/PFB or TTF) – PostScript: Type 1 (outlines), Type 3 (anything), Type 42 fonts (embedded TTF) in general terms: • – fonts are collections of glyphs (characters, symbols) of a particular design – fonts are organized into families, series and individual shapes – glyphs may be accessed either by character code or by symbolic names – encoding of glyphs may be fixed or controllable by encoding vectors font information consists of: • – metric information (glyph metrics and global parameters) – some representation of glyph shapes (bitmaps or outlines) EuroT X ’99 Heidelberg 24. -
Leading the Way in Scientific Computing. Addison-Wesley. I When Looking for the Best in Scientific Computing, You've Come to Rely on Addison-Wesley
Leading the way in scientific computing. Addison-Wesley. I When looking for the best in scientific computing, you've come to rely on Addison-Wesley. I Take a moment to see how we've made our list even stronger. The LATEX Companion sional programming languages. This book is the definitive user's Michael Goossens, Frank Mittelbach, and Alexander Samarin guide and reference manual for the CWEB system. This book is packed with information needed to use LATEX even 1994 (0-201 -57569-8) approx. 240 pp. Softcover more productively. It is a true companion to Leslie Lamport's users guide as well as a valuable complement to any LATEX introduction. Concrete Mathematics. Second Edition Describes the new LATEX standard. Ronald L. Graham, Donald E. Knuth, and Oren Patashnick 1994 (0-201 -54 199-8) 400 pp. Softcover With improvements to almost every page, the second edition of this classic text and reference introduces the mathematics that LATEX: A Document Preparation System, Second Edition supports advanced computer programming. Leslie Lamport 1994 (0-201 -55802-5) 672 pp. Hardcover The authoritative user's guide and reference manual has been revised to document features now available in the new standard Applied Mathematics@: Getting Started, Getting It Done software release-LATEX~E.The new edition features additional styles William T. Shaw and Jason Tigg and functions, improved font handling, and much more. This book shows how Mathematics@ can be used to solve problems in 1994 (0-201-52983-1) 256 pp. Softcover the applied sciences. Provides a wealth of practical tips and techniques. 1 994 (0-201 -542 1 7-X) 320 pp. -
AMS-LATEX Version 1.0 User's Guide
e w -LATEX Version 1.0 User’s Guide American Mathematical Society August 1990 0 Contents I General 1 1 Introduction 1 1.1 Notes XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 1 e e 2 The w -LTEX project 2 e e 3 Major components of the w -LTEX package 3 II Font considerations 4 4 The font selection scheme of Mittelbach and Schopf¨ 4 5 Basic concepts 4 5.1 Shape XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 5 5.2 Series XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 6 5.3 Size XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 6 5.4 Family XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 7 5.5 Using other font families XXXXXXXXXXXXXXXXXXXXX 8 5.6 The oldlfont option XXXXXXXXXXXXXXXXXXXXXX 10 5.7 Warnings XXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 10 6 Names of math font commands 11 7 The command \newsymbol 16 8 The amssymb option 16 III Features of the amstex option 17 9 Math spacing commands 17 10 Multiple integral signs 17 i 11 Over and under arrows 17 12 Dots 18 13 Accents in math 19 14 Roots 19 15 Boxed formulas 20 16 Extensible arrows 20 17 \overset, \underset and \sideset 20 18 The \text command 21 19 Operator names 21 20 \mod and its relatives 22 21 Fractions and related constructions 22 22 Continued fractions 23 23 Smash options 24 e 24 New LTEX environments 24 24.1 The “cases” environment XXXXXXXXXXXXXXXXXXXXX 24 24.2 Matrix XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX 25 24.3 The Sb and Sp environments XXXXXXXXXXXXXXXXXXX 26 24.4 Commutative diagrams XXXXXXXXXXXXXXXXXXXXXX 26 25 Alignment structures for equations 27 25.1 The align environment XXXXXXXXXXXXXXXXXXXXX 28 25.2 The gather environment XXXXXXXXXXXXXXXXXXXX 28 25.3 The -
In Combinatorics, the Eulerian Number A(N, M), Is the Number of Permutations of the Numbers 1 to N in Which Exactly M Elements A
From Wikipedia, the free encyclopedia In combinatorics, the Eulerian number A(n, m), is the number of permutations of the numbers 1 to n in which exactly m elements are greater than the previous element (permutations with m "ascents"). They are the coefficients of the Eulerian polynomials: The Eulerian polynomials are defined by the exponential generating function The Eulerian polynomials can be computed by the recurrence An equivalent way to write this definition is to set the Eulerian polynomials inductively by Other notations for A(n, m) are E(n, m) and . 1History 2 Basic properties 3 Explicit formula 4 Summation properties 5 Identities 6 Eulerian numbers of the second kind 7 References 8 External links In 1755 Leonhard Euler investigated in his book Institutiones calculi differentialis polynomials α1(x) = 1, α2(x) = x + 1, 2 α3(x) = x + 4x + 1, etc. (see the facsimile). These polynomials are a shifted form of what are now called the Eulerian polynomials An(x). For a given value of n > 0, the index m in A(n, m) can take values from 0 to n − 1. For fixed n there is a single permutation which has 0 ascents; this is the falling permutation (n, n − 1, n − 2, ..., 1). There is also a single permutation which has n − 1 ascents; this is the rising permutation (1, 2, 3, ..., n). Therefore A(n, 0) and A(n, n − 1) are 1 for all values of n. Reversing a permutation with m ascents creates another permutation in which there are n − m − 1 ascents. Therefore A(n, m) = A(n, n − m − 1). -
P Font-Change Q UV 3
p font•change q UV Version 2015.2 Macros to Change Text & Math fonts in TEX 45 Beautiful Variants 3 Amit Raj Dhawan [email protected] September 2, 2015 This work had been released under Creative Commons Attribution-Share Alike 3.0 Unported License on July 19, 2010. You are free to Share (to copy, distribute and transmit the work) and to Remix (to adapt the work) provided you follow the Attribution and Share Alike guidelines of the licence. For the full licence text, please visit: http://creativecommons.org/licenses/by-sa/3.0/legalcode. 4 When I reach the destination, more than I realize that I have realized the goal, I am occupied with the reminiscences of the journey. It strikes to me again and again, ‘‘Isn’t the journey to the goal the real attainment of the goal?’’ In this way even if I miss goal, I still have attained goal. Contents Introduction .................................................................................. 1 Usage .................................................................................. 1 Example ............................................................................... 3 AMS Symbols .......................................................................... 3 Available Weights ...................................................................... 5 Warning ............................................................................... 5 Charter ....................................................................................... 6 Utopia ....................................................................................... -
Zapfcoll Minikatalog.Indd
Largest compilation of typefaces from the designers Gudrun and Hermann Zapf. Most of the fonts include the Euro symbol. Licensed for 5 CPUs. 143 high quality typefaces in PS and/or TT format for Mac and PC. Colombine™ a Alcuin™ a Optima™ a Marconi™ a Zapf Chancery® a Aldus™ a Carmina™ a Palatino™ a Edison™ a Zapf International® a AMS Euler™ a Marcon™ a Medici Script™ a Shakespeare™ a Zapf International® a Melior™ a Aldus™ a Melior™ a a Melior™ Noris™ a Optima™ a Vario™ a Aldus™ a Aurelia™ a Zapf International® a Carmina™ a Shakespeare™ a Palatino™ a Aurelia™ a Melior™ a Zapf book® a Kompakt™ a Alcuin™ a Carmina™ a Sistina™ a Vario™ a Zapf Renaissance Antiqua® a Optima™ a AMS Euler™ a Colombine™ a Alcuin™ a Optima™ a Marconi™ a Shakespeare™ a Zapf Chancery® Aldus™ a Carmina™ a Palatino™ a Edison™ a Zapf international® a AMS Euler™ a Marconi™ a Medici Script™ a Shakespeare™ a Zapf international® a Aldus™ a Melior™ a Zapf Chancery® a Kompakt™ a Noris™ a Zapf International® a Car na™ a Zapf book® a Palatino™ a Optima™ Alcuin™ a Carmina™ a Sistina™ a Melior™ a Zapf Renaissance Antiqua® a Medici Script™ a Aldus™ a AMS Euler™ a Colombine™ a Vario™ a Alcuin™ a Marconi™ a Marconi™ a Carmina™ a Melior™ a Edison™ a Shakespeare™ a Zapf book® aZapf international® a Optima™ a Zapf International® a Carmina™ a Zapf Chancery® Noris™ a Optima™ a Zapf international® a Carmina™ a Sistina™ a Shakespeare™ a Palatino™ a a Kompakt™ a Aurelia™ a Melior™ a Zapf Renaissance Antiqua® Antiqua® a Optima™ a AMS Euler™ a Introduction Gudrun & Hermann Zapf Collection The Gudrun and Hermann Zapf Collection is a special edition for Macintosh and PC and the largest compilation of typefaces from the designers Gudrun and Hermann Zapf. -
A Unified Approach to Combinatorial Triangles: a Generalized Eulerian Polynomial
A unified approach to combinatorial triangles: a generalized Eulerian polynomial Bao-Xuan Zhu∗ School of Mathematics and Statistics, Jiangsu Normal University, Xuzhou 221116, PR China Abstract Motivated by the classical Eulerian number, descent and excedance numbers in the hyperoctahedral groups, an triangular array from staircase tableaux and so on, we study a triangular array [ n,k]n,k 0 satisfying the recurrence relation: T ≥ cd n,k = λ(a0n + a1k + a2) n 1,k + (b0n + b1k + b2) n 1,k 1 + (n k + 1) n 1,k 2 T T − T − − λ − T − − with = 1 and = 0 unless 0 k n. We derive a functional transformation T0,0 Tn,k ≤ ≤ for its row-generating function (x) from the row-generating function A (x) of Tn n another array [An,k]n,k satisfying a two-term recurrence relation. Based on this transformation, we can get properties of and (x) including nonnegativity, Tn,k Tn log-concavity, real rootedness, explicit formula and so on. Then we extend the famous Frobenius formula, the γ positivity decomposition and the David-Barton formula for the classical Eulerian polynomial to those of a generalized Eulerian polynomial. We also get an identity for the generalized Eulerian polynomial with the general derivative polynomial. Finally, we apply our results to an array from the Lambert function, a triangu- lar array from staircase tableaux and the alternating-runs triangle of type B in a unified approach. arXiv:2007.12602v1 [math.CO] 24 Jul 2020 MSC: 05A15; 05A19; 05A20; 26C10 Keywords: Eulerian numbers; Eulerian polynomials; Recurrence relations; Gener- ating functions; Real zeros; Log-concavity; Strong q-log-convexity; γ-positivity; 1 Introduction 1.1 Eulerian numbers Let Sn denote the symmetric group on n-elements [n]= 1, 2,...,n . -
Why We're All Romans
Why We’re All Romans Why We’re All Romans The Roman Contribution to the Western World Carl J. Richard ROWMAN & LITTLEFIELD PUBLISHERS, INC. Lanham • Boulder • New York • Toronto • Plymouth, UK Published by Rowman & Littlefield Publishers, Inc. A wholly owned subsidiary of The Rowman & Littlefield Publishing Group, Inc. 4501 Forbes Boulevard, Suite 200, Lanham, Maryland 20706 http://www.rowmanlittlefield.com Estover Road, Plymouth PL6 7PY, United Kingdom Distributed by National Book Network Copyright © 2010 by Rowman & Littlefield Publishers, Inc. All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanical means, including information storage and retrieval systems, without written permission from the publisher, except by a reviewer who may quote passages in a review. British Library Cataloguing in Publication Information Available Library of Congress Cataloging-in-Publication Data Richard, Carl J. Why we’re all Romans : the Roman contribution to the Western world / Carl J. Richard. p. cm. Includes bibliographical references and index. ISBN 978-0-7425-6778-8 (cloth : alk. paper) — ISBN 978-0-7425-6780-1 (electronic) 1. Rome—Civilization—Influence. 2. Civilization, Modern—Roman influences. 3. Rome—History. I. Title. DG77.R53 2010 937—dc22 2009043889 ™ ϱ The paper used in this publication meets the minimum requirements of American National Standard for Information Sciences—Permanence of Paper for Printed Library Materials, ANSI/NISO Z39.48-1992. Printed in the United States of America In memory -
Factorial Stirling Matrix and Related Combinatorial Sequences
Linear Algebra and its Applications 357 (2002) 247–258 www.elsevier.com/locate/laa Factorial Stirling matrix and related combinatorial sequencesୋ Gi-Sang Cheon a,∗, Jin-Soo Kim b aDepartment of Mathematics, Daejin University, Pocheon 487-711, Republic of Korea bDepartment of Mathematics, Sungkyunkwan University, Suwon 440-746, Republic of Korea Received 21 November 2001; accepted 9 April 2002 Submitted by R.A. Brualdi Abstract In this paper, some relationships between the Stirling matrix, the Vandermonde matrix, the Benoulli numbers and the Eulerian numbers are studied from a matrix representation of k!S(n,k) which will be called the factorial Stirling matrix, where S(n,k) are the Stirling numbers of the second kind. As a consequence a number of interesting and useful identities are obtained. © 2002 Elsevier Science Inc. All rights reserved. AMS classification: 05A19; 05A10 Keywords: Stirling number; Bernoulli number; Eulerian number 1. Introduction In many contexts (see [1–4]), a number of interesting and useful identities involv- ing binomial coefficients are obtained from a matrix representation of a particular counting sequence. Such a matrix representation provides a powerful computational tool for deriving identities and an explicit formula related to the sequence. First, we begin our study with a well-known definition: for any real number x and an integer k,define ୋ This work was supported by the Daejin University Research Grants in 2001. ∗ Corresponding author. E-mail addresses: [email protected] (G.-S. Cheon), [email protected] (J.-S. Kim). 0024-3795/02/$ - see front matter 2002 Elsevier Science Inc. All rights reserved.