Sphere Packings, Lattices and Groups

Size: px
Start display at page:

Download "Sphere Packings, Lattices and Groups"

Transcription

1 J.H. Conway N.J.A. Sloane Sphere Packings, Lattices and Groups Third Edition With Additional Contributions by E. Bannai, R.E. Borcherds, J. Leech, S.P. Norton, A.M. Odlyzko, R.A. Parker, L. Queen and B.B. Venkov With 112 Illustrations Springer

2 Contents Preface to First Edition Preface to Third Edition List of Symbols v xv lxi Chapter 1 Sphere Packings and Kissing Numbers J.H. Conway and N.J.A. Sloane 1 The Sphere Packing Problem I I Packing Ball Bearings 1.2 Lattice Packings 3 3 Nonlattice Packings 7 4 /7-Dimensional Packings 8 5 Sphere Packing Problem Summary of Results The Kissing Number Problem The Problem of the Thirteen Spheres Kissing Numbers in Other Dimensions Spherical Codes The Construction of Spherical Codes from Sphere Packings The Construction of Spherical Codes from Binary Codes Bounds on A(/i,«j>) 27 Appendix: Planetary Perturbations 29 Chapter 2 Coverings, Lattices and Quantizers J.H. Conway and N.J.A. Sloane The Covering Problem Covering Space with Overlapping Spheres The Covering Radius and the Voronoi Cells Covering Problem Summary of Results Computational Difficulties in Packings and Coverings 40

3 lxv Contents 2. Lattices, Quadratic Forms and Number Theory The Norm of a Vector Quadratic Forms Associated with a Lattice Theta Series and Connections with Number Theory Integral Lattices and Quadratic Forms Modular Forms Complex and Quaternionic Lattices Quantizers Quantization, Analog-to-Digital Conversion and Data Compression The Quantizer Problem Quantizer Problem Summary of Results 59 Chapter 3 Codes, Designs and Groups J.H. Conway and N.J.A. Sloane The Channel Coding Problem The Sampling Theorem Shannon's Theorem Error Probability Lattice Codes for the Gaussian Channel Error-Correcting Codes The Error-Correcting Code Problem Further Definitions from Coding Theory Repetition, Even Weight and Other Simple Codes Cyclic Codes BCH and Reed-Solomon Codes Justesen Codes Reed-Muller Codes Quadratic Residue Codes Perfect Codes The Pless Double Circulant Codes Goppa Codes and Codes from Algebraic Curves Nonlinear Codes Hadamard Matrices r-designs, Steiner Systems and Spherical f-designs /-Designs and Steiner Systems Spherical r-designs The Connections with Group Theory The Automorphism Group of a Lattice Constructing Lattices and Codes from Groups 92 Chapter 4 Certain Important Lattices and Their Properties J.H. Conway and N.J.A. Sloane Introduction Reflection Groups and Root Lattices Gluing Theory 99

4 Contents lxvi 4. Notation; Theta Functions Jacobi Theta Functions The ^-Dimensional Cubic Lattice Z" The ^-Dimensional Lattices A a and A* The Lattice A n The Hexagonal Lattice The Face-Centered Cubic Lattice The Tetrahedral or Diamond Packing The Hexagonal Close-Packing The. Dual Lattice A* The Body-Centered Cubic Lattice The H-Dimensional Lattices > and D* The Lattice D n The Four-Dimensional Lattice D The Packing D n The Dual Lattice D* The Lattices E b, E 7 and The 8-Dimensional Lattice The 7-Dimensional Lattices 7 and E? The 6-Dimensional Lattices 6 and Et The 12-Dimensional Coxeter-Todd Lattice K n The 16-Dimensional Barnes-Wall Lattice A, The 24-Dimensional Leech Lattice A Chapter 5 Sphere Packing and Error-Correcting Codes J. Leech and N.J.A. Sloane Introduction The Coordinate Array of a Point Construction A The Construction Center Density Kissing Numbers Dimensions 3 to Dimensions 7 and Dimensions 9 to Comparison of Lattice and Nonlattice Packings Construction B The Construction Center Density and Kissing Numbers Dimensions 8, 9 and Dimensions 15 to Packings Built Up by Layers Packing by Layers Dimensions 4 to Dimensions 11 and 13 to Density Doubling and the Leech Lattice A Cross Sections of A Other Constructions from Codes 146

5 lxvii Contents 5.1 A Code of Length A Lattice Packing in R Cross Sections of A Packings Based on Ternary Codes Packings Obtained from the Pless Codes Packings Obtained from Quadratic Residue Codes Density Doubling in R 24 and R Construction C The Construction Distance Between Centers Center Density Kissing Numbers Packings Obtained from Reed-Muller Codes Packings Obtained from BCH and Other Codes Density of BCH Packings Packings Obtained from Justesen Codes 155 Chapter 6 Laminated Lattices J.H. Conway and N.J.A. Sloane Introduction The Main Results Properties of A o to A Dimensions 9 to The Deep Holes in A, Dimensions 17 to Dimensions 25 to Appendix: The Best Integral Lattices Known 179 Chapter 7 Further Connections Between Codes and Lattices N.J.A. Sloane Introduction Construction A Self-Dual (or Type I) Codes and Lattices.: Extremal Type I Codes and Lattices ConstructionB Type II Codes and Lattices Extremal Type II Codes and Lattices Constructions A and B for Complex Lattices Self-Dual Nonbinary Codes and Complex Lattices Extremal Nonbinary Codes and Complex Lattices 205 Chapter 8 Algebraic Constructions for Lattices J.H. Conway and N.J.A. Sloane Introduction The Icosians and the Leech Lattice 207

