Turaev-Viro TQFTs via Planar Algebras

Size: px
Start display at page:

Download "Turaev-Viro TQFTs via Planar Algebras"

Transcription

1 Turaev-Viro TQFTs via Planar lgebras hris Schommer-Pries epartment of Mathematics, MIT July 12 th, 2011 hris Schommer-Pries (MIT) July 12 th, / 30

2 How To onstruct a TQFT: 1 lgebraic Input 2 ombinatorial escription of Manifolds 3 Shake them together... hris Schommer-Pries (MIT) July 12 th, / 30

3 How To onstruct a TQFT: 1 lgebraic Input 2 ombinatorial escription of Manifolds 3 Shake them together... 1 Speherical Tensor ategory/planar lgebra 2 Triangulations of 3-Manifolds 3 The Turaev-Viro onstruction... hris Schommer-Pries (MIT) July 12 th, / 30

4 Triangulations of Manifolds Theorem (Pachner) ny two triangulations of d-manifolds can be related by a finite sequence of Pachner moves (k d + 2 k) 1 k d/2 + 1 hris Schommer-Pries (MIT) July 12 th, / 30

5 Triangulations of Manifolds Theorem (Pachner) ny two triangulations of d-manifolds can be related by a finite sequence of Pachner moves (k d + 2 k) 1 k d/ hris Schommer-Pries (MIT) July 12 th, / 30

6 3 Pachner Moves: The 2-3 Move: The 1-4 Move: hris Schommer-Pries (MIT) July 12 th, / 30

7 The Turaev-Viro onstruction Basic Idea: M = 3-manifold, = Spherical ategory. triangulate M 3, order the vertices. hris Schommer-Pries (MIT) July 12 th, / 30

8 The Turaev-Viro onstruction Basic Idea: M = 3-manifold, = Spherical ategory. triangulate M 3, order the vertices. Label triangulation with ata from Get a number for each tetrahedron. hris Schommer-Pries (MIT) July 12 th, / 30

9 The Turaev-Viro onstruction Basic Idea: M = 3-manifold, = Spherical ategory. triangulate M 3, order the vertices. Label triangulation with ata from Get a number for each tetrahedron. Multiply the numbers for each tetrahedron. Sum over labelings. (Prove invariance under 2-3 moves, 1-4 moves, and reordering) Get a Manifold Invaraint! hris Schommer-Pries (MIT) July 12 th, / 30

10 The Turaev-Viro onstruction Basic Idea: M = 3-manifold, = Spherical ategory. triangulate M 3, order the vertices. Label triangulation with ata from Get a number for each tetrahedron. Multiply the numbers for each tetrahedron. Sum over labelings. (Prove invariance under 2-3 moves, 1-4 moves, and reordering) Get a Manifold Invaraint! Miracle: This invariant is not trivial! hris Schommer-Pries (MIT) July 12 th, / 30

11 Properties of Planar lgebras Z σ Simple Objects (,, Z, ) Morphisms hris Schommer-Pries (MIT) July 12 th, / 30

12 Properties of Planar lgebras Simple Objects (,, Z, ) Morphisms ual Morphisms µ Z hris Schommer-Pries (MIT) July 12 th, / 30

13 Properties of Planar lgebras Z Simple Objects (,, Z, ) σ Morphisms ual Morphisms µ Hermitian Inner Product (positive definite!) µ, σ Z Basis {σ i } for Hom(, Z) also gives a daul basis {σi }! for Hom(Z, ). hris Schommer-Pries (MIT) July 12 th, / 30

14 Basis for Hom(, Z) also gives basis for Hom( Z, ) (rotate in planar algebra!) hris Schommer-Pries (MIT) July 12 th, / 30

15 Basis for Hom(, Z) also gives basis for Hom( Z, ) (rotate in planar algebra!) and Hom(Z, ) σ Z hris Schommer-Pries (MIT) July 12 th, / 30

16 Is it orthonormal? σ Z σ hris Schommer-Pries (MIT) July 12 th, / 30

17 Is it orthonormal? σ Z σ Z d(z)d() 1 σ Z σ hris Schommer-Pries (MIT) July 12 th, / 30

18 Is it orthonormal? Z σ d(z)d() 1 Z σ hris Schommer-Pries (MIT) July 12 th, / 30

19 Is it orthonormal? Z σ σ d(z)d() 1 Z hris Schommer-Pries (MIT) July 12 th, / 30

20 Is it orthonormal? Z σ d(z)d() 1 Need to rescale by a factor of d(z) 1 d(). σ Z hris Schommer-Pries (MIT) July 12 th, / 30

21 How to Label a Tetrahedron and get a Number hoose representative simples, B,,,, Z,... hoose basis {σ i } for each Hom( B, ). Label edges with simple objects. Label faces with elements σ i. Then... hris Schommer-Pries (MIT) July 12 th, / 30

22 B σ 2 σ 3 σ2 σ 1 σ 1 B σ 3 σ 4 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

23 Get a formula... Z(M, }{{} τ = triangulation) edge lables face labels If orientation of T disagrees with M, use Z(T ). tetrahedra T Z(T ) How to prove invariance? Is it even invariant? hris Schommer-Pries (MIT) July 12 th, / 30

24 Reordering Vertices What happens when we reorder the vertices? B σ 2 σ 1 σ 3 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