6 Contents lxviii 2.1 The Icosian Group The Icosian and Turyn-Type Constructions for the Leech Lattice A General Setting for Construction A, and Quebbemann's 64-Dimensional Lattice Lattices Over Z[e'" 4 ], and Quebbemann's 32-Dimensional Lattice McKay's 40-Dimensional Extremal Lattice Repeated Differences and Craig's Lattices Lattices from Algebraic Number Theory Introduction Lattices from the Trace Norm Examples from Cyclotomic Fields Lattices from Class Field Towers Unimodular Lattices with an Automorphism of Prime Order Constructions D and D' Construction D Examples Construction D' Construction E Examples of Construction E 238 Chapter 9 Bounds for Codes and Sphere Packings N.J.A. Sloane Introduction Zonal Spherical Functions The 2-Point-Homogeneous Spaces Representations of G Zonal Spherical Functions Positive-Definite Degenerate Kernels The Linear Programming Bounds Codes and Their Distance Distributions The Linear Programming Bounds Bounds for Error-Correcting Codes Bounds for Constant-Weight Codes Bounds for Spherical Codes and Sphere Packings Other Bounds 265 Chapter 10 Three Lectures on Exceptional Groups J.H. Conway First Lecture Some Exceptional Behavior of the Groups L n (q) The Case p = The Case p = TheCasep = 7 269

7 lxix Contents 1.5 TheCase/?=ll A Presentation for M l Janko's Group of Order Second Lecture The Mathieu Group M The Stabilizer of an Octad The Structure of the Golay Code < The Structure of P (D.)K The Maximal Subgroups of M The Structure of P(Q) Third Lecture The Group Co 0 = 0 and Some of its Subgroups The Geometry of the Leech Lattice The Group 0 and its Subgroup N Subgroups of The Higman-Sims and McLaughlin Groups The Group Co, = Involutions in Congruences for Theta Series A Connection Between -0 and Fischer's Group Fi 2i 295 Appendix: On the Exceptional Simple Groups 296 Chapter 11 The Golay Codes and the Mathieu Groups J.H. Conway Introduction Definitions of the Hexacode Justification of a Hexacodeword Completing a Hexacodeword The Golay Code % lt and the MOG Completing Octads from 5 of their Points The Maximal Subgroups of M The Projective Subgroup L 2 (23) The Sextet Group 2 6 :3S The Octad Group 2 4 : A The Triad Group and the Projective Plane of Order The Trio Group 2": (S 3 x L 2 (7)) The Octern Group The Mathieu Group M 2, The Group M 22 : The Group M I2, the Tetracode and the MINIMOG Playing Cards and Other Games Further Constructions for M Chapter 12 A Characterization of the Leech Lattice J.H. Conway 331

8 Contents lxx Chapter 13 Bounds on Kissing Numbers A.M. Odlyzko and N.J.A. Sloane A General Upper Bound Numerical Results 338 Chapter 14 Uniqueness of Certain Spherical Codes E. Bannal and N.J.A. Sloane Introduction Uniqueness of the Code of Size 240 in fl Uniqueness of the Code of Size 56 in ft Uniqueness of the Code of Size in fl Uniqueness of the Code of Size 4600 in n Chapter 15 On the Classification of Integral Quadratic Forms J.H. Conway and N.J.A. Sloane Introduction Definitions Quadratic Forms Forms and Lattices; Integral Equivalence The Classification of Binary Quadratic Forms Cycles of Reduced Forms Definite Binary Forms Indefinite Binary Forms Composition of Binary Forms Genera and Spinor Genera for Binary Forms The p-adic Numbers The p-adic Numbers p-adic Square Classes An Extended Jacobi-Legendre Symbol Diagonalization of Quadratic Forms Rational Invariants of Quadratic Forms Invariants and the Oddity Formula Existence of Rational Forms with Prescribed Invariants The Conventional Form of the Hasse-Minkowski Invariant The Invariance and Completeness of the Rational Invariants The p-adic Invariants for Binary Forms The p-adic Invariants for «-Ary Forms The Proof of Theorem The Genus and its Invariants p-adic Invariants The p-adic Symbol for a Form 379

9 lxxi Contents Adic Invariants The 2-Adic Symbol Equivalences Between Jordan Decompositions A Canonical 2-Adic Symbol Existence of Forms with Prescribed Invariants A Symbol for the Genus Classification of Forms of Small Determinant and of p-elementary Forms Forms of Small Determinant p-elementary Forms The Spinor Genus Introduction The Spinor Genus Identifying the Spinor Kernel Naming the Spinor Operators for the Genus of/ Computing the Spinor Kernel from the p-ad\c Symbols Tractable and Irrelevant Primes When is There Only One Class in the Genus? The Classification of Positive Definite Forms Minkowski Reduction The Kneser Gluing Method Positive Definite Forms of Determinant 2 and Computational Complexity 402 Chapter 16 Enumeration of Unimodular Lattices J.H. Conway and N.J.A. Sloane The Niemeier Lattices and the Leech Lattice The Mass Formulae for Lattices Verifications of Niemeier's List The Enumeration of Unimodular Lattices in Dimensions n =s Chapter 17 The 24-Dimensional Odd Unimodular Lattices R.E. Borcherds 421 Chapter 18 Even Unimodular 24-Dimensional Lattices B.B. Venkov Introduction Possible Configurations of Minimal Vectors On Lattices with Root Systems of Maximal Rank Construction of the Niemeier Lattices A Characterization of the Leech Lattice 439

10 Contents lxxii Chapter 19 Enumeration of Extremal Self-Dual Lattices J.H. Conway, A.M. Odlyzko and N.J.A. Sloane Dimensions Dimensions Dimensions n s= Chapter 20 Finding the Closest Lattice Point J.H. Conway and N.J.A. Sloane Introduction The Lattices Z", D n and A Decoding Unions of Cosets "Soft Decision" Decoding for Binary Codes Decoding Lattices Obtained from Construction A Decoding Chapter 21 Voronoi Cells of Lattices and Quantization Errors J.H. Conway and N.J.A. Sloane Introduction Second Moments of Polytopes A Dirichlet's Integral B Generalized Octahedron or Crosspolytope C The n-sphere D ^-Dimensional Simplices E Regular Simplex F Volume and Second Moment of a Polytope in Terms of its Faces G Truncated Octahedron H Second Moment of Regular Polytopes Regular Polygons J Icosahedron and Dodecahedron K The Exceptional 4-Dimensional Polytopes Voronoi Cells and the Mean Squared Error of Lattice Quantizers A The Voronoi Cell of a Root Lattice B Voronoi Cell for A a C Voronoi Cell for D n (n s 4) D Voronoi Cells for, E Voronoi Cell for D* F Voronoi Cell for A* G The Walls of the Voronoi Cell 476 Chapter 22 A Bound for the Covering Radius of the Leech Lattice S.P. Norton 478

11 lxxiii Contents Chapter 23 The Covering Radius of the Leech Lattice J.H. Conway, R.A. Parker and N.J.A. Sloane Introduction The Coxeter-Dynkin Diagram of a Hole Holes Whose Diagram Contains an A n Subgraph Holes Whose Diagram Contains a D n Subgraph Holes Whose Diagram Contains an E n Subgraph 504 Chapter 24 Twenty-Three Constructions for the Leech Lattice J.H. Conway and N.J.A. Sloane The "Holy Constructions" The Environs of a Deep Hole 512 Chapter 25 The Cellular Structure of the Leech Lattice R.E. Borcherds, J.H. Conway and L. Queen Introduction Names for the Holes The Volume Formula The Enumeration of the Small Holes 521 Chapter 26 Lorentzian Forms for the Leech Lattice J.H. Conway and N.J.A. Sloane The Unimodular Lorentzian Lattices Lorentzian Constructions for the Leech Lattice 525 Chapter 27 The Automorphism Group of the 26-Dimensional Even Unimodular Lorentzian Lattice J.H. Conway Introduction The Main Theorem 530 Chapter 28 Leech Roots and Vinberg Groups J.H. Conway and N.J.A. Sloane The Leech Roots Enumeration of the Leech Roots The Lattices I nl for «s Vinberg's Algorithm and the Initial Batches of Fundamental Roots The Later Batches of Fundamental Roots 552

12 Contents lxxiv Chapter 29 The Monster Group and its Dimensional Space J.H. Conway Introduction The Golay Code < and the Parker Loop 9> The Mathieu Group A/ 24 ; the Standard Automorphisms of The Golay Cocode %* and the Diagonal Automorphisms The Group N of Triple Maps The kernel K and the Homomorphism g^> g The Structures of Various Subgroups of N The Leech Lattice A 24 and the Group Q x Short Elements The Basic Representations of N The Dictionary The Algebra._^ The Definition of the Monster Group G, and its Finiteness Identifying the Monster 564 Appendix 1. Computing in 3> 565 Appendix 2. A Construction for Appendix 3. Some Relations in Q, 566 Appendix 4. Constructing Representations for N, 568 Appendix 5. Building the Group G, 569 Chapter 30 A Monster Lie Algebra? R.E. Borcherds, J.H. Conway, L. Queen and N.J.A. Sloane 570 Bibliography 574 Supplementary Bibliography 642 Index 681

An Optimal Odd Unimodular Lattice in Dimension 72

An Optimal Odd Unimodular Lattice in Dimension 72 An Optimal Odd Unimodular Lattice in Dimension 72 Masaaki Harada and Tsuyoshi Miezaki September 27, 2011 Abstract It is shown that if there is an extremal even unimodular lattice in dimension 72, then

More information

Research Article On the Classification of Lattices Over Q( 3) Which Are Even Unimodular Z-Lattices of Rank 32

Research Article On the Classification of Lattices Over Q( 3) Which Are Even Unimodular Z-Lattices of Rank 32 International Mathematics and Mathematical Sciences Volume 013, Article ID 837080, 4 pages http://dx.doi.org/10.1155/013/837080 Research Article On the Classification of Lattices Over Q( 3) Which Are Even

More information

Lattice Coding and its Applications in Communications

Lattice Coding and its Applications in Communications Lattice Coding and its Applications in Communications Alister Burr University of York alister.burr@york.ac.uk Introduction to lattices Definition; Sphere packings; Basis vectors; Matrix description Codes

More information

1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE

1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH Genyuan Wang and Xiang-Gen Xia, Senior Member, IEEE 1102 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 51, NO 3, MARCH 2005 On Optimal Multilayer Cyclotomic Space Time Code Designs Genyuan Wang Xiang-Gen Xia, Senior Member, IEEE Abstract High rate large

More information

Crystal Lattices. Daniele Toffoli December 7, / 42

Crystal Lattices. Daniele Toffoli December 7, / 42 Crystal Lattices Daniele Toffoli December 7, 2016 1 / 42 Outline 1 Bravais Lattice: definitions and examples 2 Unit cell: primitive, conventional and Wigner-Seitz 3 Crystal structure: lattices with basis

More information

Lattices from equiangular tight frames with applications to lattice sparse recovery

Lattices from equiangular tight frames with applications to lattice sparse recovery Lattices from equiangular tight frames with applications to lattice sparse recovery Deanna Needell Dept of Mathematics, UCLA May 2017 Supported by NSF CAREER #1348721 and Alfred P. Sloan Fdn The compressed

More information

s: and

s: and GENERATION OF ISOMETRIES OF CERTAIN Z-LATTICES BY SYMMETRIES Myung-Hwan Kim 1 and Byeong-Kweon Oh 2 1 Dept. of Math., Seoul Nat l Univ., Seoul 151-742, Korea 2 Dept. of Math., KIAS, Seoul 130-012, Korea

More information

Rewriting Codes for Flash Memories Based Upon Lattices, and an Example Using the E8 Lattice

Rewriting Codes for Flash Memories Based Upon Lattices, and an Example Using the E8 Lattice Rewriting Codes for Flash Memories Based Upon Lattices, and an Example Using the E Lattice Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan Workshop on Application

More information

Laurence Boxer and Ismet KARACA

Laurence Boxer and Ismet KARACA THE CLASSIFICATION OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we classify digital covering spaces using the conjugacy class corresponding to a digital covering space.

More information

Cross-Packing Lattices for the Rician Fading Channel

Cross-Packing Lattices for the Rician Fading Channel Cross-Packing Lattices for the Rician Fading Channel Amin Sakzad, Anna-Lena Trautmann, and Emanuele Viterbo Department of Electrical and Computer Systems Engineering, Monash University. Abstract We introduce

More information

Transcendental lattices of complex algebraic surfaces

Transcendental lattices of complex algebraic surfaces Transcendental lattices of complex algebraic surfaces Ichiro Shimada Hiroshima University November 25, 2009, Tohoku 1 / 27 Introduction Let Aut(C) be the automorphism group of the complex number field