25 Reordering Vertices What happens when we reorder the vertices? Original (13)-edge label: B, (02)-edge label: Z(T 0 1 )/Z(T ) = d(b) 1 d() 1 d()d() (13)-edge:, (02)-edge: B σ 1 σ 2 σ 3 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

26 Reordering Vertices What happens when we reorder the vertices? Original (13)-edge label: B, (02)-edge label: Z(T 0 1 )/Z(T ) = d(b) 1 d() 1 d()d() (13)-edge:, (02)-edge: Z(T 1 2 )/Z(T ) = d(b) 1 d() 1 d( )d( ) (13)-edge:, (02)-edge: B σ 1 σ 2 σ 3 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

27 Reordering Vertices What happens when we reorder the vertices? Original (13)-edge label: B, (02)-edge label: Z(T 0 1 )/Z(T ) = d(b) 1 d() 1 d()d() B σ 2 (13)-edge:, (02)-edge: Z(T 1 2 )/Z(T ) = σ 1 d(b) 1 d() 1 d( )d( ) (13)-edge:, (02)-edge: Z(T 1 3 )/Z(T ) = d(b) 1 d() 1 d()d(b) σ4 (13)-edge: B, (02)-edge: σ 3 hris Schommer-Pries (MIT) July 12 th, / 30

28 Reordering Vertices What happens when we reorder the vertices? Original (13)-edge label: B, (02)-edge label: Z(T 0 1 )/Z(T ) = d(b) 1 d() 1 d()d() (13)-edge:, (02)-edge: Z(T 1 2 )/Z(T ) = d(b) 1 d() 1 d( )d( ) (13)-edge:, (02)-edge: Z(T 1 3 )/Z(T ) = d(b) 1 d() 1 d()d(b) (13)-edge: B, (02)-edge: B σ 1 σ 2 σ 4 σ 3 orrection factor: d(b) 1 d() 1 hris Schommer-Pries (MIT) July 12 th, / 30

29 Invariance: Z(M, }{{} τ = triangulation) edge lables Vertex order 2-3 Pachner Move 1-4 Pachner Move face labels tetrahedra T Z corrected (T ) hris Schommer-Pries (MIT) July 12 th, / 30

30 First Identity: σ σ σ λ λ hris Schommer-Pries (MIT) July 12 th, / 30

31 Second Identity: B B µ µ σ σ,g G σ λ λ hris Schommer-Pries (MIT) July 12 th, / 30

32 2-3 Move hris Schommer-Pries (MIT) July 12 th, / 30

33 B H E F B E B F H hris Schommer-Pries (MIT) July 12 th, / 30

34 σ 3 σ 2 B σ 2 σ 1 B σ 1 σ 3 σ 5 σ 4 E σ 2 B F H σ 7 σ6 H σ 5 B σ 6 F E σ 2 σ 7 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

35 H σ 6 H σ 6 σ 5 F σ 5 F E E B σ 7 σ 7 σ2 σ 2 B B σ 2 σ 1 σ 1 σ 3 σ 3 σ 4 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

36 Second Half of 2-3 Move hris Schommer-Pries (MIT) July 12 th, / 30

37 σ 8 σ 7 E σ 5 E F σ 10 σ 1 G B H σ 8 G σ 9 σ 10 σ 4 G F σ 6 σ 9 H σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

38 H B σ 5 G σ 10 σ 1 E H σ 6 σ 8 E F G σ 8 σ 9 F σ 7 σ 9 G σ 3 H σ 10 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

39 H σ6 B σ5 σ1 E σ8 G F H σ 9 σ9 G σ 10 G σ10 σ8 F E σ7 σ 4 σ 3 hris Schommer-Pries (MIT) July 12 th, / 30

40 H σ6 B σ5 σ1 E σ8 G F H σ 9 σ9 G σ 10 G σ10 σ8 F E σ7 σ 4 σ 3 hris Schommer-Pries (MIT) July 12 th, / 30

41 H σ6 B σ1 σ5 E σ8 G σ9 F σ1 B σ5 H E σ6 H F σ9 G σ 10 σ8 G σ 8 G σ10 E σ8 F σ 7 E σ 7 σ 3 σ3 σ4 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

42 H σ6 H σ6 B σ1 σ5 E σ8 G σ9 F σ1 B σ5 H E σ6 B σ5 E F σ 7 H F σ9 G σ 10 σ8 G σ 8 σ1 G σ8 σ10 F E σ7 E σ3 σ 7 σ4 σ 3 σ3 σ4 σ 4 hris Schommer-Pries (MIT) July 12 th, / 30

43 What about the correction factors? orrection factor of first half (2) d(b) 1 d() 1 d(h) 1 d( ) 1 orrection factor of second half (3) d(b) 1 d(g) 1 d(h) 1 d() 1 d(g) 1 d( ) 1 hris Schommer-Pries (MIT) July 12 th, / 30

44 What about the correction factors? orrection factor of first half (2) d(b) 1 d() 1 d(h) 1 d( ) 1 orrection factor of second half (3) d(b) 1 d(g) 1 d(h) 1 d() 1 d(g) 1 d( ) 1 They differ by d(g) 1 hris Schommer-Pries (MIT) July 12 th, / 30

45 What about the correction factors? orrection factor of first half (2) d(b) 1 d() 1 d(h) 1 d( ) 1 orrection factor of second half (3) d(b) 1 d(g) 1 d(h) 1 d() 1 d(g) 1 d( ) 1 They differ by d(g) 1 Edge orrection Factor: edges d(edge label) hris Schommer-Pries (MIT) July 12 th, / 30