More information

An orderly algorithm to enumerate finite (semi)modular lattices

An orderly algorithm to enumerate finite (semi)modular lattices An orderly algorithm to enumerate finite (semi)modular lattices BLAST 23 Chapman University October 6, 23 Outline The original algorithm: Generating all finite lattices Generating modular and semimodular

More information

Laurence Boxer and Ismet KARACA

Laurence Boxer and Ismet KARACA SOME PROPERTIES OF DIGITAL COVERING SPACES Laurence Boxer and Ismet KARACA Abstract. In this paper we study digital versions of some properties of covering spaces from algebraic topology. We correct and

More information

1 SE = Student Edition - TG = Teacher s Guide

1 SE = Student Edition - TG = Teacher s Guide Mathematics State Goal 6: Number Sense Standard 6A Representations and Ordering Read, Write, and Represent Numbers 6.8.01 Read, write, and recognize equivalent representations of integer powers of 10.

More information

Statistical Models and Methods for Financial Markets

Statistical Models and Methods for Financial Markets Tze Leung Lai/ Haipeng Xing Statistical Models and Methods for Financial Markets B 374756 4Q Springer Preface \ vii Part I Basic Statistical Methods and Financial Applications 1 Linear Regression Models

More information

Research Statement. Dapeng Zhan

Research Statement. Dapeng Zhan Research Statement Dapeng Zhan The Schramm-Loewner evolution (SLE), first introduced by Oded Schramm ([12]), is a oneparameter (κ (0, )) family of random non-self-crossing curves, which has received a

More information

On the Degeneracy of N and the Mutability of Primes

On the Degeneracy of N and the Mutability of Primes On the Degeneracy of N and the Mutability of Primes Jonathan Trousdale October 9, 018 Abstract This paper sets forth a representation of the hyperbolic substratum that defines order on N. Degeneracy of

More information

The finite lattice representation problem and intervals in subgroup lattices of finite groups

The finite lattice representation problem and intervals in subgroup lattices of finite groups The finite lattice representation problem and intervals in subgroup lattices of finite groups William DeMeo Math 613: Group Theory 15 December 2009 Abstract A well-known result of universal algebra states:

More information

Shaping Low-Density Lattice Codes Using Voronoi Integers

Shaping Low-Density Lattice Codes Using Voronoi Integers Shaping Low-Density Lattice Codes Using Voronoi Integers Nuwan S. Ferdinand Brian M. Kurkoski Behnaam Aazhang Matti Latva-aho University of Oulu, Finland Japan Advanced Institute of Science and Technology

More information

REMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7

REMARKS ON K3 SURFACES WITH NON-SYMPLECTIC AUTOMORPHISMS OF ORDER 7 REMARKS ON K3 SURFACES WTH NON-SYMPLECTC AUTOMORPHSMS OF ORDER 7 SHNGO TAK Abstract. n this note, we treat a pair of a K3 surface and a non-symplectic automorphism of order 7m (m = 1, 3 and 6) on it. We

More information

Modular and Distributive Lattices

Modular and Distributive Lattices CHAPTER 4 Modular and Distributive Lattices Background R. P. DILWORTH Imbedding problems and the gluing construction. One of the most powerful tools in the study of modular lattices is the notion of the

More information

FIT5124 Advanced Topics in Security. Lecture 1: Lattice-Based Crypto. I

FIT5124 Advanced Topics in Security. Lecture 1: Lattice-Based Crypto. I FIT5124 Advanced Topics in Security Lecture 1: Lattice-Based Crypto. I Ron Steinfeld Clayton School of IT Monash University March 2016 Acknowledgements: Some figures sourced from Oded Regev s Lecture Notes

More information

CATEGORICAL SKEW LATTICES

CATEGORICAL SKEW LATTICES CATEGORICAL SKEW LATTICES MICHAEL KINYON AND JONATHAN LEECH Abstract. Categorical skew lattices are a variety of skew lattices on which the natural partial order is especially well behaved. While most

More information

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES

THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES THE IRREDUCIBILITY OF CERTAIN PURE-CYCLE HURWITZ SPACES FU LIU AND BRIAN OSSERMAN Abstract. We study pure-cycle Hurwitz spaces, parametrizing covers of the projective line having only one ramified point

More information

34.S-[F] SU-02 June All Syllabus Science Faculty B.Sc. I Yr. Stat. [Opt.] [Sem.I & II] - 1 -

34.S-[F] SU-02 June All Syllabus Science Faculty B.Sc. I Yr. Stat. [Opt.] [Sem.I & II] - 1 - [Sem.I & II] - 1 - [Sem.I & II] - 2 - [Sem.I & II] - 3 - Syllabus of B.Sc. First Year Statistics [Optional ] Sem. I & II effect for the academic year 2014 2015 [Sem.I & II] - 4 - SYLLABUS OF F.Y.B.Sc.

More information

Residuated Lattices of Size 12 extended version

Residuated Lattices of Size 12 extended version Residuated Lattices of Size 12 extended version Radim Belohlavek 1,2, Vilem Vychodil 1,2 1 Dept. Computer Science, Palacky University, Olomouc 17. listopadu 12, Olomouc, CZ 771 46, Czech Republic 2 SUNY

More information

Introduction Ideal lattices Ring-SIS Ring-LWE Other algebraic lattices Conclusion. Ideal Lattices. Damien Stehlé. ENS de Lyon. Berkeley, 07/07/2015

Introduction Ideal lattices Ring-SIS Ring-LWE Other algebraic lattices Conclusion. Ideal Lattices. Damien Stehlé. ENS de Lyon. Berkeley, 07/07/2015 Ideal Lattices Damien Stehlé ENS de Lyon Berkeley, 07/07/2015 Damien Stehlé Ideal Lattices 07/07/2015 1/32 Lattice-based cryptography: elegant but impractical Lattice-based cryptography is fascinating:

More information

32.S [F] SU 02 June All Syllabus Science Faculty B.A. I Yr. Stat. [Opt.] [Sem.I & II] 1

32.S [F] SU 02 June All Syllabus Science Faculty B.A. I Yr. Stat. [Opt.] [Sem.I & II] 1 32.S [F] SU 02 June 2014 2015 All Syllabus Science Faculty B.A. I Yr. Stat. [Opt.] [Sem.I & II] 1 32.S [F] SU 02 June 2014 2015 All Syllabus Science Faculty B.A. I Yr. Stat. [Opt.] [Sem.I & II] 2 32.S

More information

Differential Geometry: Curvature, Maps, and Pizza

Differential Geometry: Curvature, Maps, and Pizza Differential Geometry: Curvature, Maps, and Pizza Madelyne Ventura University of Maryland December 8th, 2015 Madelyne Ventura (University of Maryland) Curvature, Maps, and Pizza December 8th, 2015 1 /

More information

Financial Market Models. Lecture 1. One-period model of financial markets & hedging problems. Imperial College Business School

Financial Market Models. Lecture 1. One-period model of financial markets & hedging problems. Imperial College Business School Financial Market Models Lecture One-period model of financial markets & hedging problems One-period model of financial markets a 4 2a 3 3a 3 a 3 -a 4 2 Aims of section Introduce one-period model with finite

More information

On equation. Boris Bartolomé. January 25 th, Göttingen Universität & Institut de Mathémathiques de Bordeaux

On equation. Boris Bartolomé. January 25 th, Göttingen Universität & Institut de Mathémathiques de Bordeaux Göttingen Universität & Institut de Mathémathiques de Bordeaux Boris.Bartolome@mathematik.uni-goettingen.de Boris.Bartolome@math.u-bordeaux1.fr January 25 th, 2016 January 25 th, 2016 1 / 19 Overview 1

More information

Non replication of options

Non replication of options Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial

More information

Monte Carlo Methods in Finance

Monte Carlo Methods in Finance Monte Carlo Methods in Finance Peter Jackel JOHN WILEY & SONS, LTD Preface Acknowledgements Mathematical Notation xi xiii xv 1 Introduction 1 2 The Mathematics Behind Monte Carlo Methods 5 2.1 A Few Basic

More information

Generating all modular lattices of a given size

Generating all modular lattices of a given size Generating all modular lattices of a given size ADAM 2013 Nathan Lawless Chapman University June 6-8, 2013 Outline Introduction to Lattice Theory: Modular Lattices The Objective: Generating and Counting

More information

Exercises. 140 Chapter 3: Factors and Products

Exercises. 140 Chapter 3: Factors and Products Exercises A 3. List the first 6 multiples of each number. a) 6 b) 13 c) 22 d) 31 e) 45 f) 27 4. List the prime factors of each number. a) 40 b) 75 c) 81 d) 120 e) 140 f) 192 5. Write each number as a product

More information

Introduction to the Lattice Crypto Day

Introduction to the Lattice Crypto Day MAYA Introduction to the Lattice Crypto Day Phong Nguyễn http://www.di.ens.fr/~pnguyen May 2010 Summary History of Lattice-based Crypto Background on Lattices Lattice-based Crypto vs. Classical PKC Program

More information

Brouwer, A.E.; Koolen, J.H.