46 Invariance: Z(M, }{{} τ = triangulation) edge lables Vertex order 2-3 Pachner Move 1-4 Pachner Move face labels tetrahedra T Z cor (T ) ( edge factor ) edges hris Schommer-Pries (MIT) July 12 th, / 30

47 What about the 1-4 Move? hris Schommer-Pries (MIT) July 12 th, / 30

48 What about the 1-4 Move? Exercise Prove that the two sides of the 1-4 Move differ by a factor of w = E d(e) 2 where E ranges over a complete set of simples. hris Schommer-Pries (MIT) July 12 th, / 30

49 The Turaev-Viro Invariant Z(M, }{{} τ ) = triangulation Invariance: Vertex order 2-3 Pachner Move 1-4 Pachner Move 1 w #vertices edge lables face labels tetrahedra T Z cor (T ) ( edge factor ) edges hris Schommer-Pries (MIT) July 12 th, / 30

50 Exercise For the 2 planar algebra, for M 3 closed, Z(M) = #(H 1 (M; Z/2)). hris Schommer-Pries (MIT) July 12 th, / 30

Structural Induction

Structural Induction Structural Induction Jason Filippou CMSC250 @ UMCP 07-05-2016 Jason Filippou (CMSC250 @ UMCP) Structural Induction 07-05-2016 1 / 26 Outline 1 Recursively defined structures 2 Proofs Binary Trees Jason

More information

Palindromic Permutations and Generalized Smarandache Palindromic Permutations

Palindromic Permutations and Generalized Smarandache Palindromic Permutations arxiv:math/0607742v2 [mathgm] 8 Sep 2007 Palindromic Permutations and Generalized Smarandache Palindromic Permutations Tèmítópé Gbóláhàn Jaíyéọlá Department of Mathematics, Obafemi Awolowo University,

More information

Course Information and Introduction

Course Information and Introduction August 20, 2015 Course Information 1 Instructor : Email : arash.rafiey@indstate.edu Office : Root Hall A-127 Office Hours : Tuesdays 12:00 pm to 1:00 pm in my office (A-127) 2 Course Webpage : http://cs.indstate.edu/

More information

Notes on the symmetric group

Notes on the symmetric group Notes on the symmetric group 1 Computations in the symmetric group Recall that, given a set X, the set S X of all bijections from X to itself (or, more briefly, permutations of X) is group under function

More information

Bianchi (hyper-)cubes and a geometric unification of the Hirota and Miwa equations. W.K. Schief. The University of New South Wales, Sydney

Bianchi (hyper-)cubes and a geometric unification of the Hirota and Miwa equations. W.K. Schief. The University of New South Wales, Sydney Bianchi (hyper-)cubes and a geometric unification of the Hirota and Miwa equations by W.K. Schief The University of New South Wales, Sydney ARC Centre of Excellence for Mathematics and Statistics of Complex

More information

Basic Arbitrage Theory KTH Tomas Björk

Basic Arbitrage Theory KTH Tomas Björk Basic Arbitrage Theory KTH 2010 Tomas Björk Tomas Björk, 2010 Contents 1. Mathematics recap. (Ch 10-12) 2. Recap of the martingale approach. (Ch 10-12) 3. Change of numeraire. (Ch 26) Björk,T. Arbitrage

More information

Risk Neutral Measures

Risk Neutral Measures CHPTER 4 Risk Neutral Measures Our aim in this section is to show how risk neutral measures can be used to price derivative securities. The key advantage is that under a risk neutral measure the discounted

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

MAS452/MAS6052. MAS452/MAS Turn Over SCHOOL OF MATHEMATICS AND STATISTICS. Stochastic Processes and Financial Mathematics

MAS452/MAS6052. MAS452/MAS Turn Over SCHOOL OF MATHEMATICS AND STATISTICS. Stochastic Processes and Financial Mathematics t r t r2 r t SCHOOL OF MATHEMATICS AND STATISTICS Stochastic Processes and Financial Mathematics Spring Semester 2017 2018 3 hours t s s tt t q st s 1 r s r t r s rts t q st s r t r r t Please leave this

More information

ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games

ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games University of Illinois Fall 2018 ECE 586GT: Problem Set 1: Problems and Solutions Analysis of static games Due: Tuesday, Sept. 11, at beginning of class Reading: Course notes, Sections 1.1-1.4 1. [A random

More information

Maximizing the Spread of Influence through a Social Network

Maximizing the Spread of Influence through a Social Network Maximizing the Spread of Influence through a Social Network Han Wang Department of omputer Science ETH Zürich Problem Example 1: Spread of Rumor 2012 = end! A D E B F Problem Example 2: Viral Marketing

More information

Lecture 23: April 10

Lecture 23: April 10 CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 23: April 10 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They

More information

Distribution of the Sample Mean

Distribution of the Sample Mean Distribution of the Sample Mean MATH 130, Elements of Statistics I J. Robert Buchanan Department of Mathematics Fall 2018 Experiment (1 of 3) Suppose we have the following population : 4 8 1 2 3 4 9 1

More information

d-collapsibility is NP-complete for d 4

d-collapsibility is NP-complete for d 4 d-collapsibility is NP-complete for d 4 Martin Tancer June 22, 2010 Abstract A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of

More information

Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect

Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect x x in x in x in y z y in F F z in t F F z in t F F t 0 y out T y out T z out T Jean Cardinal, Erik Demaine, David

More information

Martingale Measure TA

Martingale Measure TA Martingale Measure TA Martingale Measure a) What is a martingale? b) Groundwork c) Definition of a martingale d) Super- and Submartingale e) Example of a martingale Table of Content Connection between