Brouwer, A.E.; Koolen, J.H. Brouwer, A.E.; Koolen, J.H. Published in: European Journal of Combinatorics DOI: 10.1016/j.ejc.008.07.006 Published: 01/01/009 Document Version Publisher s PDF, also known as Version of Record (includes

More information

Trust Region Methods for Unconstrained Optimisation

Trust Region Methods for Unconstrained Optimisation Trust Region Methods for Unconstrained Optimisation Lecture 9, Numerical Linear Algebra and Optimisation Oxford University Computing Laboratory, MT 2007 Dr Raphael Hauser (hauser@comlab.ox.ac.uk) The Trust

More information

Market Risk Analysis Volume I

Market Risk Analysis Volume I Market Risk Analysis Volume I Quantitative Methods in Finance Carol Alexander John Wiley & Sons, Ltd List of Figures List of Tables List of Examples Foreword Preface to Volume I xiii xvi xvii xix xxiii

More information

Forsyth Preparatory Academy

Forsyth Preparatory Academy Forsyth Preparatory Academy Community Support In an effort to inform prospective parents and the community about Forsyth Preparatory Academy, the start-up team created a website to describe the school,

More information

WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS

WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS WEIGHTED SUM OF THE EXTENSIONS OF THE REPRESENTATIONS OF QUADRATIC FORMS BYEONG-KWEON OH Abstract Let L, N and M be positive definite integral Z-lattices In this paper, we show some relation between the

More information

Lecture 5 Leadership and Reputation

Lecture 5 Leadership and Reputation Lecture 5 Leadership and Reputation Reputations arise in situations where there is an element of repetition, and also where coordination between players is possible. One definition of leadership is that

More information

Contents. An Overview of Statistical Applications CHAPTER 1. Contents (ix) Preface... (vii)

Contents. An Overview of Statistical Applications CHAPTER 1. Contents (ix) Preface... (vii) Contents (ix) Contents Preface... (vii) CHAPTER 1 An Overview of Statistical Applications 1.1 Introduction... 1 1. Probability Functions and Statistics... 1..1 Discrete versus Continuous Functions... 1..

More information

Computational Statistics Handbook with MATLAB

Computational Statistics Handbook with MATLAB «H Computer Science and Data Analysis Series Computational Statistics Handbook with MATLAB Second Edition Wendy L. Martinez The Office of Naval Research Arlington, Virginia, U.S.A. Angel R. Martinez Naval

More information

Stochastic Approximation Algorithms and Applications

Stochastic Approximation Algorithms and Applications Harold J. Kushner G. George Yin Stochastic Approximation Algorithms and Applications With 24 Figures Springer Contents Preface and Introduction xiii 1 Introduction: Applications and Issues 1 1.0 Outline

More information

General Lattice Theory: 1979 Problem Update

General Lattice Theory: 1979 Problem Update Algebra Universalis, 11 (1980) 396-402 Birkhauser Verlag, Basel General Lattice Theory: 1979 Problem Update G. GRATZER Listed below are all the solutions or partial solutions to problems in the book General

More information

Structured RAY Risk-Adjusted Yield for Securitizations and Loan Pools

Structured RAY Risk-Adjusted Yield for Securitizations and Loan Pools Structured RAY Risk-Adjusted Yield for Securitizations and Loan Pools Market Yields for Mortgage Loans The mortgage loans over which the R and D scoring occurs have risk characteristics that investors

More information

Prentice Hall Connected Mathematics 2, 7th Grade Units 2009 Correlated to: Minnesota K-12 Academic Standards in Mathematics, 9/2008 (Grade 7)

Prentice Hall Connected Mathematics 2, 7th Grade Units 2009 Correlated to: Minnesota K-12 Academic Standards in Mathematics, 9/2008 (Grade 7) 7.1.1.1 Know that every rational number can be written as the ratio of two integers or as a terminating or repeating decimal. Recognize that π is not rational, but that it can be approximated by rational

More information

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking!

CTL Model Checking. Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! CMSC 630 March 13, 2007 1 CTL Model Checking Goal Method for proving M sat σ, where M is a Kripke structure and σ is a CTL formula. Approach Model checking! Mathematically, M is a model of σ if s I = M

More information

Topic #1: Evaluating and Simplifying Algebraic Expressions

Topic #1: Evaluating and Simplifying Algebraic Expressions John Jay College of Criminal Justice The City University of New York Department of Mathematics and Computer Science MAT 105 - College Algebra Departmental Final Examination Review Topic #1: Evaluating

More information

Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras

Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras Lecture 23 Minimum Cost Flow Problem In this lecture, we will discuss the minimum cost

More information

Secant Varieties, Symbolic Powers, Statistical Models

Secant Varieties, Symbolic Powers, Statistical Models Secant Varieties, Symbolic Powers, Statistical Models Seth Sullivant North Carolina State University November 19, 2012 Seth Sullivant (NCSU) Secant Varieties, etc. November 19, 2012 1 / 27 Joins and Secant

More information

Contents. Heinemann Maths Zone

Contents. Heinemann Maths Zone Contents Chapter 1 Finance R1.1 Increasing a price by a percentage R1.2 Simple interest (1) R1.3 Simple interest (2) R1.4 Percentage profit (1) R1.5 Percentage profit (2) R1.6 The Distributive Law R1.7

More information

16 MAKING SIMPLE DECISIONS

16 MAKING SIMPLE DECISIONS 247 16 MAKING SIMPLE DECISIONS Let us associate each state S with a numeric utility U(S), which expresses the desirability of the state A nondeterministic action A will have possible outcome states Result

More information

Prentice Hall Connected Mathematics, Grade 7 Unit 2004 Correlated to: Maine Learning Results for Mathematics (Grades 5-8)

Prentice Hall Connected Mathematics, Grade 7 Unit 2004 Correlated to: Maine Learning Results for Mathematics (Grades 5-8) : Maine Learning Results for Mathematics (Grades 5-8) A. NUMBERS AND NUMBER SENSE Students will understand and demonstrate a sense of what numbers mean and how they are used. Students will be able to:

More information

BARUCH COLLEGE MATH 2003 SPRING 2006 MANUAL FOR THE UNIFORM FINAL EXAMINATION

BARUCH COLLEGE MATH 2003 SPRING 2006 MANUAL FOR THE UNIFORM FINAL EXAMINATION BARUCH COLLEGE MATH 003 SPRING 006 MANUAL FOR THE UNIFORM FINAL EXAMINATION The final examination for Math 003 will consist of two parts. Part I: Part II: This part will consist of 5 questions similar

More information

SF2972 GAME THEORY Infinite games

SF2972 GAME THEORY Infinite games SF2972 GAME THEORY Infinite games Jörgen Weibull February 2017 1 Introduction Sofar,thecoursehasbeenfocusedonfinite games: Normal-form games with a finite number of players, where each player has a finite

More information

OPTIMIZATION METHODS IN FINANCE

OPTIMIZATION METHODS IN FINANCE OPTIMIZATION METHODS IN FINANCE GERARD CORNUEJOLS Carnegie Mellon University REHA TUTUNCU Goldman Sachs Asset Management CAMBRIDGE UNIVERSITY PRESS Foreword page xi Introduction 1 1.1 Optimization problems

More information

Space lattices. By S. I. TOMKEIEFF, D.Sc., F.R.S.E., F.G.S. King's College, University of Durham, Newcastle-upon-Tyne. [Read January 27, 1955.

Space lattices. By S. I. TOMKEIEFF, D.Sc., F.R.S.E., F.G.S. King's College, University of Durham, Newcastle-upon-Tyne. [Read January 27, 1955. 625 T Space lattices. By S. I. TOMKEIEFF, D.Sc., F.R.S.E., F.G.S. King's College, University of Durham, Newcastle-upon-Tyne [Read January 27, 1955.] HE concept of a space lattice is fundamentalin crystallography.

More information

Approximating a multifactor di usion on a tree.

Approximating a multifactor di usion on a tree. Approximating a multifactor di usion on a tree. September 2004 Abstract A new method of approximating a multifactor Brownian di usion on a tree is presented. The method is based on local coupling of the

More information

Quality Sensitive Price Competition in. Secondary Market Spectrum Oligopoly- Multiple Locations

Quality Sensitive Price Competition in. Secondary Market Spectrum Oligopoly- Multiple Locations Quality Sensitive Price Competition in 1 Secondary Market Spectrum Oligopoly- Multiple Locations Arnob Ghosh and Saswati Sarkar arxiv:1404.6766v3 [cs.gt] 11 Oct 2015 Abstract We investigate a spectrum

More information

The University of Chicago, Booth School of Business Business 41202, Spring Quarter 2012, Mr. Ruey S. Tsay. Solutions to Final Exam

The University of Chicago, Booth School of Business Business 41202, Spring Quarter 2012, Mr. Ruey S. Tsay. Solutions to Final Exam The University of Chicago, Booth School of Business Business 41202, Spring Quarter 2012, Mr. Ruey S. Tsay Solutions to Final Exam Problem A: (40 points) Answer briefly the following questions. 1. Consider

More information

Continuous-time Stochastic Control and Optimization with Financial Applications

Continuous-time Stochastic Control and Optimization with Financial Applications Huyen Pham Continuous-time Stochastic Control and Optimization with Financial Applications 4y Springer Some elements of stochastic analysis 1 1.1 Stochastic processes 1 1.1.1 Filtration and processes 1

More information

Lecture l(x) 1. (1) x X

Lecture l(x) 1. (1) x X Lecture 14 Agenda for the lecture Kraft s inequality Shannon codes The relation H(X) L u (X) = L p (X) H(X) + 1 14.1 Kraft s inequality While the definition of prefix-free codes is intuitively clear, we

More information

Leech Constellations. of Construction-A Lattices

Leech Constellations. of Construction-A Lattices Leech Constellations of Construction-A Lattices Nicola di Pietro and Joseph J. Boutros, Senior Member, IEEE arxiv:1611.04417v3 [cs.it] 2 Aug 2017 Abstract The problem of communicating over the additive

More information

Contents. Preface... Part I Single-Objective Optimization

Contents. Preface... Part I Single-Objective Optimization Preface... xi Part I Single-Objective Optimization 1 Scarcity and Efficiency... 3 1.1 The Mathematical Programming Problem... 4 1.2 Mathematical Programming Models in Economics... 4 1.2.1 The Diet Problem...

More information

I Preliminary Material 1

I Preliminary Material 1 Contents Preface Notation xvii xxiii I Preliminary Material 1 1 From Diffusions to Semimartingales 3 1.1 Diffusions.......................... 5 1.1.1 The Brownian Motion............... 5 1.1.2 Stochastic

More information

Exercise sheet 10. Discussion: Thursday,

Exercise sheet 10. Discussion: Thursday, Exercise sheet 10 Discussion: Thursday, 04.02.2016. Exercise 10.1 Let K K n o, t > 0. Show that N (K, t B n ) N (K, 4t B n ) N (B n, (t/16)k ), N (B n, t K) N (B n, 4t K) N (K, (t/16)b n ). Hence, e.g.,

More information

Sales Sales

Sales Sales lix Lampiran I PT. Akasha Wira International Tbk PT. Tiga Pilar Sejahtera Food Tbk PT. Cahaya Kalbar Tbk 2010 2009 2008 2007 2010 2009 2008 2007 2010 2009 2008 2007 Sales 219 134 130 132 705 533 489 484

More information

Variations on a theme by Weetman

Variations on a theme by Weetman Variations on a theme by Weetman A.E. Brouwer Abstract We show for many strongly regular graphs, and for all Taylor graphs except the hexagon, that locally graphs have bounded diameter. 1 Locally graphs

More information

Models of Patterns. Lecture 3, SMMD 2005 Bob Stine

Models of Patterns. Lecture 3, SMMD 2005 Bob Stine Models of Patterns Lecture 3, SMMD 2005 Bob Stine Review Speculative investing and portfolios Risk and variance Volatility adjusted return Volatility drag Dependence Covariance Review Example Stock and

More information

Diffusions, Markov Processes, and Martingales

Diffusions, Markov Processes, and Martingales Diffusions, Markov Processes, and Martingales Volume 2: ITO 2nd Edition CALCULUS L. C. G. ROGERS School of Mathematical Sciences, University of Bath and DAVID WILLIAMS Department of Mathematics, University

More information

The mean-variance portfolio choice framework and its generalizations

The mean-variance portfolio choice framework and its generalizations The mean-variance portfolio choice framework and its generalizations Prof. Massimo Guidolin 20135 Theory of Finance, Part I (Sept. October) Fall 2014 Outline and objectives The backward, three-step solution

More information

On the number of one-factorizations of the complete graph on 12 points

On the number of one-factorizations of the complete graph on 12 points On the number of one-factorizations of the complete graph on 12 points D. K. Garnick J. H. Dinitz Department of Computer Science Department of Mathematics Bowdoin College University of Vermont Brunswick

More information

Pricing Kernel. v,x = p,y = p,ax, so p is a stochastic discount factor. One refers to p as the pricing kernel.

Pricing Kernel. v,x = p,y = p,ax, so p is a stochastic discount factor. One refers to p as the pricing kernel. Payoff Space The set of possible payoffs is the range R(A). This payoff space is a subspace of the state space and is a Euclidean space in its own right. 1 Pricing Kernel By the law of one price, two portfolios

More information

Implementing Models in Quantitative Finance: Methods and Cases

Implementing Models in Quantitative Finance: Methods and Cases Gianluca Fusai Andrea Roncoroni Implementing Models in Quantitative Finance: Methods and Cases vl Springer Contents Introduction xv Parti Methods 1 Static Monte Carlo 3 1.1 Motivation and Issues 3 1.1.1

More information

Algebra and Number Theory Exercise Set

Algebra and Number Theory Exercise Set Algebra and Number Theory Exercise Set Kamil Niedzia lomski 1 Algebra 1.1 Complex Numbers Exercise 1. Find real and imaginary part of complex numbers (1) 1 i 2+i (2) (3 + 7i)( 3 + i) (3) ( 3+i)( 1+i 3)

More information

Hyperidentities in (xx)y xy Graph Algebras of Type (2,0)

Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) Int. Journal of Math. Analysis, Vol. 8, 2014, no. 9, 415-426 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijma.2014.312299 Hyperidentities in (xx)y xy Graph Algebras of Type (2,0) W. Puninagool

More information

Congruence lattices of finite intransitive group acts

Congruence lattices of finite intransitive group acts Congruence lattices of finite intransitive group acts Steve Seif June 18, 2010 Finite group acts A finite group act is a unary algebra X = X, G, where G is closed under composition, and G consists of permutations

More information

General evaluation of suborbital graphs

General evaluation of suborbital graphs CMMA 3, No. 1, 42-50 (2018) 42 Communication in Mathematical Modeling and Applications http://ntmsci.com/cmma General evaluation of suborbital graphs Murat Beşenk Pamukkale University, Department of Mathematics,

More information

From Hypercubes to Adinkra Graphs

From Hypercubes to Adinkra Graphs From Hypercubes to Adinkra Graphs The vertices of a cube in a space of any dimension, N, can always be associated with the vertices of a vector of the form (±1,... N times..., ±1) so in the example of

More information

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem

Chapter 10: Mixed strategies Nash equilibria, reaction curves and the equality of payoffs theorem Chapter 10: Mixed strategies Nash equilibria reaction curves and the equality of payoffs theorem Nash equilibrium: The concept of Nash equilibrium can be extended in a natural manner to the mixed strategies

More information

METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES

METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES Bulletin of the Section of Logic Volume 8/4 (1979), pp. 191 195 reedition 2010 [original edition, pp. 191 196] David Miller METRIC POSTULATES FOR MODULAR, DISTRIBUTIVE, AND BOOLEAN LATTICES This is an