More information

A relation on 132-avoiding permutation patterns

A relation on 132-avoiding permutation patterns Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,

More information

Optimal stopping problems for a Brownian motion with a disorder on a finite interval

Optimal stopping problems for a Brownian motion with a disorder on a finite interval Optimal stopping problems for a Brownian motion with a disorder on a finite interval A. N. Shiryaev M. V. Zhitlukhin arxiv:1212.379v1 [math.st] 15 Dec 212 December 18, 212 Abstract We consider optimal

More information

Brownian Motion. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011

Brownian Motion. Richard Lockhart. Simon Fraser University. STAT 870 Summer 2011 Brownian Motion Richard Lockhart Simon Fraser University STAT 870 Summer 2011 Richard Lockhart (Simon Fraser University) Brownian Motion STAT 870 Summer 2011 1 / 33 Purposes of Today s Lecture Describe

More information

Discrete Random Variables

Discrete Random Variables Discrete Random Variables MATH 130, Elements of Statistics I J. Robert Buchanan Department of Mathematics Fall 2018 Objectives During this lesson we will learn to: distinguish between discrete and continuous

More information

Discrete Random Variables

Discrete Random Variables Discrete Random Variables MATH 130, Elements of Statistics I J. Robert Buchanan Department of Mathematics Fall 2017 Objectives During this lesson we will learn to: distinguish between discrete and continuous

More information

Class 16. Daniel B. Rowe, Ph.D. Department of Mathematics, Statistics, and Computer Science. Marquette University MATH 1700

Class 16. Daniel B. Rowe, Ph.D. Department of Mathematics, Statistics, and Computer Science. Marquette University MATH 1700 Class 16 Daniel B. Rowe, Ph.D. Department of Mathematics, Statistics, and Computer Science Copyright 013 by D.B. Rowe 1 Agenda: Recap Chapter 7. - 7.3 Lecture Chapter 8.1-8. Review Chapter 6. Problem Solving

More information

4 Martingales in Discrete-Time