More information

Lecture 8 : The dual lattice and reducing SVP to MVP

Lecture 8 : The dual lattice and reducing SVP to MVP CSE 206A: Lattice Algorithms and Applications Spring 2007 Lecture 8 : The dual lattice and reducing SVP to MVP Lecturer: Daniele Micciancio Scribe: Scott Yilek 1 Overview In the last lecture we explored

More information

Partial Fractions. A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) =

Partial Fractions. A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) = Partial Fractions A rational function is a fraction in which both the numerator and denominator are polynomials. For example, f ( x) = 4, g( x) = 3 x 2 x + 5, and h( x) = x + 26 x 2 are rational functions.

More information

Classifying Solvency Capital Requirement Contribution of Collective Investments under Solvency II

Classifying Solvency Capital Requirement Contribution of Collective Investments under Solvency II Classifying Solvency Capital Requirement Contribution of Collective Investments under Solvency II Working Paper Series 2016-03 (01) SolvencyAnalytics.com March 2016 Classifying Solvency Capital Requirement

More information

Multidimensional Sampling of Isotropically Bandlimited Signals

Multidimensional Sampling of Isotropically Bandlimited Signals PREPRINT, MARCH 1, 017 1 Multiimensional Sampling of Isotropically Banlimite Signals Erik Agrell an Balázs Csébfalvi arxiv:1703.00471v1 [cs.it] 1 Mar 017 Abstract A new lower boun on the average reconstruction

More information

Nonlinear Manifold Learning for Financial Markets Integration

Nonlinear Manifold Learning for Financial Markets Integration Nonlinear Manifold Learning for Financial Markets Integration George Tzagkarakis 1 & Thomas Dionysopoulos 1,2 1 EONOS Investment Technologies, Paris (FR) 2 Dalton Strategic Partnership, London (UK) Nice,

More information

Understanding neural networks

Understanding neural networks Machine Learning Neural Networks Understanding neural networks An Artificial Neural Network (ANN) models the relationship between a set of input signals and an output signal using a model derived from

More information

On the Distribution and Its Properties of the Sum of a Normal and a Doubly Truncated Normal

On the Distribution and Its Properties of the Sum of a Normal and a Doubly Truncated Normal The Korean Communications in Statistics Vol. 13 No. 2, 2006, pp. 255-266 On the Distribution and Its Properties of the Sum of a Normal and a Doubly Truncated Normal Hea-Jung Kim 1) Abstract This paper

More information

Yao s Minimax Principle

Yao s Minimax Principle Complexity of algorithms The complexity of an algorithm is usually measured with respect to the size of the input, where size may for example refer to the length of a binary word describing the input,

More information

Kodaira dimensions of low dimensional manifolds

Kodaira dimensions of low dimensional manifolds University of Minnesota July 30, 2013 1 The holomorphic Kodaira dimension κ h 2 3 4 Kodaira dimension type invariants Roughly speaking, a Kodaira dimension type invariant on a class of n dimensional manifolds

More information

Lattice Cryptography: Introduction and Open Problems

Lattice Cryptography: Introduction and Open Problems Lattice Cryptography: Introduction and Open Problems Daniele Micciancio Department of Computer Science and Engineering University of California, San Diego August 2015 Daniele Micciancio (UCSD) Lattice

More information

Chapter 6 Simple Correlation and

Chapter 6 Simple Correlation and Contents Chapter 1 Introduction to Statistics Meaning of Statistics... 1 Definition of Statistics... 2 Importance and Scope of Statistics... 2 Application of Statistics... 3 Characteristics of Statistics...

More information

Chapter 5 Finite Difference Methods. Math6911 W07, HM Zhu

Chapter 5 Finite Difference Methods. Math6911 W07, HM Zhu Chapter 5 Finite Difference Methods Math69 W07, HM Zhu References. Chapters 5 and 9, Brandimarte. Section 7.8, Hull 3. Chapter 7, Numerical analysis, Burden and Faires Outline Finite difference (FD) approximation

More information

The folk theorem revisited

The folk theorem revisited Economic Theory 27, 321 332 (2006) DOI: 10.1007/s00199-004-0580-7 The folk theorem revisited James Bergin Department of Economics, Queen s University, Ontario K7L 3N6, CANADA (e-mail: berginj@qed.econ.queensu.ca)

More information

The Geometry of Interest Rate Risk

The Geometry of Interest Rate Risk The Geometry of Interest Rate Risk [Maio-de Jong (2014)] World Finance Conference, Buenos Aires, Argentina, July 23 rd 2015 Michele Maio ugly Duckling m.maio@uglyduckling.nl Slides available at: http://uglyduckling.nl/wfc2015

More information

The Smarandache Curves on H 0

The Smarandache Curves on H 0 Gazi University Journal of Science GU J Sci 9():69-77 (6) The Smarandache Curves on H Murat SAVAS, Atakan Tugkan YAKUT,, Tugba TAMIRCI Gazi University, Faculty of Sciences, Department of Mathematics, 65

More information

ELEMENTS OF MATRIX MATHEMATICS

ELEMENTS OF MATRIX MATHEMATICS QRMC07 9/7/0 4:45 PM Page 5 CHAPTER SEVEN ELEMENTS OF MATRIX MATHEMATICS 7. AN INTRODUCTION TO MATRICES Investors frequently encounter situations involving numerous potential outcomes, many discrete periods

More information

The illustrated zoo of order-preserving functions

The illustrated zoo of order-preserving functions The illustrated zoo of order-preserving functions David Wilding, February 2013 http://dpw.me/mathematics/ Posets (partially ordered sets) underlie much of mathematics, but we often don t give them a second

More information