4 Martingales in Discrete-Time 4 Martingales in Discrete-Time Suppose that (Ω, F, P is a probability space. Definition 4.1. A sequence F = {F n, n = 0, 1,...} is called a filtration if each F n is a sub-σ-algebra of F, and F n F n+1

More information

On the Number of Permutations Avoiding a Given Pattern

On the Number of Permutations Avoiding a Given Pattern On the Number of Permutations Avoiding a Given Pattern Noga Alon Ehud Friedgut February 22, 2002 Abstract Let σ S k and τ S n be permutations. We say τ contains σ if there exist 1 x 1 < x 2

More information

Section The Sampling Distribution of a Sample Mean

Section The Sampling Distribution of a Sample Mean Section 5.2 - The Sampling Distribution of a Sample Mean Statistics 104 Autumn 2004 Copyright c 2004 by Mark E. Irwin The Sampling Distribution of a Sample Mean Example: Quality control check of light

More information

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010

Outline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010 May 19, 2010 1 Introduction Scope of Agent preferences Utility Functions 2 Game Representations Example: Game-1 Extended Form Strategic Form Equivalences 3 Reductions Best Response Domination 4 Solution

More information

Central limit theorems

Central limit theorems Chapter 6 Central limit theorems 6.1 Overview Recall that a random variable Z is said to have a standard normal distribution, denoted by N(0, 1), if it has a continuous distribution with density φ(z) =

More information

SUPERSYMMETRY WITHOUT SUPERSYMMETRY : DETERMINANTS AND PFAFFIANS IN RMT

SUPERSYMMETRY WITHOUT SUPERSYMMETRY : DETERMINANTS AND PFAFFIANS IN RMT SUPERSYMMETRY WITHOUT SUPERSYMMETRY : DETERMINANTS AND PFAFFIANS IN RMT Mario Kieburg Universität Duisburg-Essen SFB/TR-12 Workshop on Langeoog (Germany), February 22 nd 2010 supported by OUTLINE (1) Characteristic

More information

A Fuzzy Vertex Graceful Labeling On Friendship and Double Star Graphs

A Fuzzy Vertex Graceful Labeling On Friendship and Double Star Graphs IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 14, Issue 4 Ver. III (Jul - Aug 2018), PP 47-51 www.iosrjournals.org A Fuzzy Vertex Graceful Labeling On Friendship and

More information

MAC Learning Objectives. Learning Objectives (Cont.)

MAC Learning Objectives. Learning Objectives (Cont.) MAC 1140 Module 12 Introduction to Sequences, Counting, The Binomial Theorem, and Mathematical Induction Learning Objectives Upon completing this module, you should be able to 1. represent sequences. 2.

More information

CONTINUOUS TIME PRICING AND TRADING: A REVIEW, WITH SOME EXTRA PIECES

CONTINUOUS TIME PRICING AND TRADING: A REVIEW, WITH SOME EXTRA PIECES CONTINUOUS TIME PRICING AND TRADING: A REVIEW, WITH SOME EXTRA PIECES THE SOURCE OF A PRICE IS ALWAYS A TRADING STRATEGY SPECIAL CASES WHERE TRADING STRATEGY IS INDEPENDENT OF PROBABILITY MEASURE COMPLETENESS,

More information

arxiv: v1 [math.dg] 8 May 2013

arxiv: v1 [math.dg] 8 May 2013 CURVES OF GENERALIZED AW(k)-TYPE IN EUCLIDEAN SPACES Kadri ARSLAN Şaban GÜVENÇ arxiv:1305.1733v1 [math.dg] 8 May 013 Abstract. In this study we consider curves of generalized AW(k)-type of Euclidean n-space.

More information

The Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales

The Probabilistic Method - Probabilistic Techniques. Lecture 7: Martingales The Probabilistic Method - Probabilistic Techniques Lecture 7: Martingales Sotiris Nikoletseas Associate Professor Computer Engineering and Informatics Department 2015-2016 Sotiris Nikoletseas, Associate

More information

Game Theory: Normal Form Games

Game Theory: Normal Form Games Game Theory: Normal Form Games Michael Levet June 23, 2016 1 Introduction Game Theory is a mathematical field that studies how rational agents make decisions in both competitive and cooperative situations.

More information

Sequences and Series

Sequences and Series Edexcel GCE Core Mathematics C2 Advanced Subsidiary Sequences and Series Materials required for examination Mathematical Formulae (Pink or Green) Items included with question papers Nil Advice to Candidates

More information

STAAR Algebra 1 EOC. eporting. ategory5. Assessment Items. Includes 12 Multiple Choice

STAAR Algebra 1 EOC. eporting. ategory5. Assessment Items. Includes 12 Multiple Choice ategory5 R eporting ssessment Items Includes 12 Multiple hoice omain and Range of Exponential Functions Graphing Exponential Functions and Identifying Key Features Writing and Interpreting Exponential

More information

Applied Mathematics Letters

Applied Mathematics Letters Applied Mathematics Letters 23 (2010) 286 290 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: wwwelseviercom/locate/aml The number of spanning trees of a graph Jianxi

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

An application of braid ordering to knot theory

An application of braid ordering to knot theory January 11, 2009 Plan of the talk I The Dehornoy ordering, Dehornoy floor I Dehornoy floor and genus of closed braid I Nielsen-Thurston classification and Geometry of closed braid Braid groups I B n :

More information

On the Pentagon Relations of Valued Quivers

On the Pentagon Relations of Valued Quivers International Journal of Algebra, Vol. 9, 2015, no. 8, 355-369 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ija.2015.5745 On the Pentagon Relations of Valued Quivers Yousuf A. Alkhezi Public

More information

Conjugate priors: Beta and normal Class 15, Jeremy Orloff and Jonathan Bloom

Conjugate priors: Beta and normal Class 15, Jeremy Orloff and Jonathan Bloom 1 Learning Goals Conjugate s: Beta and normal Class 15, 18.05 Jeremy Orloff and Jonathan Bloom 1. Understand the benefits of conjugate s.. Be able to update a beta given a Bernoulli, binomial, or geometric

More information

Modeling via Stochastic Processes in Finance

Modeling via Stochastic Processes in Finance Modeling via Stochastic Processes in Finance Dimbinirina Ramarimbahoaka Department of Mathematics and Statistics University of Calgary AMAT 621 - Fall 2012 October 15, 2012 Question: What are appropriate

More information

STAT/MATH 395 PROBABILITY II

STAT/MATH 395 PROBABILITY II STAT/MATH 395 PROBABILITY II Distribution of Random Samples & Limit Theorems Néhémy Lim University of Washington Winter 2017 Outline Distribution of i.i.d. Samples Convergence of random variables The Laws

More information

Equivalence between Semimartingales and Itô Processes

Equivalence between Semimartingales and Itô Processes International Journal of Mathematical Analysis Vol. 9, 215, no. 16, 787-791 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/1.12988/ijma.215.411358 Equivalence between Semimartingales and Itô Processes

More information

LECTURE 2: MULTIPERIOD MODELS AND TREES

LECTURE 2: MULTIPERIOD MODELS AND TREES LECTURE 2: MULTIPERIOD MODELS AND TREES 1. Introduction One-period models, which were the subject of Lecture 1, are of limited usefulness in the pricing and hedging of derivative securities. In real-world

More information

Development Separation in Lambda-Calculus

Development Separation in Lambda-Calculus WoLLIC 2005 Preliminary Version Development Separation in Lambda-Calculus Hongwei Xi 1,2 Computer Science Department Boston University Boston, Massachusetts, USA Abstract We present a proof technique in

More information

Option pricing in the stochastic volatility model of Barndorff-Nielsen and Shephard

Option pricing in the stochastic volatility model of Barndorff-Nielsen and Shephard Option pricing in the stochastic volatility model of Barndorff-Nielsen and Shephard Indifference pricing and the minimal entropy martingale measure Fred Espen Benth Centre of Mathematics for Applications

More information

Permutation Factorizations and Prime Parking Functions

Permutation Factorizations and Prime Parking Functions Permutation Factorizations and Prime Parking Functions Amarpreet Rattan Department of Combinatorics and Optimization University of Waterloo Waterloo, ON, Canada N2L 3G1 arattan@math.uwaterloo.ca June 10,

More information

arxiv: v1 [math.co] 31 Mar 2009

arxiv: v1 [math.co] 31 Mar 2009 A BIJECTION BETWEEN WELL-LABELLED POSITIVE PATHS AND MATCHINGS OLIVIER BERNARDI, BERTRAND DUPLANTIER, AND PHILIPPE NADEAU arxiv:0903.539v [math.co] 3 Mar 009 Abstract. A well-labelled positive path of

More information

Rough paths methods 2: Young integration

Rough paths methods 2: Young integration Rough paths methods 2: Young integration Samy Tindel Purdue University University of Aarhus 2016 Samy T. (Purdue) Rough Paths 2 Aarhus 2016 1 / 75 Outline 1 Some basic properties of fbm 2 Simple Young

More information

Chapter 6 Analyzing Accumulated Change: Integrals in Action

Chapter 6 Analyzing Accumulated Change: Integrals in Action Chapter 6 Analyzing Accumulated Change: Integrals in Action 6. Streams in Business and Biology You will find Excel very helpful when dealing with streams that are accumulated over finite intervals. Finding

More information

Bounds on coloring numbers

Bounds on coloring numbers Ben-Gurion University, Beer Sheva, and the Institute for Advanced Study, Princeton NJ January 15, 2011 Table of contents 1 Introduction 2 3 Infinite list-chromatic number Assuming cardinal arithmetic is

More information

An Approach to Asset-Pricing Under Incomplete and Diverse Perceptions

An Approach to Asset-Pricing Under Incomplete and Diverse Perceptions An Approach to Asset-Pricing Under Incomplete and Diverse Perceptions May 8, 2013 Introduction Understanding nancial markets Classical approach for modeling expectations theories complete + homogenous

More information

THE MARTINGALE METHOD DEMYSTIFIED

THE MARTINGALE METHOD DEMYSTIFIED THE MARTINGALE METHOD DEMYSTIFIED SIMON ELLERSGAARD NIELSEN Abstract. We consider the nitty gritty of the martingale approach to option pricing. These notes are largely based upon Björk s Arbitrage Theory

More information

RELATIONS IN THE TAUTOLOGICAL RING OF THE MODULI SPACE OF K3 SURFACES

RELATIONS IN THE TAUTOLOGICAL RING OF THE MODULI SPACE OF K3 SURFACES RELATIONS IN THE TAUTOLOGICAL RING OF THE MODULI SPACE OF K3 SURFACES RAHUL PANDHARIPANDE AND QIZHENG YIN Abstract. We study the interplay of the moduli of curves and the moduli of K3 surfaces via the

More information

Valuation of derivative assets Lecture 8

Valuation of derivative assets Lecture 8 Valuation of derivative assets Lecture 8 Magnus Wiktorsson September 27, 2018 Magnus Wiktorsson L8 September 27, 2018 1 / 14 The risk neutral valuation formula Let X be contingent claim with maturity T.

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

WKB Method for Swaption Smile

WKB Method for Swaption Smile WKB Method for Swaption Smile Andrew Lesniewski BNP Paribas New York February 7 2002 Abstract We study a three-parameter stochastic volatility model originally proposed by P. Hagan for the forward swap

More information

2.8 Absolute Value Functions

2.8 Absolute Value Functions 2.8 Absolute Value Functions Algebra III Mr. Niedert Algebra III 2.8 Absolute Value Functions Mr. Niedert 1 / 8 Today s Learning Target(s) 1 I can graph absolute value functions and apply them to real-life

More information

TENSOR PRODUCT IN CATEGORY O κ.

TENSOR PRODUCT IN CATEGORY O κ. TENSOR PRODUCT IN CATEGORY O κ. GIORGIA FORTUNA Let V 1,..., V n be ĝ κ -modules. Today we will construct a new object V 1 V n in O κ that plays the role of the usual tensor product. Unfortunately in fact

More information

Network Analysis Basic Components. The Other View. Some Applications. Continued. Goal of Network Analysis. RK Jana

Network Analysis Basic Components. The Other View. Some Applications. Continued. Goal of Network Analysis. RK Jana Network nalysis RK Jana asic omponents ollections of interconnected linear forms: Lines Intersections Regions (created by the partitioning of space by the lines) Planar (streets, all on same level, vertices

More information

Common Misconceptions about "Beta" Hedging, Estimation and Horizon Effects 1

Common Misconceptions about Beta Hedging, Estimation and Horizon Effects 1 QuantNugget3 Common Misconceptions about "Beta" Hedging, Estimation and Horizon Effects 1 Attilio Meucci 2 attilio_meucci@symmys.com this version: eptember 27 2010 last version available at: http://ssrn.com/abstract=1619923

More information

Discrete Applied Mathematics

Discrete Applied Mathematics Discrete Applied Mathematics 157 (2009) 3055 3068 Contents lists availle at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam The unambiguity of segmented morphisms

More information

Rational Behaviour and Strategy Construction in Infinite Multiplayer Games

Rational Behaviour and Strategy Construction in Infinite Multiplayer Games Rational Behaviour and Strategy Construction in Infinite Multiplayer Games Michael Ummels ummels@logic.rwth-aachen.de FSTTCS 2006 Michael Ummels Rational Behaviour and Strategy Construction 1 / 15 Infinite

More information

hp-version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes

hp-version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes hp-version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes Andrea Cangiani Department of Mathematics University of Leicester Joint work with: E. Georgoulis & P. Dong (Leicester), P. Houston

More information

Techniques for Calculating the Efficient Frontier

Techniques for Calculating the Efficient Frontier Techniques for Calculating the Efficient Frontier Weerachart Kilenthong RIPED, UTCC c Kilenthong 2017 Tee (Riped) Introduction 1 / 43 Two Fund Theorem The Two-Fund Theorem states that we can reach any

More information

On the h-vector of a Lattice Path Matroid

On the h-vector of a Lattice Path Matroid On the h-vector of a Lattice Path Matroid Jay Schweig Department of Mathematics University of Kansas Lawrence, KS 66044 jschweig@math.ku.edu Submitted: Sep 16, 2009; Accepted: Dec 18, 2009; Published:

More information

Lecture 19: March 20

Lecture 19: March 20 CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 19: March 0 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may

More information

Black-Scholes Option Pricing

Black-Scholes Option Pricing Black-Scholes Option Pricing The pricing kernel furnishes an alternate derivation of the Black-Scholes formula for the price of a call option. Arbitrage is again the foundation for the theory. 1 Risk-Free

More information

On Existence of Equilibria. Bayesian Allocation-Mechanisms

On Existence of Equilibria. Bayesian Allocation-Mechanisms On Existence of Equilibria in Bayesian Allocation Mechanisms Northwestern University April 23, 2014 Bayesian Allocation Mechanisms In allocation mechanisms, agents choose messages. The messages determine

More information

Advanced topics in continuous time finance

Advanced topics in continuous time finance Based on readings of Prof. Kerry E. Back on the IAS in Vienna, October 21. Advanced topics in continuous time finance Mag. Martin Vonwald (martin@voni.at) November 21 Contents 1 Introduction 4 1.1 Martingale.....................................

More information

There are no predictable jumps in arbitrage-free markets

There are no predictable jumps in arbitrage-free markets There are no predictable jumps in arbitrage-free markets Markus Pelger October 21, 2016 Abstract We model asset prices in the most general sensible form as special semimartingales. This approach allows

More information

Markowitz portfolio theory

Markowitz portfolio theory Markowitz portfolio theory Farhad Amu, Marcus Millegård February 9, 2009 1 Introduction Optimizing a portfolio is a major area in nance. The objective is to maximize the yield and simultaneously minimize

More information

The Stigler-Luckock model with market makers

The Stigler-Luckock model with market makers Prague, January 7th, 2017. Order book Nowadays, demand and supply is often realized by electronic trading systems storing the information in databases. Traders with access to these databases quote their

More information

Sampling Distributions

Sampling Distributions Sampling Distributions This is an important chapter; it is the bridge from probability and descriptive statistics that we studied in Chapters 3 through 7 to inferential statistics which forms the latter

More information

14.461: Technological Change, Lectures 12 and 13 Input-Output Linkages: Implications for Productivity and Volatility

14.461: Technological Change, Lectures 12 and 13 Input-Output Linkages: Implications for Productivity and Volatility 14.461: Technological Change, Lectures 12 and 13 Input-Output Linkages: Implications for Productivity and Volatility Daron Acemoglu MIT October 17 and 22, 2013. Daron Acemoglu (MIT) Input-Output Linkages

More information

3 The Model Existence Theorem

3 The Model Existence Theorem 3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe

More information

Credit Risk using Time Changed Brownian Motions

Credit Risk using Time Changed Brownian Motions Credit Risk using Time Changed Brownian Motions Tom Hurd Mathematics and Statistics McMaster University Joint work with Alexey Kuznetsov (New Brunswick) and Zhuowei Zhou (Mac) 2nd Princeton Credit Conference

More information

arxiv: v2 [math.lo] 13 Feb 2014

arxiv: v2 [math.lo] 13 Feb 2014 A LOWER BOUND FOR GENERALIZED DOMINATING NUMBERS arxiv:1401.7948v2 [math.lo] 13 Feb 2014 DAN HATHAWAY Abstract. We show that when κ and λ are infinite cardinals satisfying λ κ = λ, the cofinality of the

More information

Lecture 2: The Simple Story of 2-SAT

Lecture 2: The Simple Story of 2-SAT 0510-7410: Topics in Algorithms - Random Satisfiability March 04, 2014 Lecture 2: The Simple Story of 2-SAT Lecturer: Benny Applebaum Scribe(s): Mor Baruch 1 Lecture Outline In this talk we will show that

More information

Sparse Wavelet Methods for Option Pricing under Lévy Stochastic Volatility models

Sparse Wavelet Methods for Option Pricing under Lévy Stochastic Volatility models Sparse Wavelet Methods for Option Pricing under Lévy Stochastic Volatility models Norbert Hilber Seminar of Applied Mathematics ETH Zürich Workshop on Financial Modeling with Jump Processes p. 1/18 Outline

More information

Some Discrete Distribution Families

Some Discrete Distribution Families Some Discrete Distribution Families ST 370 Many families of discrete distributions have been studied; we shall discuss the ones that are most commonly found in applications. In each family, we need a formula

More information

A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS. Burhaneddin İZGİ

A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS. Burhaneddin İZGİ A NEW NOTION OF TRANSITIVE RELATIVE RETURN RATE AND ITS APPLICATIONS USING STOCHASTIC DIFFERENTIAL EQUATIONS Burhaneddin İZGİ Department of Mathematics, Istanbul Technical University, Istanbul, Turkey

More information

On Generalized Hopf Differentials

On Generalized Hopf Differentials On 1 Ruhr-Universität Bochum 44780 Bochum Germany e-mail: abresch@math.rub.de August 2006 Joint work with: Harold Rosenberg (Univ. Paris VII) 1 Supported by CNRS and DFG SPP 1154. Table of 1. for Cmc Surfaces

More information

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.

Version A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise. Math 224 Q Exam 3A Fall 217 Tues Dec 12 Version A Problem 1. Let X be the continuous random variable defined by the following pdf: { 1 x/2 when x 2, f(x) otherwise. (a) Compute the mean µ E[X]. E[X] x

More information

Smart Beta: Managing Diversification of Minimum Variance Portfolios

Smart Beta: Managing Diversification of Minimum Variance Portfolios Smart Beta: Managing Diversification of Minimum Variance Portfolios Jean-Charles Richard and Thierry Roncalli Lyxor Asset Management 1, France University of Évry, France Risk Based and Factor Investing

More information

Hedging under Arbitrage

Hedging under Arbitrage Hedging under Arbitrage Johannes Ruf Columbia University, Department of Statistics Modeling and Managing Financial Risks January 12, 2011 Motivation Given: a frictionless market of stocks with continuous

More information

Strong normalisation and the typed lambda calculus

Strong normalisation and the typed lambda calculus CHAPTER 9 Strong normalisation and the typed lambda calculus In the previous chapter we looked at some reduction rules for intuitionistic natural deduction proofs and we have seen that by applying these

More information

Characterization of the Optimum

Characterization of the Optimum ECO 317 Economics of Uncertainty Fall Term 2009 Notes for lectures 5. Portfolio Allocation with One Riskless, One Risky Asset Characterization of the Optimum Consider a risk-averse, expected-utility-maximizing

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

Corrections to the Second Edition of Modeling and Analysis of Stochastic Systems

Corrections to the Second Edition of Modeling and Analysis of Stochastic Systems Corrections to the Second Edition of Modeling and Analysis of Stochastic Systems Vidyadhar Kulkarni November, 200 Send additional corrections to the author at his email address vkulkarn@email.unc.edu.

More information

Chapter 14 : Statistical Inference 1. Note : Here the 4-th and 5-th editions of the text have different chapters, but the material is the same.

Chapter 14 : Statistical Inference 1. Note : Here the 4-th and 5-th editions of the text have different chapters, but the material is the same. Chapter 14 : Statistical Inference 1 Chapter 14 : Introduction to Statistical Inference Note : Here the 4-th and 5-th editions of the text have different chapters, but the material is the same. Data x

More information

A unified "Bang-Bang" Principle with respect to a class of non-anticipative benchmarks

A unified Bang-Bang Principle with respect to a class of non-anticipative benchmarks A unified "Bang-Bang" Principle with respect to a class of non-anticipative benchmarks Phillip Yam (Joint work with Prof. S. P. Yung (Math, HKU), W. Zhou (Math, HKU), John Wright (Math, HKU), Prof. Eddie

More information

Financial Modelling Using Discrete Stochastic Calculus

Financial Modelling Using Discrete Stochastic Calculus Preprint typeset in JHEP style - HYPER VERSION Financial Modelling Using Discrete Stochastic Calculus Eric A. Forgy, Ph.D. E-mail: eforgy@yahoo.com Abstract: In the present report, a review of discrete

More information

Review for Quiz #2 Revised: October 31, 2015

Review for Quiz #2 Revised: October 31, 2015 ECON-UB 233 Dave Backus @ NYU Review for Quiz #2 Revised: October 31, 2015 I ll focus again on the big picture to give you a sense of what we ve done and how it fits together. For each topic/result/concept,

More information

arxiv: v1 [math.lo] 24 Feb 2014

arxiv: v1 [math.lo] 24 Feb 2014 Residuated Basic Logic II. Interpolation, Decidability and Embedding Minghui Ma 1 and Zhe Lin 2 arxiv:1404.7401v1 [math.lo] 24 Feb 2014 1 Institute for Logic and Intelligence, Southwest University, Beibei

More information

M5MF6. Advanced Methods in Derivatives Pricing

M5MF6. Advanced Methods in Derivatives Pricing Course: Setter: M5MF6 Dr Antoine Jacquier MSc EXAMINATIONS IN MATHEMATICS AND FINANCE DEPARTMENT OF MATHEMATICS April 2016 M5MF6 Advanced Methods in Derivatives Pricing Setter s signature...........................................

More information

Optimum Thresholding for Semimartingales with Lévy Jumps under the mean-square error

Optimum Thresholding for Semimartingales with Lévy Jumps under the mean-square error Optimum Thresholding for Semimartingales with Lévy Jumps under the mean-square error José E. Figueroa-López Department of Mathematics Washington University in St. Louis Spring Central Sectional Meeting

More information

Variable Annuity and Interest Rate Risk

Variable Annuity and Interest Rate Risk Variable Annuity and Interest Rate Risk Ling-Ni Boon I,II and Bas J.M. Werker I October 13 th, 2017 Netspar Pension Day, Utrecht. I Tilburg University and Netspar II Université Paris-Dauphine Financial

More information

Homework 3: Asset Pricing

Homework 3: Asset Pricing Homework 3: Asset Pricing Mohammad Hossein Rahmati November 1, 2018 1. Consider an economy with a single representative consumer who maximize E β t u(c t ) 0 < β < 1, u(c t ) = ln(c t + α) t= The sole

More